./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/heap-manipulation/dancing.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/heap-manipulation/dancing.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697d2b840a0ef597d7e24bd788a50f58f7f85f8bead9cd8ad1077f7ecca438fc --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:47,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:47,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:16:47,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:47,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:48,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:48,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:48,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:48,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:48,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:48,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:48,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:48,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:48,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:48,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:48,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:48,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:48,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:48,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:16:48,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:48,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:48,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:48,015 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 -> 697d2b840a0ef597d7e24bd788a50f58f7f85f8bead9cd8ad1077f7ecca438fc [2025-04-29 11:16:48,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:48,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:48,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:48,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:48,251 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:48,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing.c [2025-04-29 11:16:49,563 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c37fb2e/fd90b276dc304a7fa3780b0bfc8bc880/FLAG6437aa544 [2025-04-29 11:16:49,762 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:49,762 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.c [2025-04-29 11:16:49,763 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:49,764 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:49,770 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c37fb2e/fd90b276dc304a7fa3780b0bfc8bc880/FLAG6437aa544 [2025-04-29 11:16:50,613 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c37fb2e/fd90b276dc304a7fa3780b0bfc8bc880 [2025-04-29 11:16:50,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:50,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:50,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:50,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:50,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:50,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459d909e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50, skipping insertion in model container [2025-04-29 11:16:50,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:50,801 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:50,811 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:50,847 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:50,864 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:50,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50 WrapperNode [2025-04-29 11:16:50,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:50,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:50,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:50,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:50,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,896 INFO L138 Inliner]: procedures = 16, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-04-29 11:16:50,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:50,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:50,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:50,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:50,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,930 INFO L175 MemorySlicer]: Split 21 memory accesses to 1 slices as follows [21]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 9 writes are split as follows [9]. [2025-04-29 11:16:50,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:50,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:50,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:50,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:50,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:50,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:16:50,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:16:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:16:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2025-04-29 11:16:50,993 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:50,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 11:16:50,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 11:16:50,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:16:51,049 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:51,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:51,350 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-04-29 11:16:51,351 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:51,358 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:51,358 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:16:51,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:51 BoogieIcfgContainer [2025-04-29 11:16:51,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:51,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:51,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:51,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:50" (1/3) ... [2025-04-29 11:16:51,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b43b460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:51, skipping insertion in model container [2025-04-29 11:16:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (2/3) ... [2025-04-29 11:16:51,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b43b460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:51, skipping insertion in model container [2025-04-29 11:16:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:51" (3/3) ... [2025-04-29 11:16:51,366 INFO L128 eAbstractionObserver]: Analyzing ICFG dancing.c [2025-04-29 11:16:51,376 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:51,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.c that has 3 procedures, 108 locations, 130 edges, 1 initial locations, 1 loop locations, and 43 error locations. [2025-04-29 11:16:51,404 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:51,412 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;@18fe3674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:51,413 INFO L341 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-04-29 11:16:51,416 INFO L278 IsEmpty]: Start isEmpty. Operand has 108 states, 56 states have (on average 2.0) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:16:51,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:16:51,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:51,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:16:51,420 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:51,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-29 11:16:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:51,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912938104] [2025-04-29 11:16:51,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:16:51,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:16:51,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:51,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:51,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912938104] [2025-04-29 11:16:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912938104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183153973] [2025-04-29 11:16:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:51,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:51,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:51,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,572 INFO L87 Difference]: Start difference. First operand has 108 states, 56 states have (on average 2.0) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:51,689 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-04-29 11:16:51,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:51,691 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-04-29 11:16:51,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:51,695 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:16:51,696 INFO L226 Difference]: Without dead ends: 102 [2025-04-29 11:16:51,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,701 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 80 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:51,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-29 11:16:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-04-29 11:16:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:16:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-04-29 11:16:51,737 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2025-04-29 11:16:51,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:51,737 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-04-29 11:16:51,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:51,738 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-04-29 11:16:51,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:16:51,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:51,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:16:51,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:16:51,740 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:51,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-29 11:16:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:51,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740801700] [2025-04-29 11:16:51,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:51,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:16:51,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:16:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:51,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740801700] [2025-04-29 11:16:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740801700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246993533] [2025-04-29 11:16:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:51,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:51,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,807 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:51,895 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-04-29 11:16:51,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:51,895 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-04-29 11:16:51,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:51,896 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:16:51,896 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:16:51,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,897 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:51,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 89 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:16:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:16:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:16:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-04-29 11:16:51,902 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 3 [2025-04-29 11:16:51,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:51,902 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-04-29 11:16:51,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:51,902 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-04-29 11:16:51,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:16:51,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:51,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:51,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:16:51,902 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:51,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1116790320, now seen corresponding path program 1 times [2025-04-29 11:16:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:51,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982210373] [2025-04-29 11:16:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:16:51,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:16:51,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:51,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:51,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982210373] [2025-04-29 11:16:51,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982210373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:51,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:51,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184895395] [2025-04-29 11:16:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:51,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:51,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:51,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,988 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,073 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-04-29 11:16:52,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:52,075 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:16:52,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,075 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:16:52,075 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:16:52,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:52,076 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 162 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:16:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-04-29 11:16:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:16:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-04-29 11:16:52,087 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 10 [2025-04-29 11:16:52,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,087 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-04-29 11:16:52,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,087 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-04-29 11:16:52,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:16:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:16:52,088 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:52,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1116790321, now seen corresponding path program 1 times [2025-04-29 11:16:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720467389] [2025-04-29 11:16:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:16:52,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:16:52,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720467389] [2025-04-29 11:16:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720467389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855712636] [2025-04-29 11:16:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:52,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:52,195 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,261 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-04-29 11:16:52,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:52,261 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:16:52,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,262 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:16:52,262 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:16:52,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:52,263 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:16:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-04-29 11:16:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.830188679245283) internal successors, (97), 87 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:16:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-04-29 11:16:52,267 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 10 [2025-04-29 11:16:52,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,267 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-04-29 11:16:52,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,268 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-04-29 11:16:52,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:16:52,268 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:16:52,268 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:52,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 267191532, now seen corresponding path program 1 times [2025-04-29 11:16:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438876164] [2025-04-29 11:16:52,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:52,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438876164] [2025-04-29 11:16:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438876164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040698733] [2025-04-29 11:16:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:52,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,375 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,439 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2025-04-29 11:16:52,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:52,440 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:16:52,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,441 INFO L225 Difference]: With dead ends: 172 [2025-04-29 11:16:52,441 INFO L226 Difference]: Without dead ends: 172 [2025-04-29 11:16:52,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:52,441 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 391 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:16:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-29 11:16:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2025-04-29 11:16:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.891304347826087) internal successors, (174), 127 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 11:16:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2025-04-29 11:16:52,454 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 11 [2025-04-29 11:16:52,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,454 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2025-04-29 11:16:52,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,454 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2025-04-29 11:16:52,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:16:52,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:52,455 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:52,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash -506326509, now seen corresponding path program 1 times [2025-04-29 11:16:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342223758] [2025-04-29 11:16:52,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:52,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:52,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342223758] [2025-04-29 11:16:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342223758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522031738] [2025-04-29 11:16:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:52,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,560 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,667 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2025-04-29 11:16:52,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:52,667 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:16:52,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,669 INFO L225 Difference]: With dead ends: 139 [2025-04-29 11:16:52,670 INFO L226 Difference]: Without dead ends: 139 [2025-04-29 11:16:52,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:52,670 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 140 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 112 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-29 11:16:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-04-29 11:16:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.8695652173913044) internal successors, (172), 126 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 11:16:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 192 transitions. [2025-04-29 11:16:52,680 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 192 transitions. Word has length 12 [2025-04-29 11:16:52,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,681 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 192 transitions. [2025-04-29 11:16:52,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,681 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2025-04-29 11:16:52,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:16:52,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:52,681 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:52,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -506326508, now seen corresponding path program 1 times [2025-04-29 11:16:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115010686] [2025-04-29 11:16:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:52,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:52,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115010686] [2025-04-29 11:16:52,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115010686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831349479] [2025-04-29 11:16:52,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:52,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:52,833 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:52,928 INFO L93 Difference]: Finished difference Result 138 states and 190 transitions. [2025-04-29 11:16:52,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:52,929 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:16:52,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:52,930 INFO L225 Difference]: With dead ends: 138 [2025-04-29 11:16:52,930 INFO L226 Difference]: Without dead ends: 138 [2025-04-29 11:16:52,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,931 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 140 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:52,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 101 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-29 11:16:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-04-29 11:16:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.8478260869565217) internal successors, (170), 125 states have internal predecessors, (170), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 11:16:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-04-29 11:16:52,939 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 12 [2025-04-29 11:16:52,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:52,939 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-04-29 11:16:52,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:52,939 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-04-29 11:16:52,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:16:52,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:52,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:52,940 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:52,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 699145402, now seen corresponding path program 1 times [2025-04-29 11:16:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446085405] [2025-04-29 11:16:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:16:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:16:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446085405] [2025-04-29 11:16:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446085405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483578896] [2025-04-29 11:16:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:52,995 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,159 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2025-04-29 11:16:53,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:53,160 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-04-29 11:16:53,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,160 INFO L225 Difference]: With dead ends: 159 [2025-04-29 11:16:53,160 INFO L226 Difference]: Without dead ends: 159 [2025-04-29 11:16:53,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:53,161 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 277 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 163 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-29 11:16:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2025-04-29 11:16:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.7282608695652173) internal successors, (159), 120 states have internal predecessors, (159), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 11:16:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 179 transitions. [2025-04-29 11:16:53,165 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 179 transitions. Word has length 16 [2025-04-29 11:16:53,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,165 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 179 transitions. [2025-04-29 11:16:53,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,166 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 179 transitions. [2025-04-29 11:16:53,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:16:53,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:53,166 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:53,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 699145403, now seen corresponding path program 1 times [2025-04-29 11:16:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807690198] [2025-04-29 11:16:53,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:16:53,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:16:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807690198] [2025-04-29 11:16:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807690198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213104350] [2025-04-29 11:16:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:53,316 INFO L87 Difference]: Start difference. First operand 133 states and 179 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,497 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2025-04-29 11:16:53,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:53,498 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-04-29 11:16:53,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,499 INFO L225 Difference]: With dead ends: 154 [2025-04-29 11:16:53,499 INFO L226 Difference]: Without dead ends: 154 [2025-04-29 11:16:53,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:53,500 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 252 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 176 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-29 11:16:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2025-04-29 11:16:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.6630434782608696) internal successors, (153), 120 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-29 11:16:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2025-04-29 11:16:53,506 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 16 [2025-04-29 11:16:53,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,506 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2025-04-29 11:16:53,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,506 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2025-04-29 11:16:53,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:16:53,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,511 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] [2025-04-29 11:16:53,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:53,513 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:53,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 143215486, now seen corresponding path program 1 times [2025-04-29 11:16:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071261098] [2025-04-29 11:16:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:16:53,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:16:53,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071261098] [2025-04-29 11:16:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071261098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:16:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984985508] [2025-04-29 11:16:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:16:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:16:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:53,780 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:53,961 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2025-04-29 11:16:53,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:53,962 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-04-29 11:16:53,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:53,963 INFO L225 Difference]: With dead ends: 183 [2025-04-29 11:16:53,963 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 11:16:53,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:16:53,963 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 163 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:53,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 414 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 11:16:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 143. [2025-04-29 11:16:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.6237623762376239) internal successors, (164), 129 states have internal predecessors, (164), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-04-29 11:16:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2025-04-29 11:16:53,969 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 20 [2025-04-29 11:16:53,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:53,969 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2025-04-29 11:16:53,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:53,970 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2025-04-29 11:16:53,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:16:53,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:53,970 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] [2025-04-29 11:16:53,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:53,971 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:53,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -678052130, now seen corresponding path program 1 times [2025-04-29 11:16:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213919133] [2025-04-29 11:16:53,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:53,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:53,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:54,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213919133] [2025-04-29 11:16:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213919133] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:54,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954723199] [2025-04-29 11:16:54,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:54,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:54,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:16:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:54,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:54,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:16:54,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:54,205 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:54,206 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 12 treesize of output 11 [2025-04-29 11:16:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954723199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:54,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:16:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681222771] [2025-04-29 11:16:54,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:54,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:54,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:54,220 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:54,367 INFO L93 Difference]: Finished difference Result 157 states and 205 transitions. [2025-04-29 11:16:54,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:54,368 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:16:54,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:54,369 INFO L225 Difference]: With dead ends: 157 [2025-04-29 11:16:54,369 INFO L226 Difference]: Without dead ends: 157 [2025-04-29 11:16:54,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:54,369 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 142 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:54,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 180 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-29 11:16:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2025-04-29 11:16:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 135 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:16:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2025-04-29 11:16:54,379 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 21 [2025-04-29 11:16:54,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:54,380 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2025-04-29 11:16:54,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:54,380 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2025-04-29 11:16:54,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:16:54,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:54,381 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] [2025-04-29 11:16:54,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:16:54,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:16:54,582 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:54,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -678052129, now seen corresponding path program 1 times [2025-04-29 11:16:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:54,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321928510] [2025-04-29 11:16:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:54,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:54,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:54,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321928510] [2025-04-29 11:16:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321928510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:54,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345997127] [2025-04-29 11:16:54,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:54,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:54,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:16:54,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:54,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:54,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:54,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:54,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:16:54,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:54,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:54,986 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:54,986 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 21 treesize of output 25 [2025-04-29 11:16:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:55,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345997127] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:55,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:55,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-04-29 11:16:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736467286] [2025-04-29 11:16:55,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:55,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:16:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:55,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:16:55,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:16:55,068 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:55,330 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2025-04-29 11:16:55,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:55,331 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:16:55,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:55,332 INFO L225 Difference]: With dead ends: 155 [2025-04-29 11:16:55,333 INFO L226 Difference]: Without dead ends: 155 [2025-04-29 11:16:55,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:16:55,334 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 280 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:55,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 250 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:16:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-29 11:16:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2025-04-29 11:16:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.5833333333333333) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:16:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2025-04-29 11:16:55,341 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 21 [2025-04-29 11:16:55,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:55,342 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2025-04-29 11:16:55,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:55,342 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2025-04-29 11:16:55,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:16:55,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:55,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:55,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:16:55,546 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,SelfDestructingSolverStorable11 [2025-04-29 11:16:55,546 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:55,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash 517561760, now seen corresponding path program 1 times [2025-04-29 11:16:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:55,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640465820] [2025-04-29 11:16:55,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:55,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:16:55,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:16:55,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:55,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:55,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640465820] [2025-04-29 11:16:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640465820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:16:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326466985] [2025-04-29 11:16:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:55,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:55,685 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:55,796 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2025-04-29 11:16:55,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:55,796 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-04-29 11:16:55,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:55,797 INFO L225 Difference]: With dead ends: 185 [2025-04-29 11:16:55,797 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:16:55,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:16:55,797 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 78 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:55,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 372 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:16:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2025-04-29 11:16:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.5727272727272728) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:16:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2025-04-29 11:16:55,801 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 22 [2025-04-29 11:16:55,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:55,801 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2025-04-29 11:16:55,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:55,802 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2025-04-29 11:16:55,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:16:55,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:55,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:55,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:16:55,802 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:55,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1490345544, now seen corresponding path program 1 times [2025-04-29 11:16:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:55,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975306844] [2025-04-29 11:16:55,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:55,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:55,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:55,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:56,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975306844] [2025-04-29 11:16:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975306844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:56,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403883712] [2025-04-29 11:16:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:56,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:56,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:16:56,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:56,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:56,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:56,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:56,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:16:56,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:56,138 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 6 treesize of output 5 [2025-04-29 11:16:56,170 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 19 treesize of output 1 [2025-04-29 11:16:56,219 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 21 treesize of output 9 [2025-04-29 11:16:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:56,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-04-29 11:16:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403883712] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:56,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:56,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2025-04-29 11:16:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395950633] [2025-04-29 11:16:56,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:56,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:16:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:56,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:16:56,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:16:56,366 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:57,413 INFO L93 Difference]: Finished difference Result 322 states and 419 transitions. [2025-04-29 11:16:57,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:16:57,413 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:16:57,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:57,415 INFO L225 Difference]: With dead ends: 322 [2025-04-29 11:16:57,415 INFO L226 Difference]: Without dead ends: 322 [2025-04-29 11:16:57,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:16:57,416 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 292 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:57,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1658 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 11:16:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-29 11:16:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2025-04-29 11:16:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 180 states have (on average 1.5611111111111111) internal successors, (281), 209 states have internal predecessors, (281), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 331 transitions. [2025-04-29 11:16:57,426 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 331 transitions. Word has length 27 [2025-04-29 11:16:57,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:57,427 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 331 transitions. [2025-04-29 11:16:57,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:57,427 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 331 transitions. [2025-04-29 11:16:57,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:16:57,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:57,429 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:57,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:57,630 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:57,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash 948161032, now seen corresponding path program 1 times [2025-04-29 11:16:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:57,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5280093] [2025-04-29 11:16:57,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:57,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:57,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:57,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:57,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:57,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:57,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5280093] [2025-04-29 11:16:57,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5280093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:57,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768455611] [2025-04-29 11:16:57,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:57,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:57,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:57,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:16:57,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:57,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:57,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:57,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:57,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:57,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:57,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768455611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:57,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-29 11:16:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719305647] [2025-04-29 11:16:57,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:57,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:16:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:57,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:16:57,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:16:57,913 INFO L87 Difference]: Start difference. First operand 240 states and 331 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:16:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:58,244 INFO L93 Difference]: Finished difference Result 278 states and 360 transitions. [2025-04-29 11:16:58,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:58,245 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2025-04-29 11:16:58,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:58,246 INFO L225 Difference]: With dead ends: 278 [2025-04-29 11:16:58,247 INFO L226 Difference]: Without dead ends: 272 [2025-04-29 11:16:58,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:16:58,248 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 271 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:58,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 573 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:16:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-29 11:16:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2025-04-29 11:16:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 180 states have (on average 1.5444444444444445) internal successors, (278), 209 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 328 transitions. [2025-04-29 11:16:58,255 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 328 transitions. Word has length 26 [2025-04-29 11:16:58,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:58,255 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 328 transitions. [2025-04-29 11:16:58,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:16:58,255 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 328 transitions. [2025-04-29 11:16:58,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:16:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:58,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:58,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:58,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:16:58,458 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:58,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 582133342, now seen corresponding path program 1 times [2025-04-29 11:16:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:58,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18414722] [2025-04-29 11:16:58,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:58,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:58,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:58,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:58,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18414722] [2025-04-29 11:16:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18414722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153159315] [2025-04-29 11:16:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:58,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:58,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:58,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:58,527 INFO L87 Difference]: Start difference. First operand 240 states and 328 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:16:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:58,660 INFO L93 Difference]: Finished difference Result 253 states and 322 transitions. [2025-04-29 11:16:58,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:58,660 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-04-29 11:16:58,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:58,662 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:16:58,662 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:16:58,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:58,663 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 180 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:58,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 198 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:16:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 237. [2025-04-29 11:16:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 206 states have internal predecessors, (267), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 317 transitions. [2025-04-29 11:16:58,672 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 317 transitions. Word has length 28 [2025-04-29 11:16:58,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:58,672 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 317 transitions. [2025-04-29 11:16:58,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:16:58,672 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 317 transitions. [2025-04-29 11:16:58,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:16:58,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:58,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:58,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:16:58,674 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:58,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash 582133343, now seen corresponding path program 1 times [2025-04-29 11:16:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:58,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254908556] [2025-04-29 11:16:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:58,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:58,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:58,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:58,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254908556] [2025-04-29 11:16:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254908556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:58,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755165332] [2025-04-29 11:16:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:58,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:58,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:58,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:58,771 INFO L87 Difference]: Start difference. First operand 237 states and 317 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:16:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:58,921 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2025-04-29 11:16:58,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:58,922 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-04-29 11:16:58,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:58,923 INFO L225 Difference]: With dead ends: 250 [2025-04-29 11:16:58,923 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 11:16:58,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:58,923 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 171 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:58,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 206 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 11:16:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 237. [2025-04-29 11:16:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 180 states have (on average 1.45) internal successors, (261), 206 states have internal predecessors, (261), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 311 transitions. [2025-04-29 11:16:58,929 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 311 transitions. Word has length 28 [2025-04-29 11:16:58,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:58,929 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 311 transitions. [2025-04-29 11:16:58,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:16:58,929 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 311 transitions. [2025-04-29 11:16:58,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:16:58,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:58,930 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:58,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:16:58,930 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:58,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2060382668, now seen corresponding path program 1 times [2025-04-29 11:16:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:58,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120947637] [2025-04-29 11:16:58,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:58,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:58,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:58,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:58,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120947637] [2025-04-29 11:16:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120947637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:58,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:58,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:58,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474251747] [2025-04-29 11:16:58,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:58,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:58,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:58,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:58,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:58,970 INFO L87 Difference]: Start difference. First operand 237 states and 311 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:59,096 INFO L93 Difference]: Finished difference Result 248 states and 314 transitions. [2025-04-29 11:16:59,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:59,096 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-29 11:16:59,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:59,097 INFO L225 Difference]: With dead ends: 248 [2025-04-29 11:16:59,097 INFO L226 Difference]: Without dead ends: 248 [2025-04-29 11:16:59,098 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:59,098 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 70 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:59,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 293 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-29 11:16:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2025-04-29 11:16:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 180 states have (on average 1.4388888888888889) internal successors, (259), 205 states have internal predecessors, (259), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 309 transitions. [2025-04-29 11:16:59,104 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 309 transitions. Word has length 28 [2025-04-29 11:16:59,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:59,104 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 309 transitions. [2025-04-29 11:16:59,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:59,104 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 309 transitions. [2025-04-29 11:16:59,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:16:59,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:59,105 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:59,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:16:59,105 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:59,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2060382667, now seen corresponding path program 1 times [2025-04-29 11:16:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:59,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180165428] [2025-04-29 11:16:59,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:59,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:59,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180165428] [2025-04-29 11:16:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180165428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848567637] [2025-04-29 11:16:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:59,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:59,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:59,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:59,194 INFO L87 Difference]: Start difference. First operand 236 states and 309 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:16:59,332 INFO L93 Difference]: Finished difference Result 243 states and 305 transitions. [2025-04-29 11:16:59,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:59,333 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-29 11:16:59,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:16:59,334 INFO L225 Difference]: With dead ends: 243 [2025-04-29 11:16:59,334 INFO L226 Difference]: Without dead ends: 243 [2025-04-29 11:16:59,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:59,335 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 66 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:16:59,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 311 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:16:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-04-29 11:16:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 230. [2025-04-29 11:16:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 180 states have (on average 1.3888888888888888) internal successors, (250), 199 states have internal predecessors, (250), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2025-04-29 11:16:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 300 transitions. [2025-04-29 11:16:59,345 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 300 transitions. Word has length 28 [2025-04-29 11:16:59,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:16:59,345 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 300 transitions. [2025-04-29 11:16:59,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:16:59,345 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 300 transitions. [2025-04-29 11:16:59,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:16:59,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:16:59,346 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:59,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:16:59,346 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:16:59,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -10396210, now seen corresponding path program 1 times [2025-04-29 11:16:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:59,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395625433] [2025-04-29 11:16:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:59,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:16:59,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:16:59,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:59,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395625433] [2025-04-29 11:16:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395625433] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:59,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626302504] [2025-04-29 11:16:59,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:59,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:59,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:16:59,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:16:59,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:16:59,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:59,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:59,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:16:59,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:59,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:59,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:59,646 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 6 treesize of output 5 [2025-04-29 11:16:59,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:59,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:59,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:59,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:59,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:59,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:59,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:59,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:59,732 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 11:16:59,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-04-29 11:16:59,746 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 11:16:59,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-04-29 11:17:00,119 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 75 treesize of output 63 [2025-04-29 11:17:00,193 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 32 treesize of output 14 [2025-04-29 11:17:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:00,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:00,435 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (forall ((|ULTIMATE.start_main_~n~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_436))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0)) (= (select |c_#valid| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_435))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)) 1)))) (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_435))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2025-04-29 11:17:00,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:00,491 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 211 treesize of output 216 [2025-04-29 11:17:00,618 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (select (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_436) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse4) (= .cse4 0) (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (select (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (select (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_436) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))))) is different from false [2025-04-29 11:17:00,776 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select .cse0 .cse1) (select (store (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1)) (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (store .cse0 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1))))) (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_436) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_436) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (store (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (forall ((v_ArrVal_435 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select .cse2 .cse1))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (store .cse2 (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_435) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1)) (= .cse3 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_27| 1)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_prenex_1) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_27| (select (store .cse4 (+ v_prenex_2 4) |v_ULTIMATE.start_main_~n~0#1.base_27|) .cse1)) (= (select .cse4 .cse1) 0)))))))) is different from false [2025-04-29 11:17:00,802 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:17:00,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2025-04-29 11:17:00,806 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 65 [2025-04-29 11:17:00,812 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 23 treesize of output 15 [2025-04-29 11:17:00,818 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 11:17:00,824 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 11:17:00,824 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 1 [2025-04-29 11:17:00,828 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 11:17:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 11:17:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626302504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:00,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2025-04-29 11:17:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41942260] [2025-04-29 11:17:00,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:00,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:17:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:00,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:17:00,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=525, Unknown=3, NotChecked=144, Total=756 [2025-04-29 11:17:00,848 INFO L87 Difference]: Start difference. First operand 230 states and 300 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:17:11,339 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:12,024 INFO L93 Difference]: Finished difference Result 434 states and 534 transitions. [2025-04-29 11:17:12,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:17:12,025 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-04-29 11:17:12,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:12,026 INFO L225 Difference]: With dead ends: 434 [2025-04-29 11:17:12,026 INFO L226 Difference]: Without dead ends: 434 [2025-04-29 11:17:12,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=472, Invalid=1792, Unknown=4, NotChecked=282, Total=2550 [2025-04-29 11:17:12,028 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 896 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 119 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1172 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:12,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1054 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1135 Invalid, 1 Unknown, 1172 Unchecked, 5.6s Time] [2025-04-29 11:17:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-04-29 11:17:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 331. [2025-04-29 11:17:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 284 states have internal predecessors, (353), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 32 states have call predecessors, (39), 39 states have call successors, (39) [2025-04-29 11:17:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 431 transitions. [2025-04-29 11:17:12,036 INFO L79 Accepts]: Start accepts. Automaton has 331 states and 431 transitions. Word has length 30 [2025-04-29 11:17:12,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:12,036 INFO L485 AbstractCegarLoop]: Abstraction has 331 states and 431 transitions. [2025-04-29 11:17:12,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:17:12,037 INFO L278 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2025-04-29 11:17:12,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:17:12,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:12,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:12,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:17:12,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:12,238 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:12,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -10396209, now seen corresponding path program 1 times [2025-04-29 11:17:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:12,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052006687] [2025-04-29 11:17:12,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:12,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:12,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:12,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:12,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:12,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052006687] [2025-04-29 11:17:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052006687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:12,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952875177] [2025-04-29 11:17:12,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:12,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:12,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:12,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:17:12,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:17:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:17:12,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:12,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:12,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:17:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:13,003 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-29 11:17:13,038 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 19 treesize of output 1 [2025-04-29 11:17:13,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:17:13,164 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 21 treesize of output 9 [2025-04-29 11:17:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:13,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:13,250 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 70 treesize of output 64 [2025-04-29 11:17:13,253 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 94 treesize of output 82 [2025-04-29 11:17:13,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:13,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:17:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952875177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:13,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 6] total 25 [2025-04-29 11:17:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525041359] [2025-04-29 11:17:13,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:13,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:17:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:13,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:17:13,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:17:13,321 INFO L87 Difference]: Start difference. First operand 331 states and 431 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:17:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:14,661 INFO L93 Difference]: Finished difference Result 474 states and 590 transitions. [2025-04-29 11:17:14,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:17:14,661 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-04-29 11:17:14,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:14,663 INFO L225 Difference]: With dead ends: 474 [2025-04-29 11:17:14,663 INFO L226 Difference]: Without dead ends: 474 [2025-04-29 11:17:14,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:17:14,664 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 894 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:14,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1058 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 11:17:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-04-29 11:17:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 390. [2025-04-29 11:17:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 308 states have (on average 1.3376623376623376) internal successors, (412), 332 states have internal predecessors, (412), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 39 states have call predecessors, (48), 48 states have call successors, (48) [2025-04-29 11:17:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 508 transitions. [2025-04-29 11:17:14,674 INFO L79 Accepts]: Start accepts. Automaton has 390 states and 508 transitions. Word has length 30 [2025-04-29 11:17:14,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:14,674 INFO L485 AbstractCegarLoop]: Abstraction has 390 states and 508 transitions. [2025-04-29 11:17:14,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:17:14,674 INFO L278 IsEmpty]: Start isEmpty. Operand 390 states and 508 transitions. [2025-04-29 11:17:14,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:17:14,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:14,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:14,681 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-29 11:17:14,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:14,876 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:14,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -743473230, now seen corresponding path program 1 times [2025-04-29 11:17:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:14,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474686932] [2025-04-29 11:17:14,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:14,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:17:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:17:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:15,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:15,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474686932] [2025-04-29 11:17:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474686932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:17:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132174959] [2025-04-29 11:17:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:15,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:17:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:15,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:17:15,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:17:15,037 INFO L87 Difference]: Start difference. First operand 390 states and 508 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:17:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:15,186 INFO L93 Difference]: Finished difference Result 411 states and 534 transitions. [2025-04-29 11:17:15,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:17:15,187 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-04-29 11:17:15,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:15,188 INFO L225 Difference]: With dead ends: 411 [2025-04-29 11:17:15,188 INFO L226 Difference]: Without dead ends: 411 [2025-04-29 11:17:15,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:17:15,190 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 87 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:15,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 394 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:17:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-29 11:17:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 398. [2025-04-29 11:17:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 314 states have (on average 1.3312101910828025) internal successors, (418), 338 states have internal predecessors, (418), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 41 states have call predecessors, (50), 50 states have call successors, (50) [2025-04-29 11:17:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 518 transitions. [2025-04-29 11:17:15,201 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 518 transitions. Word has length 31 [2025-04-29 11:17:15,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:15,201 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 518 transitions. [2025-04-29 11:17:15,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:17:15,201 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 518 transitions. [2025-04-29 11:17:15,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:17:15,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:15,202 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:15,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:17:15,202 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:15,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1290072056, now seen corresponding path program 1 times [2025-04-29 11:17:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:15,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17899456] [2025-04-29 11:17:15,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:15,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:17:15,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:17:15,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:15,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:17:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:15,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17899456] [2025-04-29 11:17:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17899456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:17:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:17:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:17:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580067777] [2025-04-29 11:17:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:17:15,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:17:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:15,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:17:15,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:17:15,278 INFO L87 Difference]: Start difference. First operand 398 states and 518 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:17:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:17:15,290 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2025-04-29 11:17:15,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:17:15,290 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-04-29 11:17:15,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:17:15,292 INFO L225 Difference]: With dead ends: 420 [2025-04-29 11:17:15,292 INFO L226 Difference]: Without dead ends: 412 [2025-04-29 11:17:15,292 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-29 11:17:15,292 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:17:15,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:17:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-29 11:17:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 406. [2025-04-29 11:17:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 318 states have (on average 1.3270440251572326) internal successors, (422), 346 states have internal predecessors, (422), 50 states have call successors, (50), 18 states have call predecessors, (50), 22 states have return successors, (58), 41 states have call predecessors, (58), 50 states have call successors, (58) [2025-04-29 11:17:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 530 transitions. [2025-04-29 11:17:15,308 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 530 transitions. Word has length 32 [2025-04-29 11:17:15,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:17:15,308 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 530 transitions. [2025-04-29 11:17:15,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:17:15,308 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2025-04-29 11:17:15,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:17:15,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:17:15,309 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:17:15,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:17:15,309 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:17:15,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:17:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1074390032, now seen corresponding path program 1 times [2025-04-29 11:17:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:17:15,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080116182] [2025-04-29 11:17:15,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:17:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:17:15,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:17:15,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:15,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:17:15,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080116182] [2025-04-29 11:17:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080116182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:17:15,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026006981] [2025-04-29 11:17:15,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:17:15,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:17:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:17:15,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:17:15,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:17:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:17:15,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:17:15,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:17:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:17:15,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:17:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:17:15,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:17:15,915 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 20 treesize of output 8 [2025-04-29 11:17:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:15,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:17:15,984 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 32 treesize of output 26 [2025-04-29 11:17:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:17:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026006981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:17:16,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:17:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 17 [2025-04-29 11:17:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859520910] [2025-04-29 11:17:16,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:17:16,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:17:16,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:17:16,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:17:16,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:17:16,013 INFO L87 Difference]: Start difference. First operand 406 states and 530 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:17:20,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:24,034 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:28,058 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:32,088 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:36,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:40,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:44,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:48,262 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:52,367 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:17:56,382 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15