./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca-2.i --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/openbsd_cstrncat-alloca-2.i -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 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:34:06,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:34:06,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:34:06,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:34:06,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:34:06,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:34:06,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:34:06,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:34:06,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:34:06,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:34:06,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:34:06,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:34:06,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:34:06,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:34:06,314 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:34:06,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:34:06,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:34:06,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:34:06,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:34:06,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:34:06,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:06,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:06,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:06,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:34:06,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:34:06,318 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 -> 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 [2025-04-30 10:34:06,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:34:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:34:06,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:34:06,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:34:06,549 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:34:06,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca-2.i [2025-04-30 10:34:07,832 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc118836e/6c8758f29e664a21b930371fcea585f4/FLAG85f60c4cd [2025-04-30 10:34:08,099 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:34:08,099 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca-2.i [2025-04-30 10:34:08,114 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc118836e/6c8758f29e664a21b930371fcea585f4/FLAG85f60c4cd [2025-04-30 10:34:08,881 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc118836e/6c8758f29e664a21b930371fcea585f4 [2025-04-30 10:34:08,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:34:08,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:34:08,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:08,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:34:08,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:34:08,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:08" (1/1) ... [2025-04-30 10:34:08,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1308362c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:08, skipping insertion in model container [2025-04-30 10:34:08,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:08" (1/1) ... [2025-04-30 10:34:08,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:34:09,161 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-30 10:34:09,164 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-30 10:34:09,170 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:09,179 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:34:09,235 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:09,253 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:34:09,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09 WrapperNode [2025-04-30 10:34:09,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:09,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:09,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:34:09,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:34:09,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,290 INFO L138 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2025-04-30 10:34:09,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:09,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:34:09,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:34:09,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:34:09,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,305 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [5, 3]. 63 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 6 writes are split as follows [4, 2]. [2025-04-30 10:34:09,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:34:09,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:34:09,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:34:09,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:34:09,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (1/1) ... [2025-04-30 10:34:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:09,340 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-30 10:34:09,341 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-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:34:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:34:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:34:09,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:34:09,434 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:34:09,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:34:09,575 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-04-30 10:34:09,575 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:34:09,582 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:34:09,582 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:34:09,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:09 BoogieIcfgContainer [2025-04-30 10:34:09,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:34:09,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:34:09,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:34:09,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:34:09,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:34:08" (1/3) ... [2025-04-30 10:34:09,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f8dd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:09, skipping insertion in model container [2025-04-30 10:34:09,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:09" (2/3) ... [2025-04-30 10:34:09,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f8dd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:09, skipping insertion in model container [2025-04-30 10:34:09,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:09" (3/3) ... [2025-04-30 10:34:09,590 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-2.i [2025-04-30 10:34:09,602 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:34:09,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncat-alloca-2.i that has 1 procedures, 48 locations, 59 edges, 1 initial locations, 4 loop locations, and 17 error locations. [2025-04-30 10:34:09,631 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:34:09,640 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;@52b5cc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:34:09,641 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-04-30 10:34:09,644 INFO L278 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 47 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-30 10:34:09,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:09,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:09,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:09,647 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:09,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031099, now seen corresponding path program 1 times [2025-04-30 10:34:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:09,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399397574] [2025-04-30 10:34:09,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:09,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:09,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:09,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:09,768 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-30 10:34:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:09,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399397574] [2025-04-30 10:34:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399397574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:09,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126383484] [2025-04-30 10:34:09,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:09,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:09,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:09,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:09,796 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 47 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) 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-30 10:34:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:09,852 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-04-30 10:34:09,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:09,853 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-30 10:34:09,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:09,859 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:34:09,859 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:09,860 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-30 10:34:09,862 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:09,863 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-04-30 10:34:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 45 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-30 10:34:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-04-30 10:34:09,884 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 7 [2025-04-30 10:34:09,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:09,885 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-04-30 10:34:09,885 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-30 10:34:09,885 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-04-30 10:34:09,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:09,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:09,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:09,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:34:09,886 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:09,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash 121388788, now seen corresponding path program 1 times [2025-04-30 10:34:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:09,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316152001] [2025-04-30 10:34:09,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:09,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:09,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:09,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:09,998 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-30 10:34:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:09,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316152001] [2025-04-30 10:34:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316152001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188448065] [2025-04-30 10:34:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:10,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:10,001 INFO L87 Difference]: Start difference. First operand 46 states and 54 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-30 10:34:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,078 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-04-30 10:34:10,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:10,079 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-30 10:34:10,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,079 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:34:10,079 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:10,079 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-30 10:34:10,080 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-04-30 10:34:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 45 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-30 10:34:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-04-30 10:34:10,083 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2025-04-30 10:34:10,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,083 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-04-30 10:34:10,083 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-30 10:34:10,083 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-04-30 10:34:10,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:10,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:34:10,084 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:10,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash 178647090, now seen corresponding path program 1 times [2025-04-30 10:34:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:10,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660475088] [2025-04-30 10:34:10,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:10,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:10,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,431 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-30 10:34:10,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:10,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660475088] [2025-04-30 10:34:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660475088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195357464] [2025-04-30 10:34:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:10,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:10,432 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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-30 10:34:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,520 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-04-30 10:34:10,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:10,521 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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-30 10:34:10,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,521 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:34:10,521 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:34:10,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:10,522 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:34:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-04-30 10:34:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.8387096774193548) 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-30 10:34:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-30 10:34:10,529 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 8 [2025-04-30 10:34:10,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,529 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-30 10:34:10,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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-30 10:34:10,529 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-30 10:34:10,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:10,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:34:10,529 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:10,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 178647089, now seen corresponding path program 1 times [2025-04-30 10:34:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:10,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716212807] [2025-04-30 10:34:10,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:10,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:10,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,586 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-30 10:34:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:10,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716212807] [2025-04-30 10:34:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716212807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841766708] [2025-04-30 10:34:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:10,589 INFO L87 Difference]: Start difference. First operand 48 states and 57 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-30 10:34:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,613 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-04-30 10:34:10,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:10,614 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-30 10:34:10,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,614 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:34:10,614 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:10,614 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-30 10:34:10,616 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-04-30 10:34:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 45 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-30 10:34:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-04-30 10:34:10,618 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 8 [2025-04-30 10:34:10,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,618 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-04-30 10:34:10,618 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-30 10:34:10,618 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-04-30 10:34:10,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:34:10,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:34:10,619 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:10,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1243098518, now seen corresponding path program 1 times [2025-04-30 10:34:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:10,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300941440] [2025-04-30 10:34:10,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:10,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:10,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:34:10,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:34:10,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:10,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,661 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-30 10:34:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:10,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300941440] [2025-04-30 10:34:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300941440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:10,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:10,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274684447] [2025-04-30 10:34:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:10,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:10,663 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,681 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-04-30 10:34:10,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:10,682 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:34:10,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,682 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:34:10,682 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:34:10,682 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-30 10:34:10,684 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:34:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2025-04-30 10:34:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-04-30 10:34:10,688 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 9 [2025-04-30 10:34:10,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,689 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-04-30 10:34:10,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:10,689 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-04-30 10:34:10,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:34:10,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:34:10,689 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:10,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1243098711, now seen corresponding path program 1 times [2025-04-30 10:34:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:10,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264627884] [2025-04-30 10:34:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:34:10,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:34:10,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:10,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,738 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-30 10:34:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:10,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264627884] [2025-04-30 10:34:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264627884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:10,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402029499] [2025-04-30 10:34:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:10,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:10,740 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-30 10:34:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,779 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-04-30 10:34:10,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:10,780 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-30 10:34:10,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,780 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:34:10,780 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:34:10,781 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-30 10:34:10,781 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 135 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:34:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-30 10:34:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.641025641025641) internal successors, (64), 53 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-30 10:34:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-04-30 10:34:10,785 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 9 [2025-04-30 10:34:10,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,785 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-04-30 10:34:10,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-30 10:34:10,785 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-04-30 10:34:10,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:10,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,786 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:34:10,786 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:10,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 610951508, now seen corresponding path program 1 times [2025-04-30 10:34:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:10,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338030589] [2025-04-30 10:34:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:10,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:10,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:10,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,032 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-30 10:34:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:11,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338030589] [2025-04-30 10:34:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338030589] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:11,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714951889] [2025-04-30 10:34:11,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:11,035 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-30 10:34:11,036 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-30 10:34:11,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:11,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:34:11,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:11,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:11,146 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-30 10:34:11,155 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-30 10:34:11,281 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-30 10:34:11,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:11,425 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:11,446 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-30 10:34:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714951889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:11,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:11,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-04-30 10:34:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807845460] [2025-04-30 10:34:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:11,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:34:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:11,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:34:11,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:11,447 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:34:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:11,602 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-04-30 10:34:11,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:11,603 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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-30 10:34:11,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:11,603 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:34:11,603 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:34:11,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:34:11,604 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:11,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 185 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:34:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-04-30 10:34:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-30 10:34:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-04-30 10:34:11,609 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 11 [2025-04-30 10:34:11,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:11,609 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-04-30 10:34:11,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:34:11,609 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-04-30 10:34:11,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:11,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:11,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:11,618 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-30 10:34:11,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:11,811 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:11,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1759633781, now seen corresponding path program 1 times [2025-04-30 10:34:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:11,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957004843] [2025-04-30 10:34:11,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:11,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:11,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:11,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,925 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-30 10:34:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:11,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957004843] [2025-04-30 10:34:11,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957004843] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:11,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494757408] [2025-04-30 10:34:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:11,930 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-30 10:34:11,931 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-30 10:34:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:34:11,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:12,076 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-30 10:34:12,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:34:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494757408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:34:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-30 10:34:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377806098] [2025-04-30 10:34:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:12,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:34:12,077 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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-30 10:34:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,171 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-04-30 10:34:12,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:34:12,172 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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-30 10:34:12,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,172 INFO L225 Difference]: With dead ends: 50 [2025-04-30 10:34:12,172 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:34:12,172 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:34:12,173 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:34:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-30 10:34:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 49 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-30 10:34:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-04-30 10:34:12,178 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 12 [2025-04-30 10:34:12,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,178 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-04-30 10:34:12,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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-30 10:34:12,178 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-04-30 10:34:12,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:12,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,186 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-30 10:34:12,379 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,SelfDestructingSolverStorable7 [2025-04-30 10:34:12,379 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:12,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1855275338, now seen corresponding path program 1 times [2025-04-30 10:34:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445878230] [2025-04-30 10:34:12,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,417 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-30 10:34:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445878230] [2025-04-30 10:34:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445878230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586177169] [2025-04-30 10:34:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:12,418 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-30 10:34:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,438 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-04-30 10:34:12,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:12,439 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-30 10:34:12,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,439 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:34:12,439 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:34:12,439 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-30 10:34:12,440 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 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-30 10:34:12,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:34:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-30 10:34:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.5405405405405406) 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-30 10:34:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-30 10:34:12,442 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 12 [2025-04-30 10:34:12,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,442 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-30 10:34:12,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-30 10:34:12,443 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-30 10:34:12,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:34:12,443 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:12,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1855275337, now seen corresponding path program 1 times [2025-04-30 10:34:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853651137] [2025-04-30 10:34:12,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:12,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:12,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,493 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-30 10:34:12,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853651137] [2025-04-30 10:34:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853651137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:12,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955193566] [2025-04-30 10:34:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:12,496 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-30 10:34:12,497 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-30 10:34:12,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:12,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:12,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:34:12,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:12,585 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-30 10:34:12,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:12,639 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-30 10:34:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955193566] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:12,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:12,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-30 10:34:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318356070] [2025-04-30 10:34:12,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:12,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:34:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:34:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:34:12,643 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,741 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-04-30 10:34:12,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:12,742 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:34:12,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,742 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:34:12,742 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:34:12,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:34:12,743 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 197 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:34:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2025-04-30 10:34:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.525) internal successors, (61), 50 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-30 10:34:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-04-30 10:34:12,745 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 12 [2025-04-30 10:34:12,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,745 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-04-30 10:34:12,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,745 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-04-30 10:34:12,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:34:12,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:12,751 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-30 10:34:12,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:12,950 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:12,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1285927648, now seen corresponding path program 1 times [2025-04-30 10:34:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414381012] [2025-04-30 10:34:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:34:12,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:34:12,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:12,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,041 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-30 10:34:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414381012] [2025-04-30 10:34:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414381012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576040158] [2025-04-30 10:34:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:13,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:13,042 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-30 10:34:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,055 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2025-04-30 10:34:13,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:13,056 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-30 10:34:13,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,056 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:34:13,056 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:34:13,057 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-30 10:34:13,057 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:34:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-30 10:34:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 53 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-30 10:34:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-04-30 10:34:13,062 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 13 [2025-04-30 10:34:13,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,063 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-04-30 10:34:13,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-30 10:34:13,063 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-04-30 10:34:13,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:34:13,063 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:34:13,063 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:13,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1678954658, now seen corresponding path program 1 times [2025-04-30 10:34:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800466889] [2025-04-30 10:34:13,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:34:13,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:34:13,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,147 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-30 10:34:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800466889] [2025-04-30 10:34:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800466889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924580931] [2025-04-30 10:34:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:13,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:13,149 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,181 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-04-30 10:34:13,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:13,181 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:34:13,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,181 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:34:13,181 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:34:13,181 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-30 10:34:13,182 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:34:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-04-30 10:34:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.5) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-30 10:34:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-04-30 10:34:13,184 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 13 [2025-04-30 10:34:13,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,184 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-04-30 10:34:13,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:13,184 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-04-30 10:34:13,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:34:13,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:34:13,184 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:13,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1246247829, now seen corresponding path program 2 times [2025-04-30 10:34:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587869948] [2025-04-30 10:34:13,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-30 10:34:13,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 15 statements. [2025-04-30 10:34:13,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:34:13,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587869948] [2025-04-30 10:34:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587869948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3839250] [2025-04-30 10:34:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:13,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:13,296 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-30 10:34:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,361 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-04-30 10:34:13,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:13,362 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 15 [2025-04-30 10:34:13,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,362 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:34:13,362 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:34:13,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:13,363 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 129 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:34:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-04-30 10:34:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.5) internal successors, (63), 51 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-30 10:34:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-04-30 10:34:13,365 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 15 [2025-04-30 10:34:13,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,365 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-04-30 10:34:13,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-30 10:34:13,365 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-04-30 10:34:13,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:34:13,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:34:13,366 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:13,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2037710907, now seen corresponding path program 1 times [2025-04-30 10:34:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633922890] [2025-04-30 10:34:13,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:13,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:13,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,445 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-30 10:34:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633922890] [2025-04-30 10:34:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633922890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185290654] [2025-04-30 10:34:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:13,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:13,446 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,488 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-04-30 10:34:13,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:13,489 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:34:13,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,489 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:34:13,489 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:34:13,489 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-30 10:34:13,489 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 65 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:34:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-30 10:34:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-30 10:34:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-04-30 10:34:13,491 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 16 [2025-04-30 10:34:13,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,491 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-04-30 10:34:13,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:13,491 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-04-30 10:34:13,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:34:13,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:13,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:34:13,491 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:13,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2037710908, now seen corresponding path program 1 times [2025-04-30 10:34:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:13,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360975585] [2025-04-30 10:34:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:13,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,612 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-30 10:34:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:13,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360975585] [2025-04-30 10:34:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360975585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:13,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477551272] [2025-04-30 10:34:13,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:13,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:13,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:13,614 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-30 10:34:13,616 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-30 10:34:13,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:34:13,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:34:13,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:13,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:13,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:34:13,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:13,727 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-30 10:34:13,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:13,755 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-30 10:34:13,764 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-30 10:34:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477551272] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:13,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:13,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-30 10:34:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715098039] [2025-04-30 10:34:13,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:13,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:34:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:13,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:34:13,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:13,765 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:34:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:13,875 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-04-30 10:34:13,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:13,876 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:34:13,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:13,876 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:34:13,876 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:34:13,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:13,877 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:13,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 131 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:34:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2025-04-30 10:34:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.425531914893617) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-04-30 10:34:13,878 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 16 [2025-04-30 10:34:13,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:13,878 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-04-30 10:34:13,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:34:13,878 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-04-30 10:34:13,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:13,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:13,879 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-30 10:34:13,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:34:14,079 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-30 10:34:14,079 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:14,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -263521062, now seen corresponding path program 1 times [2025-04-30 10:34:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147353796] [2025-04-30 10:34:14,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:14,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:14,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,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-30 10:34:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147353796] [2025-04-30 10:34:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147353796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746167885] [2025-04-30 10:34:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:14,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:14,125 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,141 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2025-04-30 10:34:14,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:14,141 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:34:14,141 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,142 INFO L225 Difference]: With dead ends: 93 [2025-04-30 10:34:14,142 INFO L226 Difference]: Without dead ends: 93 [2025-04-30 10:34:14,142 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-30 10:34:14,142 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-30 10:34:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2025-04-30 10:34:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 76 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-30 10:34:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2025-04-30 10:34:14,145 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 18 [2025-04-30 10:34:14,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,145 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2025-04-30 10:34:14,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:14,145 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2025-04-30 10:34:14,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,149 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-30 10:34:14,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:34:14,149 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:14,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1274638312, now seen corresponding path program 1 times [2025-04-30 10:34:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161838273] [2025-04-30 10:34:14,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:14,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:14,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,242 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-30 10:34:14,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161838273] [2025-04-30 10:34:14,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161838273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:14,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:14,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:14,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499530973] [2025-04-30 10:34:14,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:14,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:14,244 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,260 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2025-04-30 10:34:14,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:14,260 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:34:14,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,260 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:34:14,261 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:34:14,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:14,262 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:34:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2025-04-30 10:34:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-04-30 10:34:14,265 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 18 [2025-04-30 10:34:14,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,265 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-04-30 10:34:14,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:14,266 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-04-30 10:34:14,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:14,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:14,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:34:14,266 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:14,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1271750107, now seen corresponding path program 1 times [2025-04-30 10:34:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327559423] [2025-04-30 10:34:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:14,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327559423] [2025-04-30 10:34:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327559423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:14,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128059191] [2025-04-30 10:34:14,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:14,357 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-30 10:34:14,359 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-30 10:34:14,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:14,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:14,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:34:14,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:14,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128059191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:14,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:34:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357859628] [2025-04-30 10:34:14,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:34:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:34:14,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:34:14,559 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-30 10:34:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:14,708 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2025-04-30 10:34:14,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:34:14,708 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-30 10:34:14,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:14,710 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:34:14,710 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:34:14,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:14,711 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:14,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 247 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:34:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2025-04-30 10:34:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 59 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-30 10:34:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2025-04-30 10:34:14,715 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 18 [2025-04-30 10:34:14,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:14,715 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-04-30 10:34:14,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-30 10:34:14,716 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2025-04-30 10:34:14,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:14,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:14,716 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-30 10:34:14,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:14,916 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,SelfDestructingSolverStorable17 [2025-04-30 10:34:14,917 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:14,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 377902655, now seen corresponding path program 1 times [2025-04-30 10:34:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:14,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892151219] [2025-04-30 10:34:14,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:14,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:14,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:14,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,203 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-30 10:34:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:15,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892151219] [2025-04-30 10:34:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892151219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:15,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231313441] [2025-04-30 10:34:15,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:15,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:15,206 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-30 10:34:15,207 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-30 10:34:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:15,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:15,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:15,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:15,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:34:15,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:15,367 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 17 treesize of output 13 [2025-04-30 10:34:15,530 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-30 10:34:15,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2025-04-30 10:34:15,549 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-30 10:34:15,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:15,615 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 16 treesize of output 14 [2025-04-30 10:34:15,618 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 18 treesize of output 16 [2025-04-30 10:34:15,748 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-30 10:34:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231313441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:15,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-30 10:34:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044300423] [2025-04-30 10:34:15,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:15,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:34:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:15,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:34:15,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:15,750 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,436 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2025-04-30 10:34:16,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:34:16,437 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:34:16,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,437 INFO L225 Difference]: With dead ends: 101 [2025-04-30 10:34:16,437 INFO L226 Difference]: Without dead ends: 101 [2025-04-30 10:34:16,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2025-04-30 10:34:16,439 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 165 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 318 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-30 10:34:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2025-04-30 10:34:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.380281690140845) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2025-04-30 10:34:16,444 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 19 [2025-04-30 10:34:16,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,444 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2025-04-30 10:34:16,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,445 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2025-04-30 10:34:16,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:16,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,445 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-30 10:34:16,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:34:16,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:16,646 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:16,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash 377904778, now seen corresponding path program 1 times [2025-04-30 10:34:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168073018] [2025-04-30 10:34:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:16,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:16,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,699 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-30 10:34:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168073018] [2025-04-30 10:34:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168073018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355785652] [2025-04-30 10:34:16,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:16,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:16,701 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-30 10:34:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,741 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2025-04-30 10:34:16,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:16,742 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-30 10:34:16,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,743 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:34:16,743 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:34:16,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:16,744 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:34:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:34:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 76 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-30 10:34:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2025-04-30 10:34:16,750 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 19 [2025-04-30 10:34:16,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,750 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-04-30 10:34:16,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-30 10:34:16,750 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2025-04-30 10:34:16,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:16,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,750 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-30 10:34:16,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:34:16,750 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:16,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 377904779, now seen corresponding path program 1 times [2025-04-30 10:34:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562644573] [2025-04-30 10:34:16,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:16,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:16,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,878 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-30 10:34:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562644573] [2025-04-30 10:34:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562644573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:34:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296133612] [2025-04-30 10:34:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:16,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:16,880 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-30 10:34:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,945 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-04-30 10:34:16,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:16,946 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-30 10:34:16,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,947 INFO L225 Difference]: With dead ends: 82 [2025-04-30 10:34:16,947 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:34:16,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:16,948 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:34:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-04-30 10:34:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 78 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-30 10:34:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-04-30 10:34:16,951 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 19 [2025-04-30 10:34:16,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,951 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-04-30 10:34:16,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-30 10:34:16,951 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-04-30 10:34:16,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:34:16,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:16,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:34:16,952 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:16,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1891288007, now seen corresponding path program 2 times [2025-04-30 10:34:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666719364] [2025-04-30 10:34:16,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:34:16,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:34:16,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:16,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666719364] [2025-04-30 10:34:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666719364] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:17,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878122681] [2025-04-30 10:34:17,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:17,092 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-30 10:34:17,094 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-30 10:34:17,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:34:17,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:34:17,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:34:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:17,169 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 1 [2025-04-30 10:34:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:17,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878122681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:17,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:17,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-30 10:34:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581345387] [2025-04-30 10:34:17,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:17,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:34:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:17,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:34:17,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:34:17,513 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,683 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-04-30 10:34:17,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:17,683 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:34:17,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,684 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:34:17,684 INFO L226 Difference]: Without dead ends: 81 [2025-04-30 10:34:17,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:17,685 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 176 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-30 10:34:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2025-04-30 10:34:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 75 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2025-04-30 10:34:17,688 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 21 [2025-04-30 10:34:17,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,688 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2025-04-30 10:34:17,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,688 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2025-04-30 10:34:17,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:34:17,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,689 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] [2025-04-30 10:34:17,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:34:17,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,893 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:17,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1660907403, now seen corresponding path program 1 times [2025-04-30 10:34:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234157114] [2025-04-30 10:34:17,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:34:17,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:17,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,957 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-30 10:34:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234157114] [2025-04-30 10:34:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234157114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006407466] [2025-04-30 10:34:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:17,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:17,959 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,975 INFO L93 Difference]: Finished difference Result 135 states and 162 transitions. [2025-04-30 10:34:17,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:17,976 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:34:17,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,976 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:34:17,976 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:34:17,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:17,977 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:34:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2025-04-30 10:34:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.264) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-30 10:34:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2025-04-30 10:34:17,980 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 24 [2025-04-30 10:34:17,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,980 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2025-04-30 10:34:17,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,980 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2025-04-30 10:34:17,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:34:17,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,980 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] [2025-04-30 10:34:17,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:34:17,981 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:17,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 843258953, now seen corresponding path program 1 times [2025-04-30 10:34:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308451762] [2025-04-30 10:34:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:34:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:17,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:18,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308451762] [2025-04-30 10:34:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308451762] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:18,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310578702] [2025-04-30 10:34:18,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:18,087 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-30 10:34:18,088 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-30 10:34:18,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:34:18,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:18,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:34:18,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:18,162 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-30 10:34:18,213 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-30 10:34:18,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:34:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310578702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:34:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-04-30 10:34:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45822841] [2025-04-30 10:34:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:18,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:34:18,214 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:18,270 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2025-04-30 10:34:18,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:18,270 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:34:18,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:18,271 INFO L225 Difference]: With dead ends: 185 [2025-04-30 10:34:18,271 INFO L226 Difference]: Without dead ends: 185 [2025-04-30 10:34:18,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:34:18,271 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:18,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-30 10:34:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2025-04-30 10:34:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 144 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2025-04-30 10:34:18,275 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 174 transitions. Word has length 24 [2025-04-30 10:34:18,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:18,275 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 174 transitions. [2025-04-30 10:34:18,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,275 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 174 transitions. [2025-04-30 10:34:18,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:34:18,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:18,276 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] [2025-04-30 10:34:18,285 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-30 10:34:18,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:34:18,476 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:18,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1265960779, now seen corresponding path program 1 times [2025-04-30 10:34:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:18,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074672653] [2025-04-30 10:34:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:34:18,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:18,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074672653] [2025-04-30 10:34:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074672653] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:18,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095076806] [2025-04-30 10:34:18,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:18,579 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-30 10:34:18,580 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-30 10:34:18,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:34:18,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:34:18,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:34:18,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:18,698 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-30 10:34:18,818 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:18,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:18,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2025-04-30 10:34:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:18,904 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-30 10:34:18,906 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-30 10:34:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095076806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:18,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2025-04-30 10:34:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983651077] [2025-04-30 10:34:18,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:34:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:34:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:19,000 INFO L87 Difference]: Start difference. First operand 145 states and 174 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 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-30 10:34:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:19,431 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2025-04-30 10:34:19,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:34:19,432 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 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 24 [2025-04-30 10:34:19,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:19,432 INFO L225 Difference]: With dead ends: 190 [2025-04-30 10:34:19,432 INFO L226 Difference]: Without dead ends: 190 [2025-04-30 10:34:19,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:34:19,433 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 75 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:19,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-30 10:34:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 131. [2025-04-30 10:34:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 130 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-30 10:34:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2025-04-30 10:34:19,441 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 24 [2025-04-30 10:34:19,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:19,441 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2025-04-30 10:34:19,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 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-30 10:34:19,441 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2025-04-30 10:34:19,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:34:19,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:19,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:19,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:19,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-30 10:34:19,646 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:19,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1229100290, now seen corresponding path program 2 times [2025-04-30 10:34:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:19,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915740696] [2025-04-30 10:34:19,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:19,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:34:19,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:34:19,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,936 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-30 10:34:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:19,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915740696] [2025-04-30 10:34:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915740696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:19,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113609112] [2025-04-30 10:34:19,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:19,939 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-30 10:34:19,940 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-30 10:34:19,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:34:19,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:34:19,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:20,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:34:20,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:20,100 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-30 10:34:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:20,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:20,215 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 18 treesize of output 16 [2025-04-30 10:34:20,217 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-30 10:34:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:20,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113609112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:20,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:20,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 27 [2025-04-30 10:34:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851074992] [2025-04-30 10:34:20,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:20,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:34:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:20,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:34:20,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:34:20,320 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 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-30 10:34:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,335 INFO L93 Difference]: Finished difference Result 253 states and 298 transitions. [2025-04-30 10:34:21,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:21,336 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 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) Word has length 25 [2025-04-30 10:34:21,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,337 INFO L225 Difference]: With dead ends: 253 [2025-04-30 10:34:21,337 INFO L226 Difference]: Without dead ends: 253 [2025-04-30 10:34:21,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=2281, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:34:21,338 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 619 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-30 10:34:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 172. [2025-04-30 10:34:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 171 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-30 10:34:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2025-04-30 10:34:21,342 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 25 [2025-04-30 10:34:21,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,342 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2025-04-30 10:34:21,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 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-30 10:34:21,342 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2025-04-30 10:34:21,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:34:21,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:21,551 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,SelfDestructingSolverStorable25 [2025-04-30 10:34:21,551 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:21,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1645871145, now seen corresponding path program 1 times [2025-04-30 10:34:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773336924] [2025-04-30 10:34:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:34:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:34:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,644 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-30 10:34:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773336924] [2025-04-30 10:34:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773336924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198075874] [2025-04-30 10:34:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:21,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:21,646 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-30 10:34:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,663 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2025-04-30 10:34:21,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:21,664 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-04-30 10:34:21,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,664 INFO L225 Difference]: With dead ends: 171 [2025-04-30 10:34:21,664 INFO L226 Difference]: Without dead ends: 129 [2025-04-30 10:34:21,665 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-30 10:34:21,665 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-30 10:34:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-04-30 10:34:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 124 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-30 10:34:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2025-04-30 10:34:21,667 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 26 [2025-04-30 10:34:21,667 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,667 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2025-04-30 10:34:21,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-30 10:34:21,667 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2025-04-30 10:34:21,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:34:21,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:34:21,668 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:21,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1296585491, now seen corresponding path program 2 times [2025-04-30 10:34:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652712646] [2025-04-30 10:34:21,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:34:21,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:21,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:21,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652712646] [2025-04-30 10:34:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652712646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:34:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283970955] [2025-04-30 10:34:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:34:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:34:21,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:21,834 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,882 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2025-04-30 10:34:21,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:34:21,882 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-30 10:34:21,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,883 INFO L225 Difference]: With dead ends: 176 [2025-04-30 10:34:21,883 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:34:21,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:21,883 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 167 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:34:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 127. [2025-04-30 10:34:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 123 states have (on average 1.1951219512195121) internal successors, (147), 126 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-30 10:34:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2025-04-30 10:34:21,889 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 27 [2025-04-30 10:34:21,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,889 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2025-04-30 10:34:21,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,889 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2025-04-30 10:34:21,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:34:21,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:34:21,890 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:21,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1664550405, now seen corresponding path program 1 times [2025-04-30 10:34:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672973381] [2025-04-30 10:34:21,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:34:21,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:21,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:22,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672973381] [2025-04-30 10:34:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672973381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:22,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39453004] [2025-04-30 10:34:22,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:22,536 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-30 10:34:22,538 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-30 10:34:22,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:34:22,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:22,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:34:22,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:22,717 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 17 treesize of output 13 [2025-04-30 10:34:22,954 INFO L325 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2025-04-30 10:34:22,954 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 31 treesize of output 20 [2025-04-30 10:34:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:22,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:23,101 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 35 treesize of output 31 [2025-04-30 10:34:23,104 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:23,104 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 37 treesize of output 31 [2025-04-30 10:34:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39453004] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:23,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2025-04-30 10:34:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426247048] [2025-04-30 10:34:23,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:23,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:34:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:23,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:34:23,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:23,256 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:24,216 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2025-04-30 10:34:24,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-30 10:34:24,217 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:34:24,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:24,218 INFO L225 Difference]: With dead ends: 176 [2025-04-30 10:34:24,218 INFO L226 Difference]: Without dead ends: 157 [2025-04-30 10:34:24,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=453, Invalid=3453, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:34:24,219 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:24,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 332 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-30 10:34:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2025-04-30 10:34:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.183206106870229) internal successors, (155), 134 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-30 10:34:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2025-04-30 10:34:24,221 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 28 [2025-04-30 10:34:24,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:24,221 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2025-04-30 10:34:24,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,222 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2025-04-30 10:34:24,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:34:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:24,222 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, 1, 1] [2025-04-30 10:34:24,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:34:24,422 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,SelfDestructingSolverStorable28 [2025-04-30 10:34:24,423 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:24,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1564669457, now seen corresponding path program 1 times [2025-04-30 10:34:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:24,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309922124] [2025-04-30 10:34:24,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:24,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:24,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:34:24,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:34:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,610 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-30 10:34:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:24,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309922124] [2025-04-30 10:34:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309922124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:24,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839231102] [2025-04-30 10:34:24,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:24,612 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-30 10:34:24,614 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-30 10:34:24,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:34:24,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:34:24,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:24,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:34:24,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:24,764 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-30 10:34:24,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:24,878 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-30 10:34:24,897 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-30 10:34:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839231102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:24,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-30 10:34:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132591098] [2025-04-30 10:34:24,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:24,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:34:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:24,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:34:24,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:34:24,898 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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-30 10:34:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:25,066 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2025-04-30 10:34:25,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:34:25,066 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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) Word has length 30 [2025-04-30 10:34:25,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:25,067 INFO L225 Difference]: With dead ends: 152 [2025-04-30 10:34:25,067 INFO L226 Difference]: Without dead ends: 152 [2025-04-30 10:34:25,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:34:25,067 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:25,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 319 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-04-30 10:34:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2025-04-30 10:34:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-30 10:34:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2025-04-30 10:34:25,074 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 30 [2025-04-30 10:34:25,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:25,074 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2025-04-30 10:34:25,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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-30 10:34:25,074 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2025-04-30 10:34:25,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:34:25,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:25,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:25,081 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-30 10:34:25,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:25,275 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:25,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1698195551, now seen corresponding path program 3 times [2025-04-30 10:34:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:25,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726316998] [2025-04-30 10:34:25,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:25,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:25,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-30 10:34:25,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:25,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:34:25,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,593 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-30 10:34:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:25,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726316998] [2025-04-30 10:34:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726316998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:25,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843802433] [2025-04-30 10:34:25,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:25,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:25,596 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-30 10:34:25,597 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-30 10:34:25,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-30 10:34:25,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:25,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:34:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-30 10:34:25,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:25,813 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-30 10:34:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:25,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:25,922 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 18 treesize of output 16 [2025-04-30 10:34:25,924 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-30 10:34:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843802433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:26,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:26,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2025-04-30 10:34:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67537650] [2025-04-30 10:34:26,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:26,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:34:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:26,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:34:26,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:34:26,056 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 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-30 10:34:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:26,848 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2025-04-30 10:34:26,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-30 10:34:26,848 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 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) Word has length 31 [2025-04-30 10:34:26,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:26,849 INFO L225 Difference]: With dead ends: 275 [2025-04-30 10:34:26,849 INFO L226 Difference]: Without dead ends: 237 [2025-04-30 10:34:26,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=3088, Unknown=0, NotChecked=0, Total=3422 [2025-04-30 10:34:26,850 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 208 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:26,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 534 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-04-30 10:34:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 173. [2025-04-30 10:34:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 172 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-30 10:34:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2025-04-30 10:34:26,855 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 31 [2025-04-30 10:34:26,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:26,855 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2025-04-30 10:34:26,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 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-30 10:34:26,855 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2025-04-30 10:34:26,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:34:26,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:26,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:26,861 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-30 10:34:27,056 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,SelfDestructingSolverStorable30 [2025-04-30 10:34:27,056 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:27,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 546516602, now seen corresponding path program 2 times [2025-04-30 10:34:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:27,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698617730] [2025-04-30 10:34:27,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:27,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:34:27,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:27,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:27,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:27,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698617730] [2025-04-30 10:34:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698617730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:27,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524581610] [2025-04-30 10:34:27,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:27,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:27,480 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-30 10:34:27,481 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-30 10:34:27,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:34:27,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:27,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:34:27,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:27,687 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 17 treesize of output 13 [2025-04-30 10:34:29,041 INFO L325 Elim1Store]: treesize reduction 15, result has 51.6 percent of original size [2025-04-30 10:34:29,042 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 41 treesize of output 30 [2025-04-30 10:34:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 14 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:29,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:29,386 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 53 treesize of output 47 [2025-04-30 10:34:29,390 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:29,390 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 56 treesize of output 46 [2025-04-30 10:34:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524581610] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:29,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2025-04-30 10:34:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357374876] [2025-04-30 10:34:29,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:29,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-30 10:34:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:29,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-30 10:34:29,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1950, Unknown=3, NotChecked=0, Total=2162 [2025-04-30 10:34:29,651 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand has 47 states, 47 states have (on average 1.702127659574468) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-30 10:34:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:30,393 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2025-04-30 10:34:30,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:34:30,394 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.702127659574468) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 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 34 [2025-04-30 10:34:30,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:30,394 INFO L225 Difference]: With dead ends: 236 [2025-04-30 10:34:30,395 INFO L226 Difference]: Without dead ends: 223 [2025-04-30 10:34:30,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=434, Invalid=3723, Unknown=3, NotChecked=0, Total=4160 [2025-04-30 10:34:30,396 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 189 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:30,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 347 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-30 10:34:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 186. [2025-04-30 10:34:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 182 states have (on average 1.1593406593406594) internal successors, (211), 185 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-30 10:34:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2025-04-30 10:34:30,400 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 34 [2025-04-30 10:34:30,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:30,400 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2025-04-30 10:34:30,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.702127659574468) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-30 10:34:30,400 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2025-04-30 10:34:30,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:34:30,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:30,401 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:30,407 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-30 10:34:30,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:30,601 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:30,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2145403559, now seen corresponding path program 2 times [2025-04-30 10:34:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:30,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270176518] [2025-04-30 10:34:30,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:30,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-30 10:34:30,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:34:30,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:30,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:30,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270176518] [2025-04-30 10:34:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270176518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:30,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596855923] [2025-04-30 10:34:30,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:30,811 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-30 10:34:30,811 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-30 10:34:30,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-30 10:34:30,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:34:30,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:30,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:30,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:34:30,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:30,928 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-30 10:34:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:30,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:31,003 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-30 10:34:31,005 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-30 10:34:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596855923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:31,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2025-04-30 10:34:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904535170] [2025-04-30 10:34:31,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:31,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:34:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:31,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:34:31,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:31,036 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:31,299 INFO L93 Difference]: Finished difference Result 314 states and 346 transitions. [2025-04-30 10:34:31,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:31,299 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-30 10:34:31,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:31,300 INFO L225 Difference]: With dead ends: 314 [2025-04-30 10:34:31,300 INFO L226 Difference]: Without dead ends: 244 [2025-04-30 10:34:31,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:34:31,300 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:31,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 246 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-30 10:34:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 209. [2025-04-30 10:34:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 208 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-30 10:34:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2025-04-30 10:34:31,304 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 35 [2025-04-30 10:34:31,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:31,304 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2025-04-30 10:34:31,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:31,304 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2025-04-30 10:34:31,305 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:34:31,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:31,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:31,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:31,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:31,510 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:31,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash 824656350, now seen corresponding path program 4 times [2025-04-30 10:34:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:31,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941675702] [2025-04-30 10:34:31,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:31,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-30 10:34:31,523 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:34:31,523 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:31,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:31,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941675702] [2025-04-30 10:34:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941675702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:31,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553237822] [2025-04-30 10:34:31,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:31,955 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-30 10:34:31,955 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-30 10:34:32,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-30 10:34:32,031 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:34:32,031 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:32,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:32,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:34:32,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:32,179 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-30 10:34:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:32,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:32,315 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 18 treesize of output 16 [2025-04-30 10:34:32,316 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-30 10:34:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553237822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:32,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2025-04-30 10:34:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447120629] [2025-04-30 10:34:32,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:32,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:34:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:32,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:34:32,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1454, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:32,469 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-30 10:34:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:33,710 INFO L93 Difference]: Finished difference Result 451 states and 502 transitions. [2025-04-30 10:34:33,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-30 10:34:33,710 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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 37 [2025-04-30 10:34:33,710 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:33,711 INFO L225 Difference]: With dead ends: 451 [2025-04-30 10:34:33,711 INFO L226 Difference]: Without dead ends: 402 [2025-04-30 10:34:33,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=336, Invalid=4776, Unknown=0, NotChecked=0, Total=5112 [2025-04-30 10:34:33,713 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 199 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:33,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1061 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-30 10:34:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 273. [2025-04-30 10:34:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.1449814126394051) internal successors, (308), 272 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-30 10:34:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 308 transitions. [2025-04-30 10:34:33,717 INFO L79 Accepts]: Start accepts. Automaton has 273 states and 308 transitions. Word has length 37 [2025-04-30 10:34:33,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:33,717 INFO L485 AbstractCegarLoop]: Abstraction has 273 states and 308 transitions. [2025-04-30 10:34:33,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-30 10:34:33,717 INFO L278 IsEmpty]: Start isEmpty. Operand 273 states and 308 transitions. [2025-04-30 10:34:33,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:34:33,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:33,718 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:33,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:34:33,918 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,SelfDestructingSolverStorable33 [2025-04-30 10:34:33,918 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:33,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1821588476, now seen corresponding path program 5 times [2025-04-30 10:34:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:33,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037839667] [2025-04-30 10:34:33,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:33,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 6 equivalence classes. [2025-04-30 10:34:33,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:33,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-30 10:34:33,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:34,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037839667] [2025-04-30 10:34:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037839667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:34,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89517916] [2025-04-30 10:34:34,144 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:34,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:34,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:34,147 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-30 10:34:34,148 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-30 10:34:34,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 6 equivalence classes. [2025-04-30 10:34:34,236 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:34,236 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-30 10:34:34,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:34,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:34:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:34,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:34,601 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-30 10:34:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:34,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89517916] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:34,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2025-04-30 10:34:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470564997] [2025-04-30 10:34:34,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:34,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:34:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:34,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:34:34,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:34,705 INFO L87 Difference]: Start difference. First operand 273 states and 308 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-30 10:34:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:35,135 INFO L93 Difference]: Finished difference Result 434 states and 485 transitions. [2025-04-30 10:34:35,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:34:35,135 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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 40 [2025-04-30 10:34:35,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:35,136 INFO L225 Difference]: With dead ends: 434 [2025-04-30 10:34:35,136 INFO L226 Difference]: Without dead ends: 420 [2025-04-30 10:34:35,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:34:35,137 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 139 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:35,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 523 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-04-30 10:34:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 240. [2025-04-30 10:34:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.1440677966101696) internal successors, (270), 239 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-30 10:34:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2025-04-30 10:34:35,140 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 40 [2025-04-30 10:34:35,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:35,141 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2025-04-30 10:34:35,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-30 10:34:35,141 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2025-04-30 10:34:35,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:34:35,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:35,141 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:35,152 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-30 10:34:35,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:35,342 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:35,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash -269972965, now seen corresponding path program 3 times [2025-04-30 10:34:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:35,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026111005] [2025-04-30 10:34:35,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:35,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-04-30 10:34:35,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:35,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:35,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:36,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026111005] [2025-04-30 10:34:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026111005] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:36,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554851853] [2025-04-30 10:34:36,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:36,072 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-30 10:34:36,073 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-30 10:34:36,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-04-30 10:34:36,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:34:36,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:36,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:36,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-30 10:34:36,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:36,332 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 17 treesize of output 13 [2025-04-30 10:34:38,638 INFO L325 Elim1Store]: treesize reduction 19, result has 53.7 percent of original size [2025-04-30 10:34:38,638 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 51 treesize of output 40 [2025-04-30 10:34:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 25 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:38,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:39,754 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 71 treesize of output 63 [2025-04-30 10:34:39,759 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:39,760 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 75 treesize of output 61 [2025-04-30 10:34:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554851853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:40,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 56 [2025-04-30 10:34:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229583791] [2025-04-30 10:34:40,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:40,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-30 10:34:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:40,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-30 10:34:40,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2781, Unknown=5, NotChecked=0, Total=3080 [2025-04-30 10:34:40,102 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand has 56 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-30 10:34:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:41,851 INFO L93 Difference]: Finished difference Result 336 states and 372 transitions. [2025-04-30 10:34:41,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:41,851 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 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-30 10:34:41,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:41,852 INFO L225 Difference]: With dead ends: 336 [2025-04-30 10:34:41,852 INFO L226 Difference]: Without dead ends: 305 [2025-04-30 10:34:41,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=639, Invalid=5675, Unknown=6, NotChecked=0, Total=6320 [2025-04-30 10:34:41,853 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 175 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:41,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 424 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-04-30 10:34:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2025-04-30 10:34:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 252 states have (on average 1.1468253968253967) internal successors, (289), 255 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-30 10:34:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 289 transitions. [2025-04-30 10:34:41,857 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 289 transitions. Word has length 40 [2025-04-30 10:34:41,857 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:41,857 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 289 transitions. [2025-04-30 10:34:41,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 56 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-30 10:34:41,857 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 289 transitions. [2025-04-30 10:34:41,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:34:41,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:41,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:41,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:34:42,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:42,058 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:42,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1943576523, now seen corresponding path program 3 times [2025-04-30 10:34:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:42,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040089118] [2025-04-30 10:34:42,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:42,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-30 10:34:42,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 41 statements. [2025-04-30 10:34:42,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:42,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:42,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040089118] [2025-04-30 10:34:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040089118] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:42,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169514066] [2025-04-30 10:34:42,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:42,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:42,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:42,307 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-30 10:34:42,307 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-30 10:34:42,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-30 10:34:42,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 41 statements. [2025-04-30 10:34:42,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:42,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:34:42,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:42,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:42,635 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-30 10:34:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:34:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169514066] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:42,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-04-30 10:34:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544725243] [2025-04-30 10:34:42,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:42,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:34:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:42,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:34:42,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:34:42,718 INFO L87 Difference]: Start difference. First operand 256 states and 289 transitions. Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:42,923 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2025-04-30 10:34:42,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:34:42,923 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-30 10:34:42,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:42,924 INFO L225 Difference]: With dead ends: 306 [2025-04-30 10:34:42,924 INFO L226 Difference]: Without dead ends: 306 [2025-04-30 10:34:42,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:34:42,925 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:42,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 347 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-30 10:34:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 272. [2025-04-30 10:34:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.1417910447761195) internal successors, (306), 271 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-30 10:34:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 306 transitions. [2025-04-30 10:34:42,928 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 306 transitions. Word has length 41 [2025-04-30 10:34:42,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:42,928 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 306 transitions. [2025-04-30 10:34:42,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:42,928 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 306 transitions. [2025-04-30 10:34:42,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:34:42,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:42,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:42,935 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-30 10:34:43,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:43,129 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:43,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 30507647, now seen corresponding path program 6 times [2025-04-30 10:34:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:43,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653781225] [2025-04-30 10:34:43,129 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:43,137 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 6 equivalence classes. [2025-04-30 10:34:43,153 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:34:43,153 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-30 10:34:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:43,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653781225] [2025-04-30 10:34:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653781225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:43,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46800403] [2025-04-30 10:34:43,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:43,515 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-30 10:34:43,515 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-30 10:34:43,576 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 6 equivalence classes. [2025-04-30 10:34:43,603 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:34:43,603 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-30 10:34:43,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:43,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:34:43,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:43,749 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-30 10:34:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:43,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:43,903 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 18 treesize of output 16 [2025-04-30 10:34:43,904 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-30 10:34:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46800403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:44,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 43 [2025-04-30 10:34:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196063303] [2025-04-30 10:34:44,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:44,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:34:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:44,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:34:44,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:34:44,059 INFO L87 Difference]: Start difference. First operand 272 states and 306 transitions. Second operand has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-30 10:34:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:45,351 INFO L93 Difference]: Finished difference Result 483 states and 530 transitions. [2025-04-30 10:34:45,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-30 10:34:45,351 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 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-30 10:34:45,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:45,352 INFO L225 Difference]: With dead ends: 483 [2025-04-30 10:34:45,352 INFO L226 Difference]: Without dead ends: 425 [2025-04-30 10:34:45,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=5699, Unknown=0, NotChecked=0, Total=6162 [2025-04-30 10:34:45,353 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 237 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:45,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1066 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-30 10:34:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 308. [2025-04-30 10:34:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 304 states have (on average 1.131578947368421) internal successors, (344), 307 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-30 10:34:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 344 transitions. [2025-04-30 10:34:45,357 INFO L79 Accepts]: Start accepts. Automaton has 308 states and 344 transitions. Word has length 43 [2025-04-30 10:34:45,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:45,357 INFO L485 AbstractCegarLoop]: Abstraction has 308 states and 344 transitions. [2025-04-30 10:34:45,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 43 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-30 10:34:45,358 INFO L278 IsEmpty]: Start isEmpty. Operand 308 states and 344 transitions. [2025-04-30 10:34:45,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:34:45,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:45,358 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:45,364 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-30 10:34:45,558 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,SelfDestructingSolverStorable37 [2025-04-30 10:34:45,559 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:45,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1431604390, now seen corresponding path program 4 times [2025-04-30 10:34:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:45,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918854459] [2025-04-30 10:34:45,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:45,565 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:34:45,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:45,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:45,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:46,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918854459] [2025-04-30 10:34:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918854459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:46,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742601507] [2025-04-30 10:34:46,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:46,292 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-30 10:34:46,293 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-30 10:34:46,364 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:34:46,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:46,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:46,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-04-30 10:34:46,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:46,569 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 17 treesize of output 13 [2025-04-30 10:34:47,327 INFO L325 Elim1Store]: treesize reduction 23, result has 54.9 percent of original size [2025-04-30 10:34:47,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 50 [2025-04-30 10:34:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:47,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:47,622 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 89 treesize of output 79 [2025-04-30 10:34:47,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 76 [2025-04-30 10:34:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742601507] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:47,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 63 [2025-04-30 10:34:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697818285] [2025-04-30 10:34:47,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:47,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-30 10:34:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:47,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-30 10:34:47,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=3529, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:34:47,968 INFO L87 Difference]: Start difference. First operand 308 states and 344 transitions. Second operand has 63 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 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-30 10:34:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:49,121 INFO L93 Difference]: Finished difference Result 439 states and 484 transitions. [2025-04-30 10:34:49,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:49,121 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 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 46 [2025-04-30 10:34:49,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:49,122 INFO L225 Difference]: With dead ends: 439 [2025-04-30 10:34:49,122 INFO L226 Difference]: Without dead ends: 402 [2025-04-30 10:34:49,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=663, Invalid=6647, Unknown=0, NotChecked=0, Total=7310 [2025-04-30 10:34:49,123 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 133 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:49,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 434 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-30 10:34:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 324. [2025-04-30 10:34:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 320 states have (on average 1.134375) internal successors, (363), 323 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-30 10:34:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2025-04-30 10:34:49,126 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 46 [2025-04-30 10:34:49,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:49,126 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2025-04-30 10:34:49,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 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-30 10:34:49,126 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2025-04-30 10:34:49,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:34:49,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:49,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:49,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-30 10:34:49,327 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,SelfDestructingSolverStorable38 [2025-04-30 10:34:49,327 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:49,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1513707063, now seen corresponding path program 1 times [2025-04-30 10:34:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:49,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726459059] [2025-04-30 10:34:49,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:49,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:34:49,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:49,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:49,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:34:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:49,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726459059] [2025-04-30 10:34:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726459059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:49,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207038003] [2025-04-30 10:34:49,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:49,472 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-30 10:34:49,474 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-30 10:34:49,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:34:49,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:49,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:49,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:34:49,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:34:49,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:34:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207038003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:49,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-04-30 10:34:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467193676] [2025-04-30 10:34:49,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:49,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:34:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:49,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:34:49,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:34:49,888 INFO L87 Difference]: Start difference. First operand 324 states and 363 transitions. Second operand has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 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-30 10:34:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:50,127 INFO L93 Difference]: Finished difference Result 433 states and 475 transitions. [2025-04-30 10:34:50,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:34:50,128 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 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 46 [2025-04-30 10:34:50,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:50,133 INFO L225 Difference]: With dead ends: 433 [2025-04-30 10:34:50,133 INFO L226 Difference]: Without dead ends: 433 [2025-04-30 10:34:50,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:34:50,133 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 79 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:50,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 308 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-04-30 10:34:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 383. [2025-04-30 10:34:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 379 states have (on average 1.129287598944591) internal successors, (428), 382 states have internal predecessors, (428), 0 states have call successors, (0), 0 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-30 10:34:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 428 transitions. [2025-04-30 10:34:50,137 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 428 transitions. Word has length 46 [2025-04-30 10:34:50,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:50,137 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 428 transitions. [2025-04-30 10:34:50,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 30 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-30 10:34:50,138 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 428 transitions. [2025-04-30 10:34:50,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:34:50,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:50,138 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:50,148 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-30 10:34:50,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-30 10:34:50,339 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:50,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -517736885, now seen corresponding path program 4 times [2025-04-30 10:34:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:50,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492670485] [2025-04-30 10:34:50,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:50,345 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:34:50,351 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:50,351 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:34:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:50,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492670485] [2025-04-30 10:34:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492670485] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:50,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026423291] [2025-04-30 10:34:50,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:50,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:50,474 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-30 10:34:50,475 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-30 10:34:50,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:34:50,602 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:34:50,602 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:34:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:50,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-30 10:34:50,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:50,707 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-30 10:34:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:50,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:50,899 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-30 10:34:50,900 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-30 10:34:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026423291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:51,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 39 [2025-04-30 10:34:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081003221] [2025-04-30 10:34:51,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:51,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-30 10:34:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:51,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-30 10:34:51,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:34:51,061 INFO L87 Difference]: Start difference. First operand 383 states and 428 transitions. Second operand has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-30 10:34:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:51,594 INFO L93 Difference]: Finished difference Result 392 states and 431 transitions. [2025-04-30 10:34:51,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:34:51,594 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 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 46 [2025-04-30 10:34:51,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:51,595 INFO L225 Difference]: With dead ends: 392 [2025-04-30 10:34:51,595 INFO L226 Difference]: Without dead ends: 358 [2025-04-30 10:34:51,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=3150, Unknown=0, NotChecked=0, Total=3540 [2025-04-30 10:34:51,596 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:51,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 434 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-30 10:34:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 313. [2025-04-30 10:34:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.132686084142395) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 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-30 10:34:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 350 transitions. [2025-04-30 10:34:51,599 INFO L79 Accepts]: Start accepts. Automaton has 313 states and 350 transitions. Word has length 46 [2025-04-30 10:34:51,599 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:51,599 INFO L485 AbstractCegarLoop]: Abstraction has 313 states and 350 transitions. [2025-04-30 10:34:51,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-30 10:34:51,599 INFO L278 IsEmpty]: Start isEmpty. Operand 313 states and 350 transitions. [2025-04-30 10:34:51,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:34:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:51,600 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:51,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:51,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:51,800 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:51,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1642696894, now seen corresponding path program 7 times [2025-04-30 10:34:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:51,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981679218] [2025-04-30 10:34:51,801 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:34:51,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:51,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:51,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:52,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981679218] [2025-04-30 10:34:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981679218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:52,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292992533] [2025-04-30 10:34:52,299 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:52,300 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-30 10:34:52,301 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-30 10:34:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:34:52,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:52,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:52,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:34:52,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:52,587 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-30 10:34:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:52,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:52,781 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 18 treesize of output 16 [2025-04-30 10:34:52,782 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-30 10:34:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292992533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:52,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 49 [2025-04-30 10:34:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556999079] [2025-04-30 10:34:52,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:52,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-30 10:34:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:52,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-30 10:34:52,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2215, Unknown=0, NotChecked=0, Total=2352 [2025-04-30 10:34:52,997 INFO L87 Difference]: Start difference. First operand 313 states and 350 transitions. Second operand has 49 states, 49 states have (on average 2.36734693877551) internal successors, (116), 49 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-30 10:34:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:55,028 INFO L93 Difference]: Finished difference Result 553 states and 603 transitions. [2025-04-30 10:34:55,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-30 10:34:55,029 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.36734693877551) internal successors, (116), 49 states have internal predecessors, (116), 0 states have call successors, (0), 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-30 10:34:55,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:55,030 INFO L225 Difference]: With dead ends: 553 [2025-04-30 10:34:55,030 INFO L226 Difference]: Without dead ends: 489 [2025-04-30 10:34:55,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=602, Invalid=8328, Unknown=0, NotChecked=0, Total=8930 [2025-04-30 10:34:55,030 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 224 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:55,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1433 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:34:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-30 10:34:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 349. [2025-04-30 10:34:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 345 states have (on average 1.1246376811594203) internal successors, (388), 348 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-30 10:34:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 388 transitions. [2025-04-30 10:34:55,034 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 388 transitions. Word has length 49 [2025-04-30 10:34:55,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:55,034 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 388 transitions. [2025-04-30 10:34:55,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.36734693877551) internal successors, (116), 49 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-30 10:34:55,034 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 388 transitions. [2025-04-30 10:34:55,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:34:55,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:55,035 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:55,041 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-30 10:34:55,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:55,235 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:55,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1980749421, now seen corresponding path program 5 times [2025-04-30 10:34:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:55,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281583175] [2025-04-30 10:34:55,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:55,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 5 equivalence classes. [2025-04-30 10:34:55,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:55,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:34:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:55,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281583175] [2025-04-30 10:34:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281583175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:55,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435654206] [2025-04-30 10:34:55,431 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:55,432 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-30 10:34:55,433 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-30 10:34:55,509 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 5 equivalence classes. [2025-04-30 10:34:55,548 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:34:55,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:34:55,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:55,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:34:55,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:55,555 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 1 [2025-04-30 10:34:55,606 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-30 10:34:55,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:55,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:34:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:34:55,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:56,141 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-30 10:34:56,143 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-30 10:34:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:34:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435654206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:56,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-30 10:34:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480372741] [2025-04-30 10:34:56,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:56,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:34:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:56,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:34:56,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:34:56,324 INFO L87 Difference]: Start difference. First operand 349 states and 388 transitions. Second operand has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 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-30 10:34:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:57,399 INFO L93 Difference]: Finished difference Result 512 states and 549 transitions. [2025-04-30 10:34:57,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-30 10:34:57,399 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 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 49 [2025-04-30 10:34:57,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:57,400 INFO L225 Difference]: With dead ends: 512 [2025-04-30 10:34:57,400 INFO L226 Difference]: Without dead ends: 482 [2025-04-30 10:34:57,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=560, Invalid=5292, Unknown=0, NotChecked=0, Total=5852 [2025-04-30 10:34:57,401 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 121 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:57,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 348 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-04-30 10:34:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 386. [2025-04-30 10:34:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 382 states have (on average 1.1151832460732984) internal successors, (426), 385 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-30 10:34:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 426 transitions. [2025-04-30 10:34:57,405 INFO L79 Accepts]: Start accepts. Automaton has 386 states and 426 transitions. Word has length 49 [2025-04-30 10:34:57,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:57,405 INFO L485 AbstractCegarLoop]: Abstraction has 386 states and 426 transitions. [2025-04-30 10:34:57,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 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-30 10:34:57,405 INFO L278 IsEmpty]: Start isEmpty. Operand 386 states and 426 transitions. [2025-04-30 10:34:57,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:34:57,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:57,405 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:57,412 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-30 10:34:57,605 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,SelfDestructingSolverStorable42 [2025-04-30 10:34:57,606 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-04-30 10:34:57,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1630002629, now seen corresponding path program 5 times [2025-04-30 10:34:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:57,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279645943] [2025-04-30 10:34:57,606 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:57,613 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 8 equivalence classes. [2025-04-30 10:34:57,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:34:57,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-30 10:34:57,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 43 proven. 76 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:58,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279645943] [2025-04-30 10:34:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279645943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:58,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099735023] [2025-04-30 10:34:58,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:58,797 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-30 10:34:58,797 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-30 10:34:58,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 8 equivalence classes. [2025-04-30 10:34:58,907 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:34:58,907 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-30 10:34:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:58,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-30 10:34:58,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:59,180 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 17 treesize of output 13 [2025-04-30 10:35:11,632 INFO L325 Elim1Store]: treesize reduction 27, result has 55.7 percent of original size [2025-04-30 10:35:11,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 71 treesize of output 60 [2025-04-30 10:35:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 61 proven. 56 refuted. 2 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:35:11,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:12,537 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 107 treesize of output 95 [2025-04-30 10:35:12,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:12,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 91 [2025-04-30 10:35:13,155 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-30 10:35:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:35:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099735023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:13,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 75 [2025-04-30 10:35:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628449703] [2025-04-30 10:35:13,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:13,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-04-30 10:35:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:13,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-04-30 10:35:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=5029, Unknown=6, NotChecked=0, Total=5550 [2025-04-30 10:35:13,221 INFO L87 Difference]: Start difference. First operand 386 states and 426 transitions. Second operand has 75 states, 75 states have (on average 1.68) internal successors, (126), 75 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15