./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/diff-alloca-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/array-memsafety/diff-alloca-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 5354e9ad01a67009ef23066f79e8d7348d47bfac4900ab78f9e96f4a6abe271d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:13:30,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:13:30,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:13:30,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:13:30,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:13:30,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:13:30,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:13:30,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:13:30,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:13:30,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:13:30,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:13:30,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:13:30,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:13:30,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:13:30,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:13:30,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:30,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:30,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:30,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:13:30,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:13:30,513 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5354e9ad01a67009ef23066f79e8d7348d47bfac4900ab78f9e96f4a6abe271d [2025-04-29 11:13:30,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:13:30,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:13:30,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:13:30,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:13:30,738 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:13:30,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca-2.c [2025-04-29 11:13:32,000 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562795ed0/cb151bedb1e64caf8527e9caf693dae6/FLAGb9eb67ebe [2025-04-29 11:13:32,234 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:13:32,234 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/diff-alloca-2.c [2025-04-29 11:13:32,237 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:13:32,250 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562795ed0/cb151bedb1e64caf8527e9caf693dae6/FLAGb9eb67ebe [2025-04-29 11:13:33,051 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562795ed0/cb151bedb1e64caf8527e9caf693dae6 [2025-04-29 11:13:33,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:13:33,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:13:33,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:33,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:13:33,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:13:33,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5dd087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33, skipping insertion in model container [2025-04-29 11:13:33,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:13:33,217 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:33,217 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:33,218 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:33,222 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:33,231 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:13:33,260 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:33,271 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:13:33,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33 WrapperNode [2025-04-29 11:13:33,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:33,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:33,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:13:33,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:13:33,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,302 INFO L138 Inliner]: procedures = 9, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2025-04-29 11:13:33,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:33,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:13:33,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:13:33,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:13:33,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,330 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [3, 1, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 3 writes are split as follows [1, 1, 1]. [2025-04-29 11:13:33,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:13:33,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:13:33,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:13:33,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:13:33,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (1/1) ... [2025-04-29 11:13:33,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:33,378 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-04-29 11:13:33,380 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-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:13:33,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:13:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:13:33,462 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:13:33,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:13:33,620 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-04-29 11:13:33,621 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:13:33,628 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:13:33,629 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:13:33,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:33 BoogieIcfgContainer [2025-04-29 11:13:33,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:13:33,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:13:33,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:13:33,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:13:33,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:13:33" (1/3) ... [2025-04-29 11:13:33,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e73d6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:33, skipping insertion in model container [2025-04-29 11:13:33,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:33" (2/3) ... [2025-04-29 11:13:33,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e73d6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:33, skipping insertion in model container [2025-04-29 11:13:33,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:33" (3/3) ... [2025-04-29 11:13:33,637 INFO L128 eAbstractionObserver]: Analyzing ICFG diff-alloca-2.c [2025-04-29 11:13:33,646 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:13:33,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diff-alloca-2.c that has 1 procedures, 38 locations, 45 edges, 1 initial locations, 4 loop locations, and 13 error locations. [2025-04-29 11:13:33,678 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:13:33,688 INFO L340 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;@5dedd4c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:13:33,689 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:13:33,693 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 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-04-29 11:13:33,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:33,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:33,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:33,698 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:33,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-29 11:13:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:33,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162970389] [2025-04-29 11:13:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:33,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:33,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:33,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:33,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:34,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162970389] [2025-04-29 11:13:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162970389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:34,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:34,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071769208] [2025-04-29 11:13:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:34,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:34,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:34,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:34,038 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04-29 11:13:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:34,083 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-04-29 11:13:34,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:34,084 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04-29 11:13:34,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:34,088 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:13:34,088 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 11:13:34,089 INFO L436 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-04-29 11:13:34,091 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:34,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 11:13:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-29 11:13:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.826086956521739) internal successors, (42), 34 states have internal predecessors, (42), 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-04-29 11:13:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-04-29 11:13:34,115 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2025-04-29 11:13:34,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:34,115 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-04-29 11:13:34,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04-29 11:13:34,115 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-04-29 11:13:34,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:34,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:34,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:34,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:13:34,117 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:34,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-29 11:13:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:34,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201534926] [2025-04-29 11:13:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:34,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:34,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:34,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:34,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:34,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201534926] [2025-04-29 11:13:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201534926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:34,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681754367] [2025-04-29 11:13:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:34,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:34,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:34,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:34,422 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-04-29 11:13:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:34,502 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-04-29 11:13:34,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:34,502 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-04-29 11:13:34,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:34,502 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:13:34,503 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:13:34,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:34,505 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:34,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:13:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-04-29 11:13:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 38 states have internal predecessors, (47), 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-04-29 11:13:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-04-29 11:13:34,511 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 7 [2025-04-29 11:13:34,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:34,512 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-04-29 11:13:34,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-04-29 11:13:34,512 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-04-29 11:13:34,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:34,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:34,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:34,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:13:34,513 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:34,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-29 11:13:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:34,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170556722] [2025-04-29 11:13:34,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:34,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:34,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:34,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:34,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:34,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:34,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:34,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170556722] [2025-04-29 11:13:34,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170556722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:34,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:34,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460741572] [2025-04-29 11:13:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:34,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:34,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:34,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:34,751 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-04-29 11:13:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:34,835 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-04-29 11:13:34,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:34,836 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-04-29 11:13:34,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:34,836 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:13:34,836 INFO L226 Difference]: Without dead ends: 42 [2025-04-29 11:13:34,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:34,838 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:34,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 111 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-29 11:13:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-04-29 11:13:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.76) internal successors, (44), 36 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-04-29 11:13:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-04-29 11:13:34,843 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 7 [2025-04-29 11:13:34,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:34,843 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-04-29 11:13:34,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-04-29 11:13:34,843 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-04-29 11:13:34,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:13:34,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:34,843 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:34,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:13:34,844 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:34,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-29 11:13:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:34,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641819] [2025-04-29 11:13:34,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:34,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:34,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:34,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:34,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:34,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:34,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641819] [2025-04-29 11:13:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:34,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38259560] [2025-04-29 11:13:34,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:34,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:34,894 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-04-29 11:13:34,896 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-04-29 11:13:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:34,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:34,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:34,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:13:34,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:35,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38259560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:13:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543282331] [2025-04-29 11:13:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:35,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:35,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:35,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:35,004 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-29 11:13:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:35,033 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-04-29 11:13:35,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:35,033 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-04-29 11:13:35,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:35,034 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:13:35,034 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:13:35,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:35,035 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 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-04-29 11:13:35,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:13:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2025-04-29 11:13:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 42 states have internal predecessors, (51), 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-04-29 11:13:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-04-29 11:13:35,038 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 10 [2025-04-29 11:13:35,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:35,039 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-04-29 11:13:35,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-29 11:13:35,039 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-04-29 11:13:35,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:13:35,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:35,039 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:35,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:13:35,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,244 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:35,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-29 11:13:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:35,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790998679] [2025-04-29 11:13:35,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:35,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:35,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:35,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:35,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790998679] [2025-04-29 11:13:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790998679] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:35,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522274924] [2025-04-29 11:13:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:35,562 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-04-29 11:13:35,564 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-04-29 11:13:35,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:35,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:35,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:35,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:13:35,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:35,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:35,672 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2025-04-29 11:13:35,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:35,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:35,710 INFO L325 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-04-29 11:13:35,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2025-04-29 11:13:35,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:36,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:36,261 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:13:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522274924] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:36,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-29 11:13:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797964992] [2025-04-29 11:13:36,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:36,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:36,331 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 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-04-29 11:13:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:36,575 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-04-29 11:13:36,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:36,576 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 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 10 [2025-04-29 11:13:36,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:36,577 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:13:36,577 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:13:36,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:13:36,578 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:36,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 201 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:13:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-04-29 11:13:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 40 states have internal predecessors, (49), 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-04-29 11:13:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-04-29 11:13:36,587 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 10 [2025-04-29 11:13:36,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:36,587 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-04-29 11:13:36,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 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-04-29 11:13:36,589 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-04-29 11:13:36,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:36,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:36,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:36,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:13:36,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:36,791 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:36,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417044, now seen corresponding path program 1 times [2025-04-29 11:13:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:36,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357002252] [2025-04-29 11:13:36,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:36,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:36,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:36,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357002252] [2025-04-29 11:13:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357002252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:36,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660671718] [2025-04-29 11:13:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:36,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:36,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:36,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:36,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:36,922 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-04-29 11:13:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:36,969 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-29 11:13:36,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:36,970 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 11 [2025-04-29 11:13:36,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:36,970 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:36,970 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:36,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:36,971 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:36,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-04-29 11:13:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5) internal successors, (63), 52 states have internal predecessors, (63), 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-04-29 11:13:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-04-29 11:13:36,976 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 11 [2025-04-29 11:13:36,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:36,976 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-04-29 11:13:36,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-04-29 11:13:36,977 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-04-29 11:13:36,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:36,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:36,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:36,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:13:36,978 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:36,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417045, now seen corresponding path program 1 times [2025-04-29 11:13:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:36,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358491233] [2025-04-29 11:13:36,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:36,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:36,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:36,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:36,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:37,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358491233] [2025-04-29 11:13:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358491233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:37,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528459846] [2025-04-29 11:13:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:37,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:37,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:37,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:37,025 INFO L87 Difference]: Start difference. First operand 53 states and 63 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-04-29 11:13:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:37,041 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-29 11:13:37,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:37,042 INFO L79 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 11 [2025-04-29 11:13:37,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:37,043 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:13:37,043 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:13:37,043 INFO L436 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-04-29 11:13:37,044 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:37,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:13:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:13:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 51 states have internal predecessors, (61), 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-04-29 11:13:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-04-29 11:13:37,046 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-04-29 11:13:37,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:37,046 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-04-29 11:13:37,046 INFO L486 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-04-29 11:13:37,046 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-04-29 11:13:37,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:37,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:37,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:37,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:13:37,050 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:37,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1461203626, now seen corresponding path program 1 times [2025-04-29 11:13:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:37,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832622204] [2025-04-29 11:13:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:37,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:37,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:37,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:37,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:37,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:37,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832622204] [2025-04-29 11:13:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832622204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:13:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100799084] [2025-04-29 11:13:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:37,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:13:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:37,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:13:37,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:37,238 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-04-29 11:13:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:37,278 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2025-04-29 11:13:37,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:37,279 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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 11 [2025-04-29 11:13:37,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:37,279 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:13:37,279 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:13:37,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:37,280 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:37,280 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 81 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:13:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2025-04-29 11:13:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.5625) internal successors, (50), 41 states have internal predecessors, (50), 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-04-29 11:13:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-04-29 11:13:37,282 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 11 [2025-04-29 11:13:37,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:37,282 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-04-29 11:13:37,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-04-29 11:13:37,282 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-04-29 11:13:37,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:13:37,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:37,285 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:37,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:13:37,285 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:37,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 522585690, now seen corresponding path program 1 times [2025-04-29 11:13:37,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:37,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929297841] [2025-04-29 11:13:37,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:37,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:13:37,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:13:37,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:37,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:37,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929297841] [2025-04-29 11:13:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929297841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:37,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906807024] [2025-04-29 11:13:37,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:37,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:37,331 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-04-29 11:13:37,334 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-04-29 11:13:37,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:13:37,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:13:37,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:37,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:13:37,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:37,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906807024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:13:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293983540] [2025-04-29 11:13:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:37,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:37,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:37,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:37,410 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-04-29 11:13:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:37,429 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-29 11:13:37,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:37,430 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2025-04-29 11:13:37,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:37,430 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:13:37,430 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:13:37,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:37,431 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:37,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:13:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:13:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 55 states have internal predecessors, (65), 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-04-29 11:13:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-04-29 11:13:37,434 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 14 [2025-04-29 11:13:37,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:37,434 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-04-29 11:13:37,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-04-29 11:13:37,435 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-04-29 11:13:37,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:13:37,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:37,435 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:37,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:13:37,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:37,639 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:37,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1223650268, now seen corresponding path program 1 times [2025-04-29 11:13:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:37,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59626261] [2025-04-29 11:13:37,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:13:37,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:13:37,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:37,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59626261] [2025-04-29 11:13:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59626261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:37,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718468127] [2025-04-29 11:13:37,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:37,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:37,836 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-04-29 11:13:37,838 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-04-29 11:13:37,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:13:37,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:13:37,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:37,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:37,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:13:37,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:37,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:37,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-04-29 11:13:37,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:37,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:37,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-04-29 11:13:37,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:37,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:37,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:13:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:38,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:38,323 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:13:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718468127] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:38,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-29 11:13:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869955577] [2025-04-29 11:13:38,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:38,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:13:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:38,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:13:38,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:13:38,379 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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-04-29 11:13:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:38,551 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-29 11:13:38,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:38,553 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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 14 [2025-04-29 11:13:38,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:38,554 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:13:38,554 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:13:38,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:13:38,555 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:38,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 215 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:13:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-29 11:13:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4) internal successors, (63), 53 states have internal predecessors, (63), 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-04-29 11:13:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-04-29 11:13:38,557 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 14 [2025-04-29 11:13:38,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:38,557 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-04-29 11:13:38,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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-04-29 11:13:38,558 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-04-29 11:13:38,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:38,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:38,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:38,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:13:38,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:38,759 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:38,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -306138691, now seen corresponding path program 1 times [2025-04-29 11:13:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:38,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268291038] [2025-04-29 11:13:38,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:38,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268291038] [2025-04-29 11:13:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268291038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:38,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:38,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:38,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281867689] [2025-04-29 11:13:38,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:38,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:38,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:38,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:38,804 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04-29 11:13:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:38,832 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-29 11:13:38,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:38,832 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-04-29 11:13:38,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:38,833 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:13:38,833 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:13:38,833 INFO L436 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-04-29 11:13:38,833 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:38,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:13:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:13:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 states have internal predecessors, (61), 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-04-29 11:13:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-04-29 11:13:38,837 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 16 [2025-04-29 11:13:38,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:38,837 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-04-29 11:13:38,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04-29 11:13:38,837 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-04-29 11:13:38,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:38,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:38,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:38,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:13:38,842 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:38,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash -306138690, now seen corresponding path program 1 times [2025-04-29 11:13:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:38,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138392694] [2025-04-29 11:13:38,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:38,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:38,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138392694] [2025-04-29 11:13:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138392694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:38,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162412789] [2025-04-29 11:13:38,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:38,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:38,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:38,964 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-04-29 11:13:38,965 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-04-29 11:13:39,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:39,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:39,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:39,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:13:39,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:39,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:13:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162412789] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:39,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-04-29 11:13:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786484923] [2025-04-29 11:13:39,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:39,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:13:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:13:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:13:39,146 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-04-29 11:13:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:39,224 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-04-29 11:13:39,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:39,225 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 16 [2025-04-29 11:13:39,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:39,225 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:13:39,225 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:13:39,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:39,225 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:39,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:13:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2025-04-29 11:13:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.38) internal successors, (69), 56 states have internal predecessors, (69), 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-04-29 11:13:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-04-29 11:13:39,232 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2025-04-29 11:13:39,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:39,232 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-04-29 11:13:39,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-04-29 11:13:39,232 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-04-29 11:13:39,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:39,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:39,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:39,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:39,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:13:39,433 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:39,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -306104993, now seen corresponding path program 1 times [2025-04-29 11:13:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:39,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720979605] [2025-04-29 11:13:39,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:39,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:39,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:39,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:39,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:39,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720979605] [2025-04-29 11:13:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720979605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833466600] [2025-04-29 11:13:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:39,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:39,478 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-04-29 11:13:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:39,497 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-04-29 11:13:39,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:39,497 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-04-29 11:13:39,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:39,498 INFO L225 Difference]: With dead ends: 70 [2025-04-29 11:13:39,498 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 11:13:39,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:39,498 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:39,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 11:13:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2025-04-29 11:13:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.36) internal successors, (68), 56 states have internal predecessors, (68), 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-04-29 11:13:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-04-29 11:13:39,503 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 16 [2025-04-29 11:13:39,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:39,503 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-04-29 11:13:39,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-04-29 11:13:39,503 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-04-29 11:13:39,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:13:39,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:39,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:39,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:13:39,504 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:39,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash -900364812, now seen corresponding path program 1 times [2025-04-29 11:13:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:39,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683689987] [2025-04-29 11:13:39,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:39,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:13:39,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:13:39,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:39,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:39,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683689987] [2025-04-29 11:13:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683689987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166737465] [2025-04-29 11:13:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:39,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:39,545 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-04-29 11:13:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:39,564 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-04-29 11:13:39,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:39,564 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-04-29 11:13:39,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:39,564 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:13:39,564 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:13:39,564 INFO L436 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-04-29 11:13:39,565 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:39,565 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:13:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:13:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 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-04-29 11:13:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-04-29 11:13:39,566 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2025-04-29 11:13:39,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:39,566 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-04-29 11:13:39,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-04-29 11:13:39,567 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-04-29 11:13:39,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:13:39,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:39,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:39,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:13:39,567 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:39,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash -900364811, now seen corresponding path program 1 times [2025-04-29 11:13:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:39,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070374344] [2025-04-29 11:13:39,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:13:39,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:13:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:39,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:39,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070374344] [2025-04-29 11:13:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070374344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:39,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162473913] [2025-04-29 11:13:39,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:39,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:39,671 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-04-29 11:13:39,672 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-04-29 11:13:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:13:39,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:13:39,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:39,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:13:39,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:39,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:13:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162473913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:39,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-29 11:13:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362589134] [2025-04-29 11:13:39,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:39,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:13:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:39,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:13:39,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:39,844 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-04-29 11:13:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:39,950 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-04-29 11:13:39,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:39,950 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 17 [2025-04-29 11:13:39,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:39,951 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:13:39,951 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:13:39,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:39,951 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:39,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:13:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-04-29 11:13:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 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-04-29 11:13:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-04-29 11:13:39,953 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 17 [2025-04-29 11:13:39,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:39,953 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-04-29 11:13:39,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-04-29 11:13:39,954 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-04-29 11:13:39,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:39,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:39,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:39,960 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-04-29 11:13:40,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:13:40,155 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:40,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2141072478, now seen corresponding path program 1 times [2025-04-29 11:13:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:40,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562874338] [2025-04-29 11:13:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:40,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:40,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:40,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:40,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562874338] [2025-04-29 11:13:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562874338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817023319] [2025-04-29 11:13:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:40,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:40,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:40,210 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04-29 11:13:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:40,234 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-04-29 11:13:40,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:40,234 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04-29 11:13:40,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:40,234 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:13:40,234 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:13:40,235 INFO L436 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-04-29 11:13:40,235 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:40,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:13:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-04-29 11:13:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.320754716981132) internal successors, (70), 57 states have internal predecessors, (70), 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-04-29 11:13:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-04-29 11:13:40,237 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 18 [2025-04-29 11:13:40,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:40,237 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-04-29 11:13:40,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04-29 11:13:40,237 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-04-29 11:13:40,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:40,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:40,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:40,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:13:40,237 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:40,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2141072477, now seen corresponding path program 1 times [2025-04-29 11:13:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:40,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110676255] [2025-04-29 11:13:40,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:40,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:40,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110676255] [2025-04-29 11:13:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110676255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:40,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27440750] [2025-04-29 11:13:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:40,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:40,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:40,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:40,284 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04-29 11:13:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:40,305 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-29 11:13:40,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:40,305 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04-29 11:13:40,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:40,306 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:13:40,306 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:13:40,306 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:40,306 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:40,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:13:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-04-29 11:13:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 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-04-29 11:13:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-04-29 11:13:40,308 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 18 [2025-04-29 11:13:40,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:40,308 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-04-29 11:13:40,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04-29 11:13:40,308 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-04-29 11:13:40,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:13:40,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:40,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:40,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:13:40,308 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:40,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash -142309523, now seen corresponding path program 1 times [2025-04-29 11:13:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:40,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126634339] [2025-04-29 11:13:40,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:40,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:13:40,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:13:40,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:40,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126634339] [2025-04-29 11:13:40,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126634339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:40,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070441113] [2025-04-29 11:13:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:40,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:40,361 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-04-29 11:13:40,363 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-04-29 11:13:40,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:13:40,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:13:40,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:13:40,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:40,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070441113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-29 11:13:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788135496] [2025-04-29 11:13:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:40,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:40,470 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-04-29 11:13:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:40,517 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-04-29 11:13:40,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:40,517 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-04-29 11:13:40,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:40,518 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:13:40,518 INFO L226 Difference]: Without dead ends: 74 [2025-04-29 11:13:40,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:40,518 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:40,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-29 11:13:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-04-29 11:13:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 70 states have internal predecessors, (87), 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-04-29 11:13:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2025-04-29 11:13:40,520 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 21 [2025-04-29 11:13:40,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:40,520 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-04-29 11:13:40,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-04-29 11:13:40,520 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2025-04-29 11:13:40,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:13:40,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:40,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:40,527 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-04-29 11:13:40,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:40,725 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:40,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2136454229, now seen corresponding path program 1 times [2025-04-29 11:13:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:40,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624604080] [2025-04-29 11:13:40,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:13:40,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:13:40,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:40,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624604080] [2025-04-29 11:13:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624604080] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:40,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302134749] [2025-04-29 11:13:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:40,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:40,795 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-04-29 11:13:40,796 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-04-29 11:13:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:13:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:13:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:40,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:13:40,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:40,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302134749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:40,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-29 11:13:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018918363] [2025-04-29 11:13:40,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:40,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:13:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:13:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:40,934 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-04-29 11:13:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:40,976 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2025-04-29 11:13:40,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:40,976 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 21 [2025-04-29 11:13:40,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:40,977 INFO L225 Difference]: With dead ends: 94 [2025-04-29 11:13:40,977 INFO L226 Difference]: Without dead ends: 94 [2025-04-29 11:13:40,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:40,977 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:40,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 153 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-29 11:13:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2025-04-29 11:13:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 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-04-29 11:13:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-04-29 11:13:40,979 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 21 [2025-04-29 11:13:40,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:40,979 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-04-29 11:13:40,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-04-29 11:13:40,979 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-04-29 11:13:40,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:40,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:40,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:40,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:41,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:41,184 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:41,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash -118042071, now seen corresponding path program 1 times [2025-04-29 11:13:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:41,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502293695] [2025-04-29 11:13:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:41,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:41,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:41,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502293695] [2025-04-29 11:13:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502293695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:41,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336649551] [2025-04-29 11:13:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:41,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:41,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:41,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:41,216 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04-29 11:13:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:41,236 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-04-29 11:13:41,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:41,236 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-04-29 11:13:41,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:41,237 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:13:41,237 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 11:13:41,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04-29 11:13:41,238 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:41,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 11:13:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-29 11:13:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 75 states have internal predecessors, (91), 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-04-29 11:13:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2025-04-29 11:13:41,240 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 22 [2025-04-29 11:13:41,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:41,240 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-04-29 11:13:41,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04-29 11:13:41,240 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2025-04-29 11:13:41,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:41,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:41,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:41,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:13:41,240 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:41,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -116195029, now seen corresponding path program 1 times [2025-04-29 11:13:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:41,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166546344] [2025-04-29 11:13:41,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:41,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:41,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:41,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166546344] [2025-04-29 11:13:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166546344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:41,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312191014] [2025-04-29 11:13:41,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:41,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:41,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:13:41,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:41,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:41,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 11:13:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:41,557 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:13:41,557 INFO L354 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-04-29 11:13:41,567 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-29 11:13:41,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2025-04-29 11:13:41,574 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-29 11:13:41,574 INFO L354 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 1 case distinctions, treesize of input 9 treesize of output 1 [2025-04-29 11:13:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:41,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312191014] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:13:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 17 [2025-04-29 11:13:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122598373] [2025-04-29 11:13:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:41,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:13:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:13:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:13:41,911 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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-04-29 11:13:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:42,009 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2025-04-29 11:13:42,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:42,009 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2025-04-29 11:13:42,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:42,009 INFO L225 Difference]: With dead ends: 124 [2025-04-29 11:13:42,009 INFO L226 Difference]: Without dead ends: 124 [2025-04-29 11:13:42,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:42,010 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:42,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 96 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-04-29 11:13:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2025-04-29 11:13:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 118 states have internal predecessors, (146), 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-04-29 11:13:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2025-04-29 11:13:42,012 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 22 [2025-04-29 11:13:42,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:42,012 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2025-04-29 11:13:42,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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-04-29 11:13:42,012 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2025-04-29 11:13:42,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:42,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:42,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:13:42,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:42,218 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:42,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -933843479, now seen corresponding path program 1 times [2025-04-29 11:13:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:42,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855277069] [2025-04-29 11:13:42,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:42,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:42,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:42,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:42,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:42,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855277069] [2025-04-29 11:13:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855277069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:42,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205030240] [2025-04-29 11:13:42,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:42,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:42,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:13:42,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:42,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:42,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:42,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-29 11:13:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:42,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:42,461 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:13:42,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-04-29 11:13:42,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:42,480 INFO L325 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-04-29 11:13:42,480 INFO L354 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 1 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:13:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:42,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205030240] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:13:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2025-04-29 11:13:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004526858] [2025-04-29 11:13:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:42,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:42,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:42,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:42,781 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04-29 11:13:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:42,807 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2025-04-29 11:13:42,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:42,809 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-04-29 11:13:42,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:42,810 INFO L225 Difference]: With dead ends: 150 [2025-04-29 11:13:42,810 INFO L226 Difference]: Without dead ends: 150 [2025-04-29 11:13:42,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:42,811 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:42,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-29 11:13:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2025-04-29 11:13:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 101 states have internal predecessors, (127), 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-04-29 11:13:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2025-04-29 11:13:42,813 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 22 [2025-04-29 11:13:42,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:42,813 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2025-04-29 11:13:42,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04-29 11:13:42,814 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2025-04-29 11:13:42,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:13:42,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:42,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:42,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:43,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:13:43,019 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:43,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1760695504, now seen corresponding path program 1 times [2025-04-29 11:13:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:43,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947427138] [2025-04-29 11:13:43,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:43,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:43,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947427138] [2025-04-29 11:13:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947427138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:43,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58736763] [2025-04-29 11:13:43,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:43,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:43,070 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:43,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:13:43,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:43,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:13:43,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:43,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58736763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:43,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:13:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342159825] [2025-04-29 11:13:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:43,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:43,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:43,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:43,188 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-29 11:13:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:43,212 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2025-04-29 11:13:43,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:43,213 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2025-04-29 11:13:43,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:43,213 INFO L225 Difference]: With dead ends: 148 [2025-04-29 11:13:43,213 INFO L226 Difference]: Without dead ends: 148 [2025-04-29 11:13:43,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:43,214 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:43,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-29 11:13:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2025-04-29 11:13:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 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-04-29 11:13:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2025-04-29 11:13:43,216 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 24 [2025-04-29 11:13:43,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:43,216 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2025-04-29 11:13:43,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-29 11:13:43,217 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2025-04-29 11:13:43,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:13:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:43,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:43,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:13:43,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:13:43,418 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:43,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1760661807, now seen corresponding path program 1 times [2025-04-29 11:13:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:43,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309866225] [2025-04-29 11:13:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:43,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:43,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:43,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:43,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:43,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309866225] [2025-04-29 11:13:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309866225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:43,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40447897] [2025-04-29 11:13:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:43,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:43,626 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:43,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:13:43,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:43,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:43,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:43,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:43,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:13:43,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:44,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40447897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-04-29 11:13:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860091414] [2025-04-29 11:13:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:44,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:44,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:44,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:44,165 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-04-29 11:13:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:44,198 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2025-04-29 11:13:44,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:44,198 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2025-04-29 11:13:44,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:44,199 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:13:44,199 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:13:44,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:44,199 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:44,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:13:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-29 11:13:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 108 states have internal predecessors, (132), 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-04-29 11:13:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2025-04-29 11:13:44,203 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 24 [2025-04-29 11:13:44,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:44,203 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2025-04-29 11:13:44,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-04-29 11:13:44,203 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2025-04-29 11:13:44,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:13:44,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:44,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:44,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:44,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:13:44,408 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:44,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1379348061, now seen corresponding path program 2 times [2025-04-29 11:13:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:44,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356444014] [2025-04-29 11:13:44,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:44,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:13:44,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:44,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:44,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:44,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356444014] [2025-04-29 11:13:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356444014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:44,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991280664] [2025-04-29 11:13:44,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:44,532 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:44,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:13:44,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:13:44,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:44,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:44,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:44,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:13:44,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:44,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:44,800 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-29 11:13:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991280664] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:44,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:13:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506481664] [2025-04-29 11:13:44,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:44,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:13:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:13:44,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:13:44,858 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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-04-29 11:13:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:45,175 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2025-04-29 11:13:45,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:13:45,175 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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 24 [2025-04-29 11:13:45,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:45,176 INFO L225 Difference]: With dead ends: 131 [2025-04-29 11:13:45,176 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:13:45,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:13:45,177 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:45,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 243 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:13:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2025-04-29 11:13:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 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-04-29 11:13:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2025-04-29 11:13:45,181 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 24 [2025-04-29 11:13:45,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:45,181 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2025-04-29 11:13:45,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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-04-29 11:13:45,181 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2025-04-29 11:13:45,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:13:45,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:45,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:45,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:13:45,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:13:45,382 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:45,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1541840786, now seen corresponding path program 1 times [2025-04-29 11:13:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:45,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121464512] [2025-04-29 11:13:45,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:45,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:45,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:45,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:45,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:45,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121464512] [2025-04-29 11:13:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121464512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:45,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666014261] [2025-04-29 11:13:45,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:45,433 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:13:45,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:13:45,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:13:45,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:45,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:45,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:13:45,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:45,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666014261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:45,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:45,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-29 11:13:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037933991] [2025-04-29 11:13:45,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:45,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:13:45,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:45,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:13:45,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:45,577 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-04-29 11:13:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:45,611 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2025-04-29 11:13:45,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:45,612 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 24 [2025-04-29 11:13:45,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:45,612 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:13:45,612 INFO L226 Difference]: Without dead ends: 94 [2025-04-29 11:13:45,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:45,613 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:45,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-29 11:13:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-04-29 11:13:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 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-04-29 11:13:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-04-29 11:13:45,615 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 24 [2025-04-29 11:13:45,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:45,615 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-04-29 11:13:45,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-04-29 11:13:45,615 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-04-29 11:13:45,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:13:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:45,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:45,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:13:45,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:45,822 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:45,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1191762920, now seen corresponding path program 2 times [2025-04-29 11:13:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:45,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123793383] [2025-04-29 11:13:45,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:45,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 11:13:45,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:13:45,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:45,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:45,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123793383] [2025-04-29 11:13:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123793383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:45,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962357080] [2025-04-29 11:13:45,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:45,964 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:45,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:13:46,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 11:13:46,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:13:46,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:46,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:13:46,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:46,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:46,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-29 11:13:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962357080] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:46,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-04-29 11:13:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160270202] [2025-04-29 11:13:46,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:46,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:13:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:46,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:13:46,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:13:46,288 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 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-04-29 11:13:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:46,494 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2025-04-29 11:13:46,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:13:46,495 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 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 27 [2025-04-29 11:13:46,495 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:46,495 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:13:46,495 INFO L226 Difference]: Without dead ends: 167 [2025-04-29 11:13:46,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:13:46,496 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:46,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-29 11:13:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 82. [2025-04-29 11:13:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 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-04-29 11:13:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-04-29 11:13:46,502 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 27 [2025-04-29 11:13:46,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:46,502 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-04-29 11:13:46,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 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-04-29 11:13:46,502 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-04-29 11:13:46,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:13:46,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:46,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:46,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:13:46,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:13:46,703 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:46,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash -560689198, now seen corresponding path program 1 times [2025-04-29 11:13:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:46,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833170113] [2025-04-29 11:13:46,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:46,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:13:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:13:46,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:46,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:46,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:46,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833170113] [2025-04-29 11:13:46,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833170113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:46,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768455611] [2025-04-29 11:13:46,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:46,942 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:46,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:13:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:13:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:13:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:47,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:13:47,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:47,036 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:13:47,036 INFO L354 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 1 case distinctions, treesize of input 13 treesize of output 15 [2025-04-29 11:13:47,062 INFO L325 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-04-29 11:13:47,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-04-29 11:13:47,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:47,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768455611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:47,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-29 11:13:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308957533] [2025-04-29 11:13:47,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:47,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:13:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:47,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:13:47,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:13:47,701 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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-04-29 11:13:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:47,880 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2025-04-29 11:13:47,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:47,881 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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-04-29 11:13:47,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:47,881 INFO L225 Difference]: With dead ends: 112 [2025-04-29 11:13:47,881 INFO L226 Difference]: Without dead ends: 112 [2025-04-29 11:13:47,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:47,882 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:47,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-29 11:13:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-04-29 11:13:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 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-04-29 11:13:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-04-29 11:13:47,884 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 36 [2025-04-29 11:13:47,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:47,884 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-04-29 11:13:47,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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-04-29 11:13:47,884 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-04-29 11:13:47,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:13:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:47,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:47,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:48,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:13:48,089 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:48,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1527462781, now seen corresponding path program 2 times [2025-04-29 11:13:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:48,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404332483] [2025-04-29 11:13:48,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:48,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:13:48,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:13:48,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:48,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:48,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404332483] [2025-04-29 11:13:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404332483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:48,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655914048] [2025-04-29 11:13:48,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:48,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:48,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:48,185 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:48,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:13:48,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:13:48,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:13:48,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:48,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:48,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:13:48,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:48,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655914048] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:48,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-04-29 11:13:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363094800] [2025-04-29 11:13:48,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:48,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:13:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:48,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:13:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:48,416 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 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-04-29 11:13:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:48,470 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2025-04-29 11:13:48,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:48,470 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 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 47 [2025-04-29 11:13:48,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:48,470 INFO L225 Difference]: With dead ends: 217 [2025-04-29 11:13:48,470 INFO L226 Difference]: Without dead ends: 118 [2025-04-29 11:13:48,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:48,471 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:48,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 207 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-29 11:13:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-04-29 11:13:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 113 states have internal predecessors, (135), 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-04-29 11:13:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-04-29 11:13:48,473 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 47 [2025-04-29 11:13:48,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:48,473 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-04-29 11:13:48,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 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-04-29 11:13:48,477 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-04-29 11:13:48,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:13:48,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:48,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:48,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-29 11:13:48,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:13:48,678 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:48,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -41353271, now seen corresponding path program 3 times [2025-04-29 11:13:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:48,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111631112] [2025-04-29 11:13:48,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:48,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-29 11:13:48,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:13:48,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:13:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:49,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111631112] [2025-04-29 11:13:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111631112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:49,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041304758] [2025-04-29 11:13:49,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:49,063 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:13:49,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-29 11:13:49,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:13:49,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:13:49,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:13:49,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:49,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:49,223 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:13:49,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-04-29 11:13:49,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:49,251 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:49,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2025-04-29 11:13:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:49,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:13:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041304758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:50,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2025-04-29 11:13:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156553335] [2025-04-29 11:13:50,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:50,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:13:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:50,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:13:50,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:13:50,088 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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-04-29 11:13:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:50,382 INFO L93 Difference]: Finished difference Result 144 states and 170 transitions. [2025-04-29 11:13:50,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:50,382 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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 50 [2025-04-29 11:13:50,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:50,383 INFO L225 Difference]: With dead ends: 144 [2025-04-29 11:13:50,383 INFO L226 Difference]: Without dead ends: 144 [2025-04-29 11:13:50,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:13:50,384 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:50,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 283 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-29 11:13:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-04-29 11:13:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 139 states have internal predecessors, (166), 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-04-29 11:13:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 166 transitions. [2025-04-29 11:13:50,386 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 166 transitions. Word has length 50 [2025-04-29 11:13:50,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:50,387 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 166 transitions. [2025-04-29 11:13:50,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.916666666666667) internal successors, (142), 25 states have internal predecessors, (142), 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-04-29 11:13:50,387 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 166 transitions. [2025-04-29 11:13:50,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-29 11:13:50,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:50,387 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:50,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:13:50,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:50,588 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:50,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -660896724, now seen corresponding path program 4 times [2025-04-29 11:13:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:50,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593464494] [2025-04-29 11:13:50,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:50,603 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:13:50,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:13:50,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:50,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593464494] [2025-04-29 11:13:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593464494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:50,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759548572] [2025-04-29 11:13:50,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:50,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:50,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:50,742 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:50,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:13:50,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:13:50,839 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:13:50,839 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:50,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:50,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:13:50,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:50,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759548572] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:51,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2025-04-29 11:13:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622165740] [2025-04-29 11:13:51,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:51,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:13:51,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:51,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:13:51,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:51,008 INFO L87 Difference]: Start difference. First operand 140 states and 166 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-04-29 11:13:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:51,071 INFO L93 Difference]: Finished difference Result 331 states and 383 transitions. [2025-04-29 11:13:51,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:51,074 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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 61 [2025-04-29 11:13:51,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:51,074 INFO L225 Difference]: With dead ends: 331 [2025-04-29 11:13:51,078 INFO L226 Difference]: Without dead ends: 150 [2025-04-29 11:13:51,079 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:51,079 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:51,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 269 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-29 11:13:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2025-04-29 11:13:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.186206896551724) internal successors, (172), 145 states have internal predecessors, (172), 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-04-29 11:13:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2025-04-29 11:13:51,081 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 61 [2025-04-29 11:13:51,081 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:51,081 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2025-04-29 11:13:51,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-04-29 11:13:51,081 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2025-04-29 11:13:51,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:13:51,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:51,082 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:51,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:51,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:51,282 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-29 11:13:51,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1045721870, now seen corresponding path program 5 times [2025-04-29 11:13:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:51,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733050194] [2025-04-29 11:13:51,283 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:51,290 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 6 equivalence classes. [2025-04-29 11:13:51,306 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:13:51,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-29 11:13:51,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-29 11:13:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:51,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733050194] [2025-04-29 11:13:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733050194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:51,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723118068] [2025-04-29 11:13:51,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:51,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:51,659 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:51,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:13:51,722 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 6 equivalence classes. [2025-04-29 11:13:51,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:13:51,776 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-29 11:13:51,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:51,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:13:51,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:51,792 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:13:51,792 INFO L354 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 1 case distinctions, treesize of input 13 treesize of output 15 [2025-04-29 11:13:51,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:13:51,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:51,821 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:13:51,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-04-29 11:13:51,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:51,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-29 11:13:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:52,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723118068] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:52,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:52,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-29 11:13:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749362206] [2025-04-29 11:13:52,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:52,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:13:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:52,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:13:52,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:13:52,917 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand has 31 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 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-04-29 11:13:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:53,480 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2025-04-29 11:13:53,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:13:53,480 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 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 64 [2025-04-29 11:13:53,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:53,480 INFO L225 Difference]: With dead ends: 189 [2025-04-29 11:13:53,480 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:13:53,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:13:53,481 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:53,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 362 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:13:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:13:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-29 11:13:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:13:53,485 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2025-04-29 11:13:53,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:53,485 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:13:53,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.833333333333333) internal successors, (175), 31 states have internal predecessors, (175), 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-04-29 11:13:53,485 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:13:53,485 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:13:53,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2025-04-29 11:13:53,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-04-29 11:13:53,487 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-04-29 11:13:53,488 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-04-29 11:13:53,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 11:13:53,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-29 11:13:53,690 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:53,692 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:13:53,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:13:53 BoogieIcfgContainer [2025-04-29 11:13:53,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:13:53,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:13:53,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:13:53,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:13:53,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:33" (3/4) ... [2025-04-29 11:13:53,696 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:13:53,702 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-04-29 11:13:53,702 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:13:53,703 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:13:53,703 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:13:53,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:13:53,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:13:53,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:13:53,755 INFO L158 Benchmark]: Toolchain (without parser) took 20700.95ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 116.6MB in the beginning and 181.4MB in the end (delta: -64.8MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,755 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:13:53,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.81ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 102.6MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,757 INFO L158 Benchmark]: Boogie Preprocessor took 47.33ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:13:53,757 INFO L158 Benchmark]: RCFGBuilder took 279.63ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 82.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,757 INFO L158 Benchmark]: TraceAbstraction took 20061.85ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 82.3MB in the beginning and 187.4MB in the end (delta: -105.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,757 INFO L158 Benchmark]: Witness Printer took 60.74ms. Allocated memory is still 268.4MB. Free memory was 187.4MB in the beginning and 181.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:13:53,758 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.81ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 102.6MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.33ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.63ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 82.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20061.85ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 82.3MB in the beginning and 187.4MB in the end (delta: -105.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 60.74ms. Allocated memory is still 268.4MB. Free memory was 187.4MB in the beginning and 181.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 45 edges, 13 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 32, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 4135 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3207 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3114 IncrementalHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 928 mSDtfsCounter, 3114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 844 SyntacticMatches, 19 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=31, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 300 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 1645 ConstructedInterpolants, 132 QuantifiedInterpolants, 21954 SizeOfPredicates, 96 NumberOfNonLiveVariables, 3579 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 67 InterpolantComputations, 19 PerfectInterpolantSequences, 612/1105 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:13:53,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE