./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/cstrcat-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/cstrcat-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 473a450f6b8f25fccc3f510c246aedc5c3bd33b1d52b4c301eac7d6b61e44306 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:13:10,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:13:10,693 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:10,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:13:10,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:13:10,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:13:10,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:13:10,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:13:10,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:13:10,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:13:10,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:13:10,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:13:10,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:13:10,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:13:10,717 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:13:10,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:13:10,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:13:10,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:10,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:10,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:10,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:13:10,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:13:10,720 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 -> 473a450f6b8f25fccc3f510c246aedc5c3bd33b1d52b4c301eac7d6b61e44306 [2025-04-29 11:13:10,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:13:10,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:13:10,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:13:10,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:13:10,949 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:13:10,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca-2.c [2025-04-29 11:13:12,284 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c087c606a/6210eb7a93894ff7810535ad06db8f33/FLAG7e20dbb5d [2025-04-29 11:13:12,497 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:13:12,503 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrcat-alloca-2.c [2025-04-29 11:13:12,504 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:12,512 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c087c606a/6210eb7a93894ff7810535ad06db8f33/FLAG7e20dbb5d [2025-04-29 11:13:13,285 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c087c606a/6210eb7a93894ff7810535ad06db8f33 [2025-04-29 11:13:13,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:13:13,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:13:13,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:13,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:13:13,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:13:13,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:13" (1/1) ... [2025-04-29 11:13:13,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1c32ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:13, skipping insertion in model container [2025-04-29 11:13:13,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:13" (1/1) ... [2025-04-29 11:13:13,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:13:13,430 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:13,431 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:13,435 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:13,443 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:13:13,468 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:13,478 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:13:13,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:13 WrapperNode [2025-04-29 11:13:13,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:13,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:13,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:13:13,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:13:13,483 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:13" (1/1) ... [2025-04-29 11:13:13,489 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:13" (1/1) ... [2025-04-29 11:13:13,502 INFO L138 Inliner]: procedures = 10, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-04-29 11:13:13,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:13,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:13:13,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:13:13,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:13:13,509 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:13" (1/1) ... [2025-04-29 11:13:13,509 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:13" (1/1) ... [2025-04-29 11:13:13,511 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:13" (1/1) ... [2025-04-29 11:13:13,525 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2025-04-29 11:13:13,525 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:13" (1/1) ... [2025-04-29 11:13:13,526 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:13" (1/1) ... [2025-04-29 11:13:13,529 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:13" (1/1) ... [2025-04-29 11:13:13,533 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:13" (1/1) ... [2025-04-29 11:13:13,535 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:13" (1/1) ... [2025-04-29 11:13:13,536 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:13" (1/1) ... [2025-04-29 11:13:13,537 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:13" (1/1) ... [2025-04-29 11:13:13,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:13:13,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:13:13,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:13:13,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:13:13,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:13" (1/1) ... [2025-04-29 11:13:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:13,565 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:13,567 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:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:13:13,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:13:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:13:13,637 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:13:13,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:13:13,832 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-04-29 11:13:13,832 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:13:13,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:13:13,838 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:13:13,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:13 BoogieIcfgContainer [2025-04-29 11:13:13,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:13:13,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:13:13,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:13:13,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:13:13,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:13:13" (1/3) ... [2025-04-29 11:13:13,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2399de9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:13, skipping insertion in model container [2025-04-29 11:13:13,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:13" (2/3) ... [2025-04-29 11:13:13,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2399de9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:13, skipping insertion in model container [2025-04-29 11:13:13,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:13" (3/3) ... [2025-04-29 11:13:13,845 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca-2.c [2025-04-29 11:13:13,854 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:13:13,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcat-alloca-2.c that has 1 procedures, 42 locations, 51 edges, 1 initial locations, 4 loop locations, and 15 error locations. [2025-04-29 11:13:13,884 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:13:13,895 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;@56de9daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:13:13,896 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:13:13,899 INFO L278 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 41 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:13,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:13,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:13,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:13,903 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:13,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031084, now seen corresponding path program 1 times [2025-04-29 11:13:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:13,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742795343] [2025-04-29 11:13:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:13,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:13,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:13,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,092 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:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742795343] [2025-04-29 11:13:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742795343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352087535] [2025-04-29 11:13:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:14,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:14,121 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 41 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) Second operand has 5 states, 5 states have (on average 1.4) 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:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:14,233 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2025-04-29 11:13:14,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:14,237 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) 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:14,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:14,241 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:13:14,241 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:13:14,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:14,246 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:14,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 146 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:13:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2025-04-29 11:13:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2025-04-29 11:13:14,269 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 7 [2025-04-29 11:13:14,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:14,269 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2025-04-29 11:13:14,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) 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:14,269 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2025-04-29 11:13:14,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:14,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:14,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:14,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:13:14,270 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:14,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033006, now seen corresponding path program 1 times [2025-04-29 11:13:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:14,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700224467] [2025-04-29 11:13:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,303 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:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700224467] [2025-04-29 11:13:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700224467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912817982] [2025-04-29 11:13:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:14,307 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. 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:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:14,346 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-04-29 11:13:14,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:14,347 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:14,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:14,347 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:13:14,347 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:13:14,347 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:14,348 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 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:14,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 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:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:13:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-04-29 11:13:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.84) internal successors, (46), 39 states have internal predecessors, (46), 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:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-04-29 11:13:14,351 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 7 [2025-04-29 11:13:14,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:14,351 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-04-29 11:13:14,351 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:14,351 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-04-29 11:13:14,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:14,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:14,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:14,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:13:14,352 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:14,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 121388788, now seen corresponding path program 1 times [2025-04-29 11:13:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:14,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560642887] [2025-04-29 11:13:14,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:14,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:14,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:14,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:14,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,440 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:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560642887] [2025-04-29 11:13:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560642887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063570625] [2025-04-29 11:13:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:14,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:14,443 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:14,476 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-04-29 11:13:14,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:14,477 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:14,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:14,477 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:13:14,477 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:13:14,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:14,478 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:14,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 115 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:13:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-04-29 11:13:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.793103448275862) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-04-29 11:13:14,481 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 8 [2025-04-29 11:13:14,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:14,481 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-04-29 11:13:14,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:14,481 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-04-29 11:13:14,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:14,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:14,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:14,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:13:14,483 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:14,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 178647090, now seen corresponding path program 1 times [2025-04-29 11:13:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:14,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116638667] [2025-04-29 11:13:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:14,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:14,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:14,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,572 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:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116638667] [2025-04-29 11:13:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116638667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938366390] [2025-04-29 11:13:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:14,573 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:14,625 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-04-29 11:13:14,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:14,626 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:14,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:14,626 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:13:14,626 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:13:14,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:14,627 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:14,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:13:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2025-04-29 11:13:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.793103448275862) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-04-29 11:13:14,636 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 8 [2025-04-29 11:13:14,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:14,637 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-04-29 11:13:14,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:14,637 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-04-29 11:13:14,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:14,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:14,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:13:14,638 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:14,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 180494132, now seen corresponding path program 1 times [2025-04-29 11:13:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:14,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646648714] [2025-04-29 11:13:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:14,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,842 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:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646648714] [2025-04-29 11:13:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646648714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250577381] [2025-04-29 11:13:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:14,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:14,845 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:14,925 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-04-29 11:13:14,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:14,926 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:14,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:14,927 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:13:14,927 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:13:14,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:14,928 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:14,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 102 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:13:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-29 11:13:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-04-29 11:13:14,931 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 8 [2025-04-29 11:13:14,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:14,931 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-04-29 11:13:14,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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:14,931 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-04-29 11:13:14,931 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:13:14,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:14,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:14,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:13:14,932 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:14,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 180494131, now seen corresponding path program 1 times [2025-04-29 11:13:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:14,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088088415] [2025-04-29 11:13:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:14,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:13:14,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:13:14,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:14,980 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:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:14,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088088415] [2025-04-29 11:13:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088088415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137075446] [2025-04-29 11:13:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:14,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:14,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:14,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:14,982 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:15,010 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-04-29 11:13:15,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:15,011 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-04-29 11:13:15,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:15,011 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:13:15,011 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:13:15,011 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:15,012 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:15,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 51 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:13:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:13:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 43 states have internal predecessors, (53), 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:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-29 11:13:15,015 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 8 [2025-04-29 11:13:15,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:15,015 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-29 11:13:15,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:15,016 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-29 11:13:15,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:13:15,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:15,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:15,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:13:15,016 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:15,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash -531908844, now seen corresponding path program 1 times [2025-04-29 11:13:15,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:15,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126209941] [2025-04-29 11:13:15,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:15,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:13:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:13:15,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:15,059 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:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:15,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126209941] [2025-04-29 11:13:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126209941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:15,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:15,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:13:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689826973] [2025-04-29 11:13:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:15,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:13:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:13:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:13:15,060 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:15,085 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2025-04-29 11:13:15,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:13:15,085 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:13:15,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:15,086 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:13:15,086 INFO L226 Difference]: Without dead ends: 42 [2025-04-29 11:13:15,086 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:15,086 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:15,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-29 11:13:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-29 11:13:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 41 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:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-04-29 11:13:15,088 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 9 [2025-04-29 11:13:15,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:15,088 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-04-29 11:13:15,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,090 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-04-29 11:13:15,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:13:15,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:15,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:15,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:13:15,091 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:15,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -531908843, now seen corresponding path program 1 times [2025-04-29 11:13:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:15,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184086657] [2025-04-29 11:13:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:15,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:13:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:13:15,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:15,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:15,251 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:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:15,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184086657] [2025-04-29 11:13:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184086657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594994290] [2025-04-29 11:13:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:15,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:15,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:15,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:15,252 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:15,300 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-04-29 11:13:15,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:15,301 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:13:15,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:15,301 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:13:15,301 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:13:15,301 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:15,302 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:15,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:13:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-04-29 11:13:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 46 states have internal predecessors, (57), 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:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-04-29 11:13:15,304 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 9 [2025-04-29 11:13:15,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:15,304 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-04-29 11:13:15,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,304 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-04-29 11:13:15,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:13:15,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:15,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:15,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:13:15,304 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:15,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash -474650541, now seen corresponding path program 1 times [2025-04-29 11:13:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:15,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564133378] [2025-04-29 11:13:15,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:15,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:13:15,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:13:15,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:15,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:15,436 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:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:15,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564133378] [2025-04-29 11:13:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564133378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:13:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254680423] [2025-04-29 11:13:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:15,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:13:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:13:15,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:15,439 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:15,505 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-04-29 11:13:15,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:15,506 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:13:15,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:15,506 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:13:15,506 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:13:15,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:15,507 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:15,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:13:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-04-29 11:13:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.606060606060606) internal successors, (53), 43 states have internal predecessors, (53), 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:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-29 11:13:15,512 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 9 [2025-04-29 11:13:15,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:15,512 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-29 11:13:15,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:15,512 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-29 11:13:15,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:13:15,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:15,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:15,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:13:15,514 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:15,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -198395118, now seen corresponding path program 1 times [2025-04-29 11:13:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:15,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889091477] [2025-04-29 11:13:15,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:15,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:15,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:15,783 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:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:15,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889091477] [2025-04-29 11:13:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889091477] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:15,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026998225] [2025-04-29 11:13:15,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:15,786 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:15,789 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:15,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:13:15,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:13:15,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:15,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:15,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:13:15,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:15,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:13:15,911 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 7 [2025-04-29 11:13:15,920 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:16,088 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:16,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:16,218 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:13:16,272 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:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026998225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:16,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-29 11:13:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977622460] [2025-04-29 11:13:16,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:16,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:16,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:16,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:16,273 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:16,516 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-04-29 11:13:16,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:16,516 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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:16,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:16,517 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:13:16,517 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:13:16,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:13:16,518 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:16,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 214 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:13:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-04-29 11:13:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.5806451612903225) 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:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-04-29 11:13:16,520 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2025-04-29 11:13:16,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:16,520 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-04-29 11:13:16,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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:16,520 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-04-29 11:13:16,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:16,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:16,521 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:16,527 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:16,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:13:16,725 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:16,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1962003877, now seen corresponding path program 1 times [2025-04-29 11:13:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:16,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195492129] [2025-04-29 11:13:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:16,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:16,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:16,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:16,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:16,760 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:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:16,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195492129] [2025-04-29 11:13:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195492129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:16,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853255858] [2025-04-29 11:13:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:16,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:16,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:16,763 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:16,764 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:16,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:16,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:16,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:13:16,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:16,830 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:16,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:16,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853255858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:16,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:13:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082541308] [2025-04-29 11:13:16,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:16,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:16,831 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:16,847 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-04-29 11:13:16,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:16,848 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-04-29 11:13:16,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:16,848 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:13:16,848 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:13:16,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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:16,849 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:16,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:13:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:13:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.5) internal successors, (57), 47 states have internal predecessors, (57), 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:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-29 11:13:16,851 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 12 [2025-04-29 11:13:16,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:16,851 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-29 11:13:16,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:16,851 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-29 11:13:16,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:16,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:16,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:16,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:17,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:13:17,056 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:17,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1962003685, now seen corresponding path program 1 times [2025-04-29 11:13:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:17,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535390133] [2025-04-29 11:13:17,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:17,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:17,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:17,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:17,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:17,138 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:17,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:17,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535390133] [2025-04-29 11:13:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535390133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502718063] [2025-04-29 11:13:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:17,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:17,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:17,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:17,139 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:17,168 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-04-29 11:13:17,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:17,169 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-04-29 11:13:17,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:17,169 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:13:17,169 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:13:17,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:17,170 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:17,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:13:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-04-29 11:13:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 60 states have internal predecessors, (73), 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:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-04-29 11:13:17,172 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 12 [2025-04-29 11:13:17,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:17,172 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-04-29 11:13:17,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:17,172 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-04-29 11:13:17,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:17,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:17,175 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:17,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:13:17,175 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:17,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1281945507, now seen corresponding path program 1 times [2025-04-29 11:13:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:17,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645292041] [2025-04-29 11:13:17,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:17,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:17,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:17,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:17,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:17,343 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:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:17,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645292041] [2025-04-29 11:13:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645292041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:17,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795284742] [2025-04-29 11:13:17,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:17,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:17,346 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:17,347 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:17,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:17,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:17,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:17,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:17,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:13:17,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:17,421 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 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:13:17,430 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 13 treesize of output 1 [2025-04-29 11:13:17,592 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:17,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:17,771 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:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795284742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:17,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-29 11:13:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300388732] [2025-04-29 11:13:17,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:17,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:13:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:13:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:13:17,773 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:17,924 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2025-04-29 11:13:17,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:17,925 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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 12 [2025-04-29 11:13:17,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:17,925 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:13:17,925 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:13:17,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:13:17,926 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:17,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 119 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:13:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-04-29 11:13:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 57 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:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-04-29 11:13:17,931 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2025-04-29 11:13:17,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:17,931 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-04-29 11:13:17,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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:17,931 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-04-29 11:13:17,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:17,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:17,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:17,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:18,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:18,137 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:18,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1939936601, now seen corresponding path program 1 times [2025-04-29 11:13:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:18,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576792169] [2025-04-29 11:13:18,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:18,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:18,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:18,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:18,246 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:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:18,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576792169] [2025-04-29 11:13:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576792169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:18,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135876311] [2025-04-29 11:13:18,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:18,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:18,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:18,248 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:18,271 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-04-29 11:13:18,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:18,274 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-04-29 11:13:18,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:18,274 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:13:18,274 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:13:18,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:18,275 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 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:18,275 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 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:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:13:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-04-29 11:13:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 44 states have internal predecessors, (54), 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:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-04-29 11:13:18,283 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 12 [2025-04-29 11:13:18,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:18,283 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-04-29 11:13:18,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:18,283 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-04-29 11:13:18,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:13:18,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:18,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:18,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:13:18,284 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:18,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -692572102, now seen corresponding path program 1 times [2025-04-29 11:13:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:18,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481751958] [2025-04-29 11:13:18,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:18,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:18,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:18,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481751958] [2025-04-29 11:13:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481751958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:18,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035527131] [2025-04-29 11:13:18,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:18,372 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:18,374 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:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:18,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:18,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:18,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:18,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:13:18,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:18,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:18,491 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:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035527131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:18,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-29 11:13:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257568213] [2025-04-29 11:13:18,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:18,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:13:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:18,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:13:18,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:13:18,546 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:18,634 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-04-29 11:13:18,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:18,634 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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 13 [2025-04-29 11:13:18,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:18,635 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:13:18,635 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:13:18,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:18,635 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:18,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 264 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:13:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-04-29 11:13:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 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:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-04-29 11:13:18,639 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 13 [2025-04-29 11:13:18,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:18,639 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-04-29 11:13:18,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:18,641 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-04-29 11:13:18,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:13:18,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:18,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:18,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:18,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:13:18,842 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:18,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -12513732, now seen corresponding path program 1 times [2025-04-29 11:13:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:18,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037965706] [2025-04-29 11:13:18,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:18,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:18,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:18,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:18,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:18,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037965706] [2025-04-29 11:13:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037965706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:18,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069117840] [2025-04-29 11:13:18,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:18,941 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:18,943 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:18,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:18,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:18,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:18,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:18,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:13:18,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:19,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:19,076 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:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069117840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:19,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-29 11:13:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050339151] [2025-04-29 11:13:19,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:19,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:13:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:19,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:13:19,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:13:19,135 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 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:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:19,321 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-04-29 11:13:19,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:13:19,322 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 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 13 [2025-04-29 11:13:19,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:19,322 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:13:19,322 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:13:19,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:13:19,323 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:19,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 217 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:13:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-04-29 11:13:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.3877551020408163) 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:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-04-29 11:13:19,325 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 13 [2025-04-29 11:13:19,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:19,325 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-04-29 11:13:19,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 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:19,325 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-04-29 11:13:19,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:13:19,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:19,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:19,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:13:19,530 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,SelfDestructingSolverStorable15 [2025-04-29 11:13:19,530 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:19,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash -405540742, now seen corresponding path program 1 times [2025-04-29 11:13:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:19,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284040938] [2025-04-29 11:13:19,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:19,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:19,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:19,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:19,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284040938] [2025-04-29 11:13:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284040938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:19,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717399795] [2025-04-29 11:13:19,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:19,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:19,608 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:19,610 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:19,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:19,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:19,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:19,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:13:19,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:19,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717399795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:19,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-29 11:13:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033691629] [2025-04-29 11:13:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:19,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:13:19,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:19,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:13:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:19,720 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:19,793 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-04-29 11:13:19,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:19,794 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:13:19,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:19,794 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:13:19,794 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:13:19,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:19,795 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:19,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:13:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2025-04-29 11:13:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 43 states have internal predecessors, (53), 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:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-29 11:13:19,796 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 13 [2025-04-29 11:13:19,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:19,796 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-29 11:13:19,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:19,797 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-29 11:13:19,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:13:19,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:19,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:19,805 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:19,997 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,SelfDestructingSolverStorable16 [2025-04-29 11:13:19,997 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:19,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash 158140605, now seen corresponding path program 1 times [2025-04-29 11:13:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:19,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120508000] [2025-04-29 11:13:19,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:20,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:20,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:20,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120508000] [2025-04-29 11:13:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120508000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274745132] [2025-04-29 11:13:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:20,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:20,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:20,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:20,025 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:20,049 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-04-29 11:13:20,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:20,049 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:13:20,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:20,049 INFO L225 Difference]: With dead ends: 43 [2025-04-29 11:13:20,050 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:13:20,050 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:20,050 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:20,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:13:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 11:13:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2025-04-29 11:13:20,051 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2025-04-29 11:13:20,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:20,051 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2025-04-29 11:13:20,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:20,051 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2025-04-29 11:13:20,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:13:20,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:20,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:20,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:13:20,052 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:20,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 158140606, now seen corresponding path program 1 times [2025-04-29 11:13:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:20,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472675224] [2025-04-29 11:13:20,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:20,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:20,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:20,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:20,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472675224] [2025-04-29 11:13:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472675224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:20,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146487198] [2025-04-29 11:13:20,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:20,150 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:20,152 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:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:20,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:20,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:13:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:20,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:20,257 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 20 treesize of output 16 [2025-04-29 11:13:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146487198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:20,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-29 11:13:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861294275] [2025-04-29 11:13:20,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:20,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:13:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:20,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:13:20,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:20,268 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:20,313 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-04-29 11:13:20,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:20,314 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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 15 [2025-04-29 11:13:20,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:20,314 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:13:20,314 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:13:20,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:20,314 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:20,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 111 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:13:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-04-29 11:13:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.394736842105263) internal successors, (53), 43 states have internal predecessors, (53), 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:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-29 11:13:20,316 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 15 [2025-04-29 11:13:20,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:20,316 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-29 11:13:20,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 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:20,316 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-29 11:13:20,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:20,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:20,316 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:20,322 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:20,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:20,517 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:20,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash -412329254, now seen corresponding path program 1 times [2025-04-29 11:13:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:20,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030700956] [2025-04-29 11:13:20,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:20,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:20,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:20,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:20,650 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:20,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:20,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030700956] [2025-04-29 11:13:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030700956] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:20,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458480767] [2025-04-29 11:13:20,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:20,652 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:20,654 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:20,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:20,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:20,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:20,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:13:20,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:20,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:13:20,736 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:20,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458480767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-04-29 11:13:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307197664] [2025-04-29 11:13:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:20,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:13:20,737 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:20,766 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-04-29 11:13:20,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:20,766 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:20,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:20,767 INFO L225 Difference]: With dead ends: 66 [2025-04-29 11:13:20,767 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:13:20,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:20,767 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:20,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:13:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-04-29 11:13:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 64 states have internal predecessors, (76), 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:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-04-29 11:13:20,769 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 18 [2025-04-29 11:13:20,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:20,769 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-04-29 11:13:20,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:20,769 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-04-29 11:13:20,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:20,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:20,769 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:20,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:13:20,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:20,970 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:20,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -412327131, now seen corresponding path program 1 times [2025-04-29 11:13:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:20,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692718735] [2025-04-29 11:13:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,006 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:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692718735] [2025-04-29 11:13:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692718735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944658439] [2025-04-29 11:13:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:21,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:21,007 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 5 states, 4 states have (on average 4.5) 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:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,037 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-04-29 11:13:21,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:21,037 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) 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:21,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,038 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:13:21,038 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:13:21,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:21,038 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:13:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-29 11:13:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 63 states have internal predecessors, (75), 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:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-04-29 11:13:21,040 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 18 [2025-04-29 11:13:21,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,041 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-04-29 11:13:21,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) 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:21,041 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-04-29 11:13:21,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:21,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,041 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:21,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:13:21,041 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:21,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash -412327130, now seen corresponding path program 1 times [2025-04-29 11:13:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854700462] [2025-04-29 11:13:21,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:21,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,123 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:21,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854700462] [2025-04-29 11:13:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854700462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:13:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653023533] [2025-04-29 11:13:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:13:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:13:21,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:21,124 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,169 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2025-04-29 11:13:21,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:21,169 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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:21,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,169 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:13:21,169 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:13:21,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:21,171 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 118 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:13:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2025-04-29 11:13:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 65 states have internal predecessors, (77), 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:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-04-29 11:13:21,172 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 18 [2025-04-29 11:13:21,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,172 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-04-29 11:13:21,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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:21,172 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-04-29 11:13:21,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:21,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,173 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:21,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:13:21,173 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:21,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1423446504, now seen corresponding path program 1 times [2025-04-29 11:13:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892783407] [2025-04-29 11:13:21,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:21,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:21,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,332 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:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892783407] [2025-04-29 11:13:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892783407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:21,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394146028] [2025-04-29 11:13:21,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:21,338 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:21,339 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:21,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:21,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:21,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:13:21,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:21,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:13:21,474 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:21,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394146028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-04-29 11:13:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738672741] [2025-04-29 11:13:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:21,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:13:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:21,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:13:21,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:13:21,475 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:21,548 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-04-29 11:13:21,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:21,548 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:21,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:21,549 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:13:21,549 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:13:21,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:13:21,549 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:21,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 139 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:13:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2025-04-29 11:13:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.290909090909091) internal successors, (71), 59 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:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-04-29 11:13:21,551 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 18 [2025-04-29 11:13:21,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:21,551 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-04-29 11:13:21,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:21,551 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-04-29 11:13:21,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:13:21,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:21,551 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:21,558 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:21,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:21,752 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:21,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1591657114, now seen corresponding path program 1 times [2025-04-29 11:13:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:21,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491020614] [2025-04-29 11:13:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:21,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:21,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,912 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:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:21,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491020614] [2025-04-29 11:13:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491020614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:21,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293623805] [2025-04-29 11:13:21,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:21,915 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:21,916 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:21,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:13:21,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:13:21,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:21,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:21,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:13:21,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:22,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:13:22,078 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:22,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:22,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:13:22,085 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 14 treesize of output 12 [2025-04-29 11:13:22,165 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:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293623805] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:22,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 22 [2025-04-29 11:13:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205772652] [2025-04-29 11:13:22,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:13:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:13:22,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:13:22,166 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,611 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2025-04-29 11:13:22,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:13:22,611 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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) Word has length 18 [2025-04-29 11:13:22,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,611 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:13:22,611 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:13:22,612 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:13:22,612 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 224 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 218 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:13:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2025-04-29 11:13:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 65 states have internal predecessors, (79), 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:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-04-29 11:13:22,614 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 18 [2025-04-29 11:13:22,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,614 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-04-29 11:13:22,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:22,614 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-04-29 11:13:22,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:13:22,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:13:22,819 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,SelfDestructingSolverStorable23 [2025-04-29 11:13:22,819 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:22,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash 102760872, now seen corresponding path program 1 times [2025-04-29 11:13:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215685419] [2025-04-29 11:13:22,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:13:22,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:22,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:22,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215685419] [2025-04-29 11:13:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215685419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426412802] [2025-04-29 11:13:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:22,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:22,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:22,858 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:22,889 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2025-04-29 11:13:22,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:22,890 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:13:22,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:22,890 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:13:22,890 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:13:22,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:22,891 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:22,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:13:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-04-29 11:13:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.278688524590164) internal successors, (78), 64 states have internal predecessors, (78), 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:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-04-29 11:13:22,892 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 19 [2025-04-29 11:13:22,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:22,892 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-04-29 11:13:22,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:22,892 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-04-29 11:13:22,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:13:22,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:22,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:22,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:13:22,893 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:22,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 102760873, now seen corresponding path program 1 times [2025-04-29 11:13:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:22,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103321281] [2025-04-29 11:13:22,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:22,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:13:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103321281] [2025-04-29 11:13:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103321281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:23,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896603849] [2025-04-29 11:13:23,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:23,005 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:23,012 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:23,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:13:23,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:23,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:13:23,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:23,158 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 7 treesize of output 5 [2025-04-29 11:13:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896603849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:23,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-29 11:13:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175846944] [2025-04-29 11:13:23,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:13:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:13:23,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:13:23,169 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 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:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,229 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-04-29 11:13:23,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:23,230 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 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 19 [2025-04-29 11:13:23,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,230 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:13:23,230 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:13:23,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:23,231 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:13:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2025-04-29 11:13:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 65 states have internal predecessors, (79), 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:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-04-29 11:13:23,234 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 19 [2025-04-29 11:13:23,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,234 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-04-29 11:13:23,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 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:23,234 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-04-29 11:13:23,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:23,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:23,440 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,SelfDestructingSolverStorable25 [2025-04-29 11:13:23,440 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:23,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -962494932, now seen corresponding path program 1 times [2025-04-29 11:13:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015067978] [2025-04-29 11:13:23,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:23,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:23,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,530 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:23,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015067978] [2025-04-29 11:13:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015067978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:13:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174461592] [2025-04-29 11:13:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:13:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:13:23,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:23,531 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 8 states, 8 states have (on average 2.75) 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:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,558 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-04-29 11:13:23,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:23,558 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) 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:23,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,559 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:13:23,559 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:13:23,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:13:23,559 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:13:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-04-29 11:13:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 102 states have internal predecessors, (123), 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:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-04-29 11:13:23,561 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2025-04-29 11:13:23,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,561 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-04-29 11:13:23,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) 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:23,561 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-04-29 11:13:23,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:23,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,561 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:13:23,562 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:23,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1780143382, now seen corresponding path program 1 times [2025-04-29 11:13:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616337424] [2025-04-29 11:13:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:23,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:23,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,698 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:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616337424] [2025-04-29 11:13:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616337424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:13:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220736305] [2025-04-29 11:13:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:13:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:13:23,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:13:23,700 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,762 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2025-04-29 11:13:23,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:23,762 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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:23,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,763 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:13:23,763 INFO L226 Difference]: Without dead ends: 121 [2025-04-29 11:13:23,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:13:23,764 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 142 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-29 11:13:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2025-04-29 11:13:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.25) internal successors, (115), 95 states have internal predecessors, (115), 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:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2025-04-29 11:13:23,769 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 22 [2025-04-29 11:13:23,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,769 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2025-04-29 11:13:23,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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:23,770 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2025-04-29 11:13:23,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:13:23,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,770 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:23,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:13:23,770 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:23,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 825880172, now seen corresponding path program 1 times [2025-04-29 11:13:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208346915] [2025-04-29 11:13:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:13:23,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:13:23,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,878 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:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208346915] [2025-04-29 11:13:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208346915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:13:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902415487] [2025-04-29 11:13:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:13:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:13:23,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:23,879 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:23,925 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2025-04-29 11:13:23,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:13:23,925 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:23,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:23,926 INFO L225 Difference]: With dead ends: 133 [2025-04-29 11:13:23,926 INFO L226 Difference]: Without dead ends: 133 [2025-04-29 11:13:23,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:13:23,926 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:23,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-29 11:13:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2025-04-29 11:13:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 97 states have internal predecessors, (119), 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:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2025-04-29 11:13:23,929 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 22 [2025-04-29 11:13:23,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:23,929 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2025-04-29 11:13:23,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:23,929 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2025-04-29 11:13:23,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:13:23,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:23,929 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] [2025-04-29 11:13:23,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:13:23,930 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:23,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 227503694, now seen corresponding path program 1 times [2025-04-29 11:13:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:23,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31186916] [2025-04-29 11:13:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:23,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:13:23,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:13:23,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:23,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:23,992 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:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:23,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31186916] [2025-04-29 11:13:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31186916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:23,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:23,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175989971] [2025-04-29 11:13:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:23,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:23,993 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:24,008 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2025-04-29 11:13:24,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:24,008 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-04-29 11:13:24,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:24,008 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:13:24,008 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:13:24,009 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:24,009 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:24,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:13:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:13:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 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:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-04-29 11:13:24,011 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 23 [2025-04-29 11:13:24,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:24,011 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-04-29 11:13:24,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:24,011 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-04-29 11:13:24,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:13:24,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:24,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:24,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:13:24,012 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:24,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:24,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1500783292, now seen corresponding path program 2 times [2025-04-29 11:13:24,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:24,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261083189] [2025-04-29 11:13:24,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:24,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:13:24,023 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:24,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:24,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:24,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261083189] [2025-04-29 11:13:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261083189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:24,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412081326] [2025-04-29 11:13:24,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:24,285 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:24,286 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:24,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:13:24,343 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:24,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:24,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:13:24,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:24,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:24,687 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-29 11:13:24,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2025-04-29 11:13:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:24,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:13:24,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:24,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-04-29 11:13:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412081326] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:24,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 37 [2025-04-29 11:13:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705502347] [2025-04-29 11:13:24,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:24,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 11:13:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:24,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 11:13:24,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 11:13:24,999 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:26,007 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2025-04-29 11:13:26,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-29 11:13:26,008 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:26,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:26,008 INFO L225 Difference]: With dead ends: 139 [2025-04-29 11:13:26,008 INFO L226 Difference]: Without dead ends: 131 [2025-04-29 11:13:26,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=551, Invalid=3481, Unknown=0, NotChecked=0, Total=4032 [2025-04-29 11:13:26,010 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 162 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:26,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 250 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:13:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-29 11:13:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2025-04-29 11:13:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 87 states have (on average 1.206896551724138) internal successors, (105), 89 states have internal predecessors, (105), 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:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2025-04-29 11:13:26,013 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 24 [2025-04-29 11:13:26,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:26,014 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2025-04-29 11:13:26,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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:26,014 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2025-04-29 11:13:26,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:13:26,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:26,014 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:26,021 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:26,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,216 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:26,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash 515861962, now seen corresponding path program 1 times [2025-04-29 11:13:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:26,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235020310] [2025-04-29 11:13:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:26,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:13:26,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:13:26,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:26,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:26,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235020310] [2025-04-29 11:13:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235020310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:26,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041018890] [2025-04-29 11:13:26,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:26,279 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:26,281 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:26,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:13:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:13:26,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:26,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:13:26,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:26,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041018890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:26,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:26,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-04-29 11:13:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521296253] [2025-04-29 11:13:26,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:26,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:13:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:26,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:13:26,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:13:26,436 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:26,541 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-04-29 11:13:26,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:26,542 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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 25 [2025-04-29 11:13:26,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:26,542 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:13:26,542 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:13:26,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:26,543 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:26,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 122 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:13:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-04-29 11:13:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 92 states have internal predecessors, (107), 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:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2025-04-29 11:13:26,549 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 25 [2025-04-29 11:13:26,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:26,549 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-04-29 11:13:26,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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:26,550 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2025-04-29 11:13:26,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:13:26,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:26,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:26,558 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:26,750 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,SelfDestructingSolverStorable31 [2025-04-29 11:13:26,750 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:26,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1118599096, now seen corresponding path program 2 times [2025-04-29 11:13:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:26,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563474788] [2025-04-29 11:13:26,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:26,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:13:26,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:13:26,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:26,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563474788] [2025-04-29 11:13:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563474788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:26,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990938491] [2025-04-29 11:13:26,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:26,911 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:26,913 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:26,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:13:26,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:13:26,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:26,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:26,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:13:26,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:27,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:27,142 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 21 treesize of output 17 [2025-04-29 11:13:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:27,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990938491] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:27,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-29 11:13:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386913405] [2025-04-29 11:13:27,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:27,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:27,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:27,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:27,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:27,203 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 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:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:27,307 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-04-29 11:13:27,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:27,308 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 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) Word has length 28 [2025-04-29 11:13:27,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:27,308 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:13:27,308 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:13:27,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:13:27,309 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:27,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 201 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:13:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2025-04-29 11:13:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 95 states have internal predecessors, (110), 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:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-04-29 11:13:27,310 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 28 [2025-04-29 11:13:27,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:27,310 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-04-29 11:13:27,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 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:27,311 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2025-04-29 11:13:27,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:13:27,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:27,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:27,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:27,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:27,514 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:27,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -316833593, now seen corresponding path program 1 times [2025-04-29 11:13:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:27,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415948273] [2025-04-29 11:13:27,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:27,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:13:27,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:13:27,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:27,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:27,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415948273] [2025-04-29 11:13:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415948273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:27,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875545697] [2025-04-29 11:13:27,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:27,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:27,721 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:27,722 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:27,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:13:27,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:13:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:27,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:13:27,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:27,876 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:27,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:27,993 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 7 treesize of output 5 [2025-04-29 11:13:28,012 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:28,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875545697] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:28,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:28,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2025-04-29 11:13:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123968335] [2025-04-29 11:13:28,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:28,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:13:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:28,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:13:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:13:28,014 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:28,372 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-04-29 11:13:28,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:13:28,372 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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 29 [2025-04-29 11:13:28,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:28,372 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:13:28,372 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:13:28,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:13:28,373 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:28,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 242 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:13:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2025-04-29 11:13:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 104 states have internal predecessors, (119), 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:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-04-29 11:13:28,375 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 29 [2025-04-29 11:13:28,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:28,375 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-04-29 11:13:28,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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:28,375 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-04-29 11:13:28,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:13:28,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:28,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:28,385 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:28,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:28,581 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:28,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1877532122, now seen corresponding path program 3 times [2025-04-29 11:13:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:28,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114036993] [2025-04-29 11:13:28,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:28,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-29 11:13:28,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:13:28,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:28,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:28,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114036993] [2025-04-29 11:13:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114036993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:28,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504248968] [2025-04-29 11:13:28,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:28,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:28,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:28,878 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:28,879 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:28,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-29 11:13:28,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:13:28,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:28,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-29 11:13:28,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:28,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:29,592 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-29 11:13:29,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2025-04-29 11:13:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:13:29,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:30,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-04-29 11:13:30,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:30,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2025-04-29 11:13:30,084 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 15 treesize of output 11 [2025-04-29 11:13:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:30,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504248968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:30,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:30,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 33 [2025-04-29 11:13:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323531579] [2025-04-29 11:13:30,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:30,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:13:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:30,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:13:30,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:13:30,129 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 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:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:30,918 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2025-04-29 11:13:30,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:13:30,918 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 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 30 [2025-04-29 11:13:30,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:30,919 INFO L225 Difference]: With dead ends: 143 [2025-04-29 11:13:30,919 INFO L226 Difference]: Without dead ends: 114 [2025-04-29 11:13:30,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=2899, Unknown=0, NotChecked=0, Total=3422 [2025-04-29 11:13:30,920 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:30,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 161 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:13:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-29 11:13:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2025-04-29 11:13:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 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:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-04-29 11:13:30,922 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 30 [2025-04-29 11:13:30,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:30,922 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-04-29 11:13:30,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 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:30,922 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-04-29 11:13:30,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:13:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:30,922 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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:30,928 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:31,123 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,SelfDestructingSolverStorable34 [2025-04-29 11:13:31,123 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:31,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1548567118, now seen corresponding path program 3 times [2025-04-29 11:13:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:31,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762230597] [2025-04-29 11:13:31,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:31,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-29 11:13:31,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:13:31,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:13:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:31,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:31,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762230597] [2025-04-29 11:13:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762230597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:31,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240538641] [2025-04-29 11:13:31,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:31,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:31,363 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:31,364 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:31,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-29 11:13:31,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:13:31,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:13:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:31,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:13:31,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:31,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:31,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:31,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:31,520 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 16 treesize of output 12 [2025-04-29 11:13:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240538641] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:31,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:31,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2025-04-29 11:13:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003969650] [2025-04-29 11:13:31,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:31,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:13:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:31,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:13:31,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:31,553 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 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:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:31,632 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2025-04-29 11:13:31,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:13:31,633 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 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) Word has length 32 [2025-04-29 11:13:31,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:31,633 INFO L225 Difference]: With dead ends: 136 [2025-04-29 11:13:31,633 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:13:31,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:13:31,634 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:31,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:13:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-04-29 11:13:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 110 states have internal predecessors, (124), 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:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-04-29 11:13:31,635 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 32 [2025-04-29 11:13:31,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:31,636 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-04-29 11:13:31,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 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:31,636 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-04-29 11:13:31,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:13:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:31,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:31,643 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:31,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:31,837 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:31,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1566664793, now seen corresponding path program 1 times [2025-04-29 11:13:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:31,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272464415] [2025-04-29 11:13:31,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:13:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:13:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:13:32,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:32,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272464415] [2025-04-29 11:13:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272464415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:32,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975745239] [2025-04-29 11:13:32,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:32,127 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:32,128 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:32,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:13:32,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:13:32,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:32,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:13:32,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:32,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:13:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:32,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:32,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:13:32,382 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 14 treesize of output 12 [2025-04-29 11:13:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975745239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:32,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:32,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-04-29 11:13:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410231647] [2025-04-29 11:13:32,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:32,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:13:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:32,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:13:32,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:13:32,503 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 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:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:33,360 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-04-29 11:13:33,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 11:13:33,360 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 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) Word has length 32 [2025-04-29 11:13:33,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:33,361 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:13:33,361 INFO L226 Difference]: Without dead ends: 141 [2025-04-29 11:13:33,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=526, Invalid=2554, Unknown=0, NotChecked=0, Total=3080 [2025-04-29 11:13:33,362 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:33,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 177 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-29 11:13:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2025-04-29 11:13:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 110 states have internal predecessors, (124), 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,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-04-29 11:13:33,364 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 32 [2025-04-29 11:13:33,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:33,364 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-04-29 11:13:33,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 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:33,364 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-04-29 11:13:33,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:13:33,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:33,365 INFO L218 NwaCegarLoop]: trace histogram [3, 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:33,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:33,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:33,569 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:33,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 137995308, now seen corresponding path program 4 times [2025-04-29 11:13:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:33,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55302990] [2025-04-29 11:13:33,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:33,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:13:33,580 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 35 statements. [2025-04-29 11:13:33,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:33,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:13:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:33,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55302990] [2025-04-29 11:13:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55302990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:33,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871641235] [2025-04-29 11:13:33,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:33,818 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:33,820 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:33,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:13:33,890 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 35 statements. [2025-04-29 11:13:33,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:13:33,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:33,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:13:33,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:33,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:34,339 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:34,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 97 [2025-04-29 11:13:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:13:34,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:34,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:13:34,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-29 11:13:34,772 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 5 treesize of output 3 [2025-04-29 11:13:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:13:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871641235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:34,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-29 11:13:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147696373] [2025-04-29 11:13:34,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:34,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:13:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:34,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:13:34,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:13:34,807 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 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,032 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2025-04-29 11:13:35,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:13:35,034 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 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 35 [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: 110 [2025-04-29 11:13:35,034 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:13:35,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:13:35,035 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:35,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 193 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:13:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2025-04-29 11:13:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.134020618556701) internal successors, (110), 97 states have internal predecessors, (110), 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,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2025-04-29 11:13:35,036 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 35 [2025-04-29 11:13:35,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:35,036 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2025-04-29 11:13:35,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 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,037 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2025-04-29 11:13:35,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:13:35,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:35,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:35,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-29 11:13:35,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,241 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:35,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash 848952707, now seen corresponding path program 2 times [2025-04-29 11:13:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:35,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691826474] [2025-04-29 11:13:35,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:35,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:35,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:13:35,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:13:35,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:35,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:13:35,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:35,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691826474] [2025-04-29 11:13:35,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691826474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:35,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138124308] [2025-04-29 11:13:35,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:35,845 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:35,847 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:35,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:13:35,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:13:35,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:35,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:35,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-29 11:13:35,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:36,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:36,252 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-29 11:13:36,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2025-04-29 11:13:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:36,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:36,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:13:36,379 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:36,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-04-29 11:13:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:13:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138124308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:36,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 44 [2025-04-29 11:13:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779440933] [2025-04-29 11:13:36,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:36,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-29 11:13:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:36,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-29 11:13:36,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:13:36,608 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 44 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 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,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:38,362 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2025-04-29 11:13:38,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-29 11:13:38,363 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 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 38 [2025-04-29 11:13:38,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:38,363 INFO L225 Difference]: With dead ends: 174 [2025-04-29 11:13:38,364 INFO L226 Difference]: Without dead ends: 159 [2025-04-29 11:13:38,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=900, Invalid=5906, Unknown=0, NotChecked=0, Total=6806 [2025-04-29 11:13:38,365 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 96 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:38,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 266 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:13:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-29 11:13:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2025-04-29 11:13:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.1391304347826088) internal successors, (131), 115 states have internal predecessors, (131), 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,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2025-04-29 11:13:38,367 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 38 [2025-04-29 11:13:38,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:38,367 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2025-04-29 11:13:38,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 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,367 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2025-04-29 11:13:38,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:13:38,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:38,368 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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:38,374 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:38,568 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,SelfDestructingSolverStorable38 [2025-04-29 11:13:38,568 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:38,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1511963165, now seen corresponding path program 2 times [2025-04-29 11:13:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:38,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123765414] [2025-04-29 11:13:38,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:38,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:13:38,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:13:38,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:38,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:38,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123765414] [2025-04-29 11:13:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123765414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:38,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942455834] [2025-04-29 11:13:38,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:38,701 INFO L229 MonitoredProcess]: Starting monitored process 22 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,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:13:38,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:13:38,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:13:38,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:38,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:38,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:13:38,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:38,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942455834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:38,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-04-29 11:13:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967283205] [2025-04-29 11:13:38,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:38,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:13:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:13:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:13:38,919 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:39,062 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2025-04-29 11:13:39,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:13:39,062 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-29 11:13:39,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:39,063 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:13:39,063 INFO L226 Difference]: Without dead ends: 121 [2025-04-29 11:13:39,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:13:39,063 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:39,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 171 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-29 11:13:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-04-29 11:13:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 118 states have internal predecessors, (133), 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,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2025-04-29 11:13:39,065 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 40 [2025-04-29 11:13:39,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:39,065 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2025-04-29 11:13:39,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:39,067 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2025-04-29 11:13:39,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:13:39,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:39,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:39,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:39,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-29 11:13:39,270 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:39,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 112235159, now seen corresponding path program 3 times [2025-04-29 11:13:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:39,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448222344] [2025-04-29 11:13:39,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:39,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-04-29 11:13:39,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:13:39,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:39,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:39,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448222344] [2025-04-29 11:13:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448222344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:39,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778212236] [2025-04-29 11:13:39,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:39,648 INFO L229 MonitoredProcess]: Starting monitored process 23 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,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-29 11:13:39,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-04-29 11:13:39,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:13:39,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:39,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:39,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 11:13:39,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:39,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:39,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:13:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:39,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:39,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:13:39,972 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 16 treesize of output 12 [2025-04-29 11:13:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:13:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778212236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:40,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 31 [2025-04-29 11:13:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546577019] [2025-04-29 11:13:40,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:40,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:13:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:40,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:13:40,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:13:40,025 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 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,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:40,970 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2025-04-29 11:13:40,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-29 11:13:40,971 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 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 43 [2025-04-29 11:13:40,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:40,972 INFO L225 Difference]: With dead ends: 254 [2025-04-29 11:13:40,972 INFO L226 Difference]: Without dead ends: 207 [2025-04-29 11:13:40,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=387, Invalid=4305, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:13:40,974 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 135 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:40,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 360 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:13:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-04-29 11:13:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2025-04-29 11:13:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.119047619047619) internal successors, (188), 168 states have internal predecessors, (188), 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,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 188 transitions. [2025-04-29 11:13:40,978 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 188 transitions. Word has length 43 [2025-04-29 11:13:40,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:40,978 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 188 transitions. [2025-04-29 11:13:40,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 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,978 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 188 transitions. [2025-04-29 11:13:40,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:13:40,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:40,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:40,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:41,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:41,179 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:41,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash 522087577, now seen corresponding path program 3 times [2025-04-29 11:13:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:41,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146805903] [2025-04-29 11:13:41,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:41,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 5 equivalence classes. [2025-04-29 11:13:41,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 41 of 44 statements. [2025-04-29 11:13:41,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:41,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:13:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:41,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146805903] [2025-04-29 11:13:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146805903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:41,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119327402] [2025-04-29 11:13:41,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:41,807 INFO L229 MonitoredProcess]: Starting monitored process 24 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,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-29 11:13:41,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 5 equivalence classes. [2025-04-29 11:13:41,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 41 of 44 statements. [2025-04-29 11:13:41,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:13:41,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:41,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-29 11:13:41,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:42,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:13:42,446 INFO L325 Elim1Store]: treesize reduction 8, result has 81.4 percent of original size [2025-04-29 11:13:42,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 49 [2025-04-29 11:13:42,622 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 5 treesize of output 3 [2025-04-29 11:13:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:13:42,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:42,729 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 6 treesize of output 4 [2025-04-29 11:13:43,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2025-04-29 11:13:43,287 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:43,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 60 [2025-04-29 11:13:43,499 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 52 treesize of output 44 [2025-04-29 11:13:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:13:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119327402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:43,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 65 [2025-04-29 11:13:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225429738] [2025-04-29 11:13:43,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:43,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-29 11:13:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:43,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-29 11:13:43,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3918, Unknown=0, NotChecked=0, Total=4290 [2025-04-29 11:13:43,920 INFO L87 Difference]: Start difference. First operand 169 states and 188 transitions. Second operand has 66 states, 65 states have (on average 1.6) internal successors, (104), 66 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:45,514 INFO L93 Difference]: Finished difference Result 282 states and 311 transitions. [2025-04-29 11:13:45,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-29 11:13:45,514 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.6) internal successors, (104), 66 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-29 11:13:45,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:45,515 INFO L225 Difference]: With dead ends: 282 [2025-04-29 11:13:45,515 INFO L226 Difference]: Without dead ends: 260 [2025-04-29 11:13:45,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3225 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=877, Invalid=8825, Unknown=0, NotChecked=0, Total=9702 [2025-04-29 11:13:45,517 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 112 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:45,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 199 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:13:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-29 11:13:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 196. [2025-04-29 11:13:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.1282051282051282) internal successors, (220), 195 states have internal predecessors, (220), 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,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2025-04-29 11:13:45,520 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 44 [2025-04-29 11:13:45,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:45,520 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2025-04-29 11:13:45,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.6) internal successors, (104), 66 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:45,520 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2025-04-29 11:13:45,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:13:45,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:45,521 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:45,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-29 11:13:45,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:45,722 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:45,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1697058413, now seen corresponding path program 4 times [2025-04-29 11:13:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:45,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112216915] [2025-04-29 11:13:45,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:45,731 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-04-29 11:13:45,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:13:45,739 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:45,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:13:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:46,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112216915] [2025-04-29 11:13:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112216915] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:46,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103157534] [2025-04-29 11:13:46,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:46,095 INFO L229 MonitoredProcess]: Starting monitored process 25 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,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-29 11:13:46,159 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-04-29 11:13:46,244 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:13:46,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:46,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:46,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:13:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:13:46,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:13:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103157534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:46,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 36 [2025-04-29 11:13:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008498850] [2025-04-29 11:13:46,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:46,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 11:13:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:46,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 11:13:46,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:13:46,493 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 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,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:46,951 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2025-04-29 11:13:46,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:13:46,951 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 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 49 [2025-04-29 11:13:46,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:46,952 INFO L225 Difference]: With dead ends: 199 [2025-04-29 11:13:46,952 INFO L226 Difference]: Without dead ends: 199 [2025-04-29 11:13:46,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=2610, Unknown=0, NotChecked=0, Total=3080 [2025-04-29 11:13:46,953 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:46,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 228 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-29 11:13:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2025-04-29 11:13:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.1210526315789473) internal successors, (213), 190 states have internal predecessors, (213), 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,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2025-04-29 11:13:46,956 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 49 [2025-04-29 11:13:46,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:46,956 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2025-04-29 11:13:46,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 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,956 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2025-04-29 11:13:46,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:13:46,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:46,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:46,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-29 11:13:47,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:47,157 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:47,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1676810741, now seen corresponding path program 5 times [2025-04-29 11:13:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:47,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436079930] [2025-04-29 11:13:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:47,165 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 5 equivalence classes. [2025-04-29 11:13:47,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:13:47,177 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:13:47,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:13:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:47,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436079930] [2025-04-29 11:13:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436079930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:47,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69432838] [2025-04-29 11:13:47,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:13:47,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:47,477 INFO L229 MonitoredProcess]: Starting monitored process 26 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:47,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-29 11:13:47,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 5 equivalence classes. [2025-04-29 11:13:47,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:13:47,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:13:47,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:47,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-29 11:13:47,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:47,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:47,902 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-29 11:13:47,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2025-04-29 11:13:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:13:47,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:48,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:13:48,010 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:48,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-04-29 11:13:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:13:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69432838] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:48,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 46 [2025-04-29 11:13:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531662212] [2025-04-29 11:13:48,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:48,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:13:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:48,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:13:48,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2025-04-29 11:13:48,231 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:48,831 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2025-04-29 11:13:48,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 11:13:48,831 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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 51 [2025-04-29 11:13:48,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:48,832 INFO L225 Difference]: With dead ends: 224 [2025-04-29 11:13:48,832 INFO L226 Difference]: Without dead ends: 216 [2025-04-29 11:13:48,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=708, Invalid=4262, Unknown=0, NotChecked=0, Total=4970 [2025-04-29 11:13:48,832 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:48,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 192 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:13:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-29 11:13:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 205. [2025-04-29 11:13:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.1225490196078431) internal successors, (229), 204 states have internal predecessors, (229), 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,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 229 transitions. [2025-04-29 11:13:48,835 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 229 transitions. Word has length 51 [2025-04-29 11:13:48,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:48,835 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 229 transitions. [2025-04-29 11:13:48,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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:48,835 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 229 transitions. [2025-04-29 11:13:48,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:13:48,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:48,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:48,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-29 11:13:49,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-29 11:13:49,036 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:49,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 84137421, now seen corresponding path program 6 times [2025-04-29 11:13:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:49,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60894648] [2025-04-29 11:13:49,037 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:13:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:49,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 5 equivalence classes. [2025-04-29 11:13:49,061 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:13:49,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:13:49,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:13:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:49,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60894648] [2025-04-29 11:13:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60894648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:49,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18528251] [2025-04-29 11:13:49,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:13:49,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:49,452 INFO L229 MonitoredProcess]: Starting monitored process 27 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,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-29 11:13:49,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 5 equivalence classes. [2025-04-29 11:13:49,603 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:13:49,603 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:13:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:13:49,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:49,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:13:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:49,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:49,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:13:49,907 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 14 treesize of output 12 [2025-04-29 11:13:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18528251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:50,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2025-04-29 11:13:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576859893] [2025-04-29 11:13:50,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:50,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 11:13:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 11:13:50,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:13:50,128 INFO L87 Difference]: Start difference. First operand 205 states and 229 transitions. Second operand has 40 states, 40 states have (on average 2.7) internal successors, (108), 40 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,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:51,112 INFO L93 Difference]: Finished difference Result 235 states and 259 transitions. [2025-04-29 11:13:51,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-29 11:13:51,112 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.7) internal successors, (108), 40 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 52 [2025-04-29 11:13:51,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:51,113 INFO L225 Difference]: With dead ends: 235 [2025-04-29 11:13:51,113 INFO L226 Difference]: Without dead ends: 235 [2025-04-29 11:13:51,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=773, Invalid=3919, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:13:51,114 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 180 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:51,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 486 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:13:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-29 11:13:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2025-04-29 11:13:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.12) internal successors, (224), 200 states have internal predecessors, (224), 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,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2025-04-29 11:13:51,117 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 52 [2025-04-29 11:13:51,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:51,117 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2025-04-29 11:13:51,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.7) internal successors, (108), 40 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,117 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2025-04-29 11:13:51,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:13:51,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:51,117 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:51,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:51,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-29 11:13:51,318 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:51,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -5371255, now seen corresponding path program 7 times [2025-04-29 11:13:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:51,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461535695] [2025-04-29 11:13:51,318 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:13:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:51,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:13:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:13:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:51,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461535695] [2025-04-29 11:13:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461535695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:51,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178332263] [2025-04-29 11:13:51,786 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:13:51,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:51,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:51,788 INFO L229 MonitoredProcess]: Starting monitored process 28 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,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-29 11:13:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:13:51,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:13:51,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:51,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:51,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:13:51,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:52,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:53,070 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-29 11:13:53,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-04-29 11:13:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 34 proven. 25 refuted. 3 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:53,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:53,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-29 11:13:53,332 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:53,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-04-29 11:13:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:13:53,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178332263] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:53,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 53 [2025-04-29 11:13:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999348371] [2025-04-29 11:13:53,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:53,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:13:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:53,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:13:53,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2529, Unknown=3, NotChecked=0, Total=2756 [2025-04-29 11:13:53,594 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 53 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 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:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:55,002 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2025-04-29 11:13:55,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-29 11:13:55,003 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 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 53 [2025-04-29 11:13:55,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:55,003 INFO L225 Difference]: With dead ends: 258 [2025-04-29 11:13:55,003 INFO L226 Difference]: Without dead ends: 247 [2025-04-29 11:13:55,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=652, Invalid=5825, Unknown=3, NotChecked=0, Total=6480 [2025-04-29 11:13:55,004 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:55,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 275 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:13:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-29 11:13:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2025-04-29 11:13:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.1182266009852218) internal successors, (227), 203 states have internal predecessors, (227), 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:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 227 transitions. [2025-04-29 11:13:55,007 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 227 transitions. Word has length 53 [2025-04-29 11:13:55,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:55,007 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 227 transitions. [2025-04-29 11:13:55,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 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:55,007 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 227 transitions. [2025-04-29 11:13:55,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:13:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:55,007 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:55,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-29 11:13:55,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-29 11:13:55,208 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:55,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1766920439, now seen corresponding path program 8 times [2025-04-29 11:13:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:55,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525865964] [2025-04-29 11:13:55,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:55,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-04-29 11:13:55,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:13:55,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:55,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:13:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:55,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525865964] [2025-04-29 11:13:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525865964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:55,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865376224] [2025-04-29 11:13:55,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:55,658 INFO L229 MonitoredProcess]: Starting monitored process 29 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:55,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-29 11:13:55,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-04-29 11:13:55,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:13:55,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:55,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-29 11:13:55,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:55,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:13:56,901 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-29 11:13:56,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-04-29 11:13:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 41 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:13:56,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:57,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-29 11:13:57,141 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:13:57,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-04-29 11:13:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:13:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865376224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:57,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 58 [2025-04-29 11:13:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062069769] [2025-04-29 11:13:57,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-29 11:13:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-29 11:13:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3026, Unknown=1, NotChecked=0, Total=3306 [2025-04-29 11:13:57,471 INFO L87 Difference]: Start difference. First operand 204 states and 227 transitions. Second operand has 58 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 58 states have internal predecessors, (131), 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:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:59,698 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2025-04-29 11:13:59,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-29 11:13:59,698 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 58 states have internal predecessors, (131), 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 54 [2025-04-29 11:13:59,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:59,699 INFO L225 Difference]: With dead ends: 306 [2025-04-29 11:13:59,699 INFO L226 Difference]: Without dead ends: 284 [2025-04-29 11:13:59,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3253 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1201, Invalid=10140, Unknown=1, NotChecked=0, Total=11342 [2025-04-29 11:13:59,699 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 122 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 3203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:59,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 572 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3203 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 11:13:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-29 11:13:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 233. [2025-04-29 11:13:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.1163793103448276) internal successors, (259), 232 states have internal predecessors, (259), 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:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2025-04-29 11:13:59,702 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 54 [2025-04-29 11:13:59,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:59,702 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2025-04-29 11:13:59,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 58 states have internal predecessors, (131), 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:59,703 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2025-04-29 11:13:59,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:13:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:59,703 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:59,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-29 11:13:59,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:59,904 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:13:59,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2023252797, now seen corresponding path program 9 times [2025-04-29 11:13:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:59,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471289406] [2025-04-29 11:13:59,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:59,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 7 equivalence classes. [2025-04-29 11:13:59,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:13:59,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-29 11:13:59,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:00,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471289406] [2025-04-29 11:14:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471289406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:00,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319804031] [2025-04-29 11:14:00,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:00,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:00,486 INFO L229 MonitoredProcess]: Starting monitored process 30 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:14:00,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-29 11:14:00,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 7 equivalence classes. [2025-04-29 11:14:00,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:14:00,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-29 11:14:00,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:00,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-29 11:14:00,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:00,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:14:04,113 INFO L325 Elim1Store]: treesize reduction 17, result has 48.5 percent of original size [2025-04-29 11:14:04,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 34 [2025-04-29 11:14:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 38 proven. 39 refuted. 7 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:14:04,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:04,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2025-04-29 11:14:04,751 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:14:04,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 45 [2025-04-29 11:14:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 49 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:14:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319804031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:05,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 63 [2025-04-29 11:14:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453497298] [2025-04-29 11:14:05,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:05,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-29 11:14:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:05,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-29 11:14:05,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3589, Unknown=12, NotChecked=0, Total=3906 [2025-04-29 11:14:05,099 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 63 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 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:14:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:06,961 INFO L93 Difference]: Finished difference Result 318 states and 345 transitions. [2025-04-29 11:14:06,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-29 11:14:06,961 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 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 56 [2025-04-29 11:14:06,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:06,962 INFO L225 Difference]: With dead ends: 318 [2025-04-29 11:14:06,962 INFO L226 Difference]: Without dead ends: 304 [2025-04-29 11:14:06,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=888, Invalid=8606, Unknown=12, NotChecked=0, Total=9506 [2025-04-29 11:14:06,963 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 127 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:06,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 298 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:14:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-04-29 11:14:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 236. [2025-04-29 11:14:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.1148936170212767) internal successors, (262), 235 states have internal predecessors, (262), 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:14:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2025-04-29 11:14:06,966 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 56 [2025-04-29 11:14:06,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:06,966 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2025-04-29 11:14:06,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 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:14:06,967 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2025-04-29 11:14:06,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:14:06,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:06,967 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:06,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:07,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-29 11:14:07,168 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:14:07,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 758079919, now seen corresponding path program 4 times [2025-04-29 11:14:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:07,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476499640] [2025-04-29 11:14:07,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:07,178 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:14:07,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:14:07,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:07,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 41 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:14:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:07,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476499640] [2025-04-29 11:14:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476499640] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:07,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100797063] [2025-04-29 11:14:07,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:07,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:07,516 INFO L229 MonitoredProcess]: Starting monitored process 31 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:14:07,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-29 11:14:07,596 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:14:07,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:14:07,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:07,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:07,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 11:14:07,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:07,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:14:07,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:14:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:14:07,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:07,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:14:07,932 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 16 treesize of output 12 [2025-04-29 11:14:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:14:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100797063] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:07,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2025-04-29 11:14:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791538698] [2025-04-29 11:14:07,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:07,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:14:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:07,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:14:07,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:14:07,989 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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:14:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:08,567 INFO L93 Difference]: Finished difference Result 418 states and 455 transitions. [2025-04-29 11:14:08,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:14:08,567 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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 57 [2025-04-29 11:14:08,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:08,568 INFO L225 Difference]: With dead ends: 418 [2025-04-29 11:14:08,568 INFO L226 Difference]: Without dead ends: 333 [2025-04-29 11:14:08,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=2912, Unknown=0, NotChecked=0, Total=3192 [2025-04-29 11:14:08,569 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:08,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 425 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:14:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-29 11:14:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 299. [2025-04-29 11:14:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.1140939597315436) internal successors, (332), 298 states have internal predecessors, (332), 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:14:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2025-04-29 11:14:08,573 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 57 [2025-04-29 11:14:08,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:08,573 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2025-04-29 11:14:08,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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:14:08,573 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2025-04-29 11:14:08,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:14:08,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:08,573 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:08,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-29 11:14:08,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-29 11:14:08,774 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:14:08,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -75028407, now seen corresponding path program 10 times [2025-04-29 11:14:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:08,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88862230] [2025-04-29 11:14:08,775 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:08,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-29 11:14:08,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:14:08,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:08,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 34 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:14:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:10,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88862230] [2025-04-29 11:14:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88862230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:10,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402456486] [2025-04-29 11:14:10,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:10,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:10,016 INFO L229 MonitoredProcess]: Starting monitored process 32 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:14:10,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-29 11:14:10,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-29 11:14:10,136 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:14:10,136 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:10,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:10,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-29 11:14:10,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:10,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 Killed by 15