./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d3cce94ffabfa8eb2319567467a3939f8beda53c0e9f767c0ac9dd6ba326551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:37:22,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:37:22,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:37:22,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:37:22,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:37:22,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:37:22,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:37:22,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:37:22,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:37:22,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:37:22,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:37:22,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:37:22,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:37:22,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:37:22,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:37:22,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:37:22,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:22,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:37:22,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:37:22,674 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 ! call(reach_error())) ) 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 -> 4d3cce94ffabfa8eb2319567467a3939f8beda53c0e9f767c0ac9dd6ba326551 [2025-03-04 00:37:22,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:37:22,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:37:22,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:37:22,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:37:22,916 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:37:22,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i [2025-03-04 00:37:24,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e17b980/dc1c6379bb0146b9b82c73faf7a1a076/FLAGa196b1a4a [2025-03-04 00:37:24,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:37:24,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i [2025-03-04 00:37:24,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e17b980/dc1c6379bb0146b9b82c73faf7a1a076/FLAGa196b1a4a [2025-03-04 00:37:24,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e17b980/dc1c6379bb0146b9b82c73faf7a1a076 [2025-03-04 00:37:24,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:37:24,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:37:24,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:24,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:37:24,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:37:24,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:24" (1/1) ... [2025-03-04 00:37:24,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b43f260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:24, skipping insertion in model container [2025-03-04 00:37:24,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:24" (1/1) ... [2025-03-04 00:37:24,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:37:24,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i[916,929] [2025-03-04 00:37:24,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:24,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:37:24,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-87.i[916,929] [2025-03-04 00:37:25,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:25,026 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:37:25,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25 WrapperNode [2025-03-04 00:37:25,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:25,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:25,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:37:25,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:37:25,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,138 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 714 [2025-03-04 00:37:25,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:25,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:37:25,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:37:25,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:37:25,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,257 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:37:25,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:37:25,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:37:25,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:37:25,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:37:25,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (1/1) ... [2025-03-04 00:37:25,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:25,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:37:25,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:37:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:37:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:37:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:37:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:37:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:37:25,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:37:25,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:37:25,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:37:26,383 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short50#1;havoc property_#t~bitwise51#1;havoc property_#t~short52#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~short61#1; [2025-03-04 00:37:26,509 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 00:37:26,510 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:37:26,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:37:26,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:37:26,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:26 BoogieIcfgContainer [2025-03-04 00:37:26,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:37:26,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:37:26,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:37:26,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:37:26,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:37:24" (1/3) ... [2025-03-04 00:37:26,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675ea9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:26, skipping insertion in model container [2025-03-04 00:37:26,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:25" (2/3) ... [2025-03-04 00:37:26,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675ea9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:26, skipping insertion in model container [2025-03-04 00:37:26,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:26" (3/3) ... [2025-03-04 00:37:26,545 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-87.i [2025-03-04 00:37:26,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:37:26,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-87.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:37:26,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:37:26,624 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@276694de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:37:26,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:37:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 210 states have internal predecessors, (323), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:37:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:37:26,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:26,649 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:26,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -666016564, now seen corresponding path program 1 times [2025-03-04 00:37:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531282397] [2025-03-04 00:37:26,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:26,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:37:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:37:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531282397] [2025-03-04 00:37:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531282397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423319495] [2025-03-04 00:37:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:27,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:27,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:27,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:27,491 INFO L87 Difference]: Start difference. First operand has 280 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 210 states have internal predecessors, (323), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:27,701 INFO L93 Difference]: Finished difference Result 823 states and 1493 transitions. [2025-03-04 00:37:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 464 [2025-03-04 00:37:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:27,715 INFO L225 Difference]: With dead ends: 823 [2025-03-04 00:37:27,717 INFO L226 Difference]: Without dead ends: 546 [2025-03-04 00:37:27,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:27,724 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 418 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:27,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1245 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-04 00:37:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2025-03-04 00:37:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 403 states have (on average 1.498759305210918) internal successors, (604), 403 states have internal predecessors, (604), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:37:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 876 transitions. [2025-03-04 00:37:27,854 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 876 transitions. Word has length 464 [2025-03-04 00:37:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:27,857 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 876 transitions. [2025-03-04 00:37:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 876 transitions. [2025-03-04 00:37:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:37:27,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:27,869 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:27,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:37:27,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:27,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1958437163, now seen corresponding path program 1 times [2025-03-04 00:37:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822131285] [2025-03-04 00:37:27,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:27,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:37:28,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:37:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822131285] [2025-03-04 00:37:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822131285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720335467] [2025-03-04 00:37:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:28,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:28,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:28,685 INFO L87 Difference]: Start difference. First operand 542 states and 876 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:29,168 INFO L93 Difference]: Finished difference Result 1770 states and 2861 transitions. [2025-03-04 00:37:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 464 [2025-03-04 00:37:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:29,180 INFO L225 Difference]: With dead ends: 1770 [2025-03-04 00:37:29,181 INFO L226 Difference]: Without dead ends: 1231 [2025-03-04 00:37:29,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:29,183 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 691 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:29,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1675 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-03-04 00:37:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1071. [2025-03-04 00:37:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 794 states have (on average 1.5) internal successors, (1191), 794 states have internal predecessors, (1191), 272 states have call successors, (272), 4 states have call predecessors, (272), 4 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-04 00:37:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1735 transitions. [2025-03-04 00:37:29,306 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1735 transitions. Word has length 464 [2025-03-04 00:37:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1735 transitions. [2025-03-04 00:37:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1735 transitions. [2025-03-04 00:37:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:37:29,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:29,315 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:37:29,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1917013302, now seen corresponding path program 1 times [2025-03-04 00:37:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844353353] [2025-03-04 00:37:29,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:29,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:37:29,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:37:29,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844353353] [2025-03-04 00:37:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844353353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528627953] [2025-03-04 00:37:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:29,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:29,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:29,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:29,939 INFO L87 Difference]: Start difference. First operand 1071 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:30,432 INFO L93 Difference]: Finished difference Result 3481 states and 5632 transitions. [2025-03-04 00:37:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 464 [2025-03-04 00:37:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:30,450 INFO L225 Difference]: With dead ends: 3481 [2025-03-04 00:37:30,451 INFO L226 Difference]: Without dead ends: 2413 [2025-03-04 00:37:30,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:30,458 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 673 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:30,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1588 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2025-03-04 00:37:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2137. [2025-03-04 00:37:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1584 states have (on average 1.4987373737373737) internal successors, (2374), 1584 states have internal predecessors, (2374), 544 states have call successors, (544), 8 states have call predecessors, (544), 8 states have return successors, (544), 544 states have call predecessors, (544), 544 states have call successors, (544) [2025-03-04 00:37:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3462 transitions. [2025-03-04 00:37:30,673 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3462 transitions. Word has length 464 [2025-03-04 00:37:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:30,674 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3462 transitions. [2025-03-04 00:37:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3462 transitions. [2025-03-04 00:37:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-04 00:37:30,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:30,685 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:30,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:37:30,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:30,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1717868243, now seen corresponding path program 1 times [2025-03-04 00:37:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470932704] [2025-03-04 00:37:30,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:30,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 00:37:30,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 00:37:30,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:30,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470932704] [2025-03-04 00:37:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470932704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:31,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:31,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797864403] [2025-03-04 00:37:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:31,422 INFO L87 Difference]: Start difference. First operand 2137 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:31,803 INFO L93 Difference]: Finished difference Result 5099 states and 8248 transitions. [2025-03-04 00:37:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 465 [2025-03-04 00:37:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:31,821 INFO L225 Difference]: With dead ends: 5099 [2025-03-04 00:37:31,821 INFO L226 Difference]: Without dead ends: 2965 [2025-03-04 00:37:31,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:31,829 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 365 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:31,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-04 00:37:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2261. [2025-03-04 00:37:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1639 states have (on average 1.4856619890176936) internal successors, (2435), 1639 states have internal predecessors, (2435), 612 states have call successors, (612), 9 states have call predecessors, (612), 9 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:37:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3659 transitions. [2025-03-04 00:37:32,014 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3659 transitions. Word has length 465 [2025-03-04 00:37:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 3659 transitions. [2025-03-04 00:37:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3659 transitions. [2025-03-04 00:37:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:32,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:32,022 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:32,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:37:32,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 221072335, now seen corresponding path program 1 times [2025-03-04 00:37:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:32,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624028515] [2025-03-04 00:37:32,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:37:32,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:37:32,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:32,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624028515] [2025-03-04 00:37:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624028515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:37:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524611147] [2025-03-04 00:37:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:37:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:37:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:33,465 INFO L87 Difference]: Start difference. First operand 2261 states and 3659 transitions. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:37:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:34,760 INFO L93 Difference]: Finished difference Result 6091 states and 9862 transitions. [2025-03-04 00:37:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:37:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 467 [2025-03-04 00:37:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:34,782 INFO L225 Difference]: With dead ends: 6091 [2025-03-04 00:37:34,782 INFO L226 Difference]: Without dead ends: 3957 [2025-03-04 00:37:34,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:37:34,790 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 2155 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:34,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 2642 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:37:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2025-03-04 00:37:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 3093. [2025-03-04 00:37:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 2471 states have (on average 1.54552812626467) internal successors, (3819), 2471 states have internal predecessors, (3819), 612 states have call successors, (612), 9 states have call predecessors, (612), 9 states have return successors, (612), 612 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:37:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 5043 transitions. [2025-03-04 00:37:34,970 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 5043 transitions. Word has length 467 [2025-03-04 00:37:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:34,971 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 5043 transitions. [2025-03-04 00:37:34,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:37:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 5043 transitions. [2025-03-04 00:37:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:34,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:34,977 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:34,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:37:34,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:34,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:34,978 INFO L85 PathProgramCache]: Analyzing trace with hash 228831694, now seen corresponding path program 1 times [2025-03-04 00:37:34,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:34,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22248285] [2025-03-04 00:37:34,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:35,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:37:35,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:37:35,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:35,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22248285] [2025-03-04 00:37:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22248285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572249331] [2025-03-04 00:37:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:36,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:36,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:36,138 INFO L87 Difference]: Start difference. First operand 3093 states and 5043 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:36,412 INFO L93 Difference]: Finished difference Result 8983 states and 14632 transitions. [2025-03-04 00:37:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:37:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:36,442 INFO L225 Difference]: With dead ends: 8983 [2025-03-04 00:37:36,442 INFO L226 Difference]: Without dead ends: 6017 [2025-03-04 00:37:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:36,454 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 550 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1229 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2025-03-04 00:37:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 4707. [2025-03-04 00:37:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4707 states, 4028 states have (on average 1.5727408142999006) internal successors, (6335), 4032 states have internal predecessors, (6335), 660 states have call successors, (660), 18 states have call predecessors, (660), 18 states have return successors, (660), 656 states have call predecessors, (660), 660 states have call successors, (660) [2025-03-04 00:37:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 7655 transitions. [2025-03-04 00:37:36,694 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 7655 transitions. Word has length 467 [2025-03-04 00:37:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:36,696 INFO L471 AbstractCegarLoop]: Abstraction has 4707 states and 7655 transitions. [2025-03-04 00:37:36,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 7655 transitions. [2025-03-04 00:37:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:36,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:36,701 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:37:36,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:36,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 515970542, now seen corresponding path program 1 times [2025-03-04 00:37:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:36,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686798900] [2025-03-04 00:37:36,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:36,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:37:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:37:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686798900] [2025-03-04 00:37:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686798900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:38,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:38,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:37:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599685924] [2025-03-04 00:37:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:38,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:37:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:38,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:37:38,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:37:38,752 INFO L87 Difference]: Start difference. First operand 4707 states and 7655 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:40,198 INFO L93 Difference]: Finished difference Result 24994 states and 40514 transitions. [2025-03-04 00:37:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:37:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:37:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:40,262 INFO L225 Difference]: With dead ends: 24994 [2025-03-04 00:37:40,262 INFO L226 Difference]: Without dead ends: 20424 [2025-03-04 00:37:40,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:37:40,273 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 1961 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:40,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 3676 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:37:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20424 states. [2025-03-04 00:37:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20424 to 14104. [2025-03-04 00:37:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14104 states, 13085 states have (on average 1.6008406572411158) internal successors, (20947), 13113 states have internal predecessors, (20947), 972 states have call successors, (972), 46 states have call predecessors, (972), 46 states have return successors, (972), 944 states have call predecessors, (972), 972 states have call successors, (972) [2025-03-04 00:37:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14104 states to 14104 states and 22891 transitions. [2025-03-04 00:37:40,714 INFO L78 Accepts]: Start accepts. Automaton has 14104 states and 22891 transitions. Word has length 467 [2025-03-04 00:37:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:40,715 INFO L471 AbstractCegarLoop]: Abstraction has 14104 states and 22891 transitions. [2025-03-04 00:37:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14104 states and 22891 transitions. [2025-03-04 00:37:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:40,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:40,726 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:37:40,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash 404503053, now seen corresponding path program 1 times [2025-03-04 00:37:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630362391] [2025-03-04 00:37:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:37:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:37:41,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:41,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630362391] [2025-03-04 00:37:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630362391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999756232] [2025-03-04 00:37:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:42,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:42,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:42,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:42,072 INFO L87 Difference]: Start difference. First operand 14104 states and 22891 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:42,608 INFO L93 Difference]: Finished difference Result 33205 states and 53910 transitions. [2025-03-04 00:37:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:37:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:42,659 INFO L225 Difference]: With dead ends: 33205 [2025-03-04 00:37:42,659 INFO L226 Difference]: Without dead ends: 19253 [2025-03-04 00:37:42,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:42,689 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 330 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:42,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1284 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19253 states. [2025-03-04 00:37:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19253 to 14194. [2025-03-04 00:37:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14194 states, 13175 states have (on average 1.6008349146110057) internal successors, (21091), 13203 states have internal predecessors, (21091), 972 states have call successors, (972), 46 states have call predecessors, (972), 46 states have return successors, (972), 944 states have call predecessors, (972), 972 states have call successors, (972) [2025-03-04 00:37:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14194 states to 14194 states and 23035 transitions. [2025-03-04 00:37:43,306 INFO L78 Accepts]: Start accepts. Automaton has 14194 states and 23035 transitions. Word has length 467 [2025-03-04 00:37:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:43,308 INFO L471 AbstractCegarLoop]: Abstraction has 14194 states and 23035 transitions. [2025-03-04 00:37:43,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14194 states and 23035 transitions. [2025-03-04 00:37:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:43,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:43,323 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:43,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:37:43,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:43,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2108964308, now seen corresponding path program 1 times [2025-03-04 00:37:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927985892] [2025-03-04 00:37:43,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:37:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:37:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:44,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:37:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:54,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927985892] [2025-03-04 00:37:54,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927985892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:54,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:54,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:37:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843029905] [2025-03-04 00:37:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:54,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:37:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:54,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:37:54,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:37:54,794 INFO L87 Difference]: Start difference. First operand 14194 states and 23035 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:58,997 INFO L93 Difference]: Finished difference Result 41370 states and 67113 transitions. [2025-03-04 00:37:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:37:59,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:37:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:59,121 INFO L225 Difference]: With dead ends: 41370 [2025-03-04 00:37:59,122 INFO L226 Difference]: Without dead ends: 27402 [2025-03-04 00:37:59,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:37:59,155 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 2907 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:59,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 2004 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:37:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2025-03-04 00:37:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 18370. [2025-03-04 00:37:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18370 states, 17337 states have (on average 1.5934129318797947) internal successors, (27625), 17371 states have internal predecessors, (27625), 976 states have call successors, (976), 56 states have call predecessors, (976), 56 states have return successors, (976), 942 states have call predecessors, (976), 976 states have call successors, (976) [2025-03-04 00:37:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 29577 transitions. [2025-03-04 00:37:59,755 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 29577 transitions. Word has length 467 [2025-03-04 00:37:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 18370 states and 29577 transitions. [2025-03-04 00:37:59,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:37:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 29577 transitions. [2025-03-04 00:37:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:37:59,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:59,770 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:37:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:59,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1737306349, now seen corresponding path program 1 times [2025-03-04 00:37:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113035002] [2025-03-04 00:37:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:38:01,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:38:01,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:01,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:38:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113035002] [2025-03-04 00:38:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113035002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:13,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:13,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:38:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875520235] [2025-03-04 00:38:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:13,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:38:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:13,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:38:13,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:38:13,493 INFO L87 Difference]: Start difference. First operand 18370 states and 29577 transitions. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:21,637 INFO L93 Difference]: Finished difference Result 40768 states and 65380 transitions. [2025-03-04 00:38:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:38:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:38:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:21,688 INFO L225 Difference]: With dead ends: 40768 [2025-03-04 00:38:21,688 INFO L226 Difference]: Without dead ends: 22636 [2025-03-04 00:38:21,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:38:21,712 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1716 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 2432 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-04 00:38:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22636 states. [2025-03-04 00:38:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22636 to 19330. [2025-03-04 00:38:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 18249 states have (on average 1.5851279522165598) internal successors, (28927), 18295 states have internal predecessors, (28927), 1012 states have call successors, (1012), 68 states have call predecessors, (1012), 68 states have return successors, (1012), 966 states have call predecessors, (1012), 1012 states have call successors, (1012) [2025-03-04 00:38:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 30951 transitions. [2025-03-04 00:38:22,299 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 30951 transitions. Word has length 467 [2025-03-04 00:38:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 30951 transitions. [2025-03-04 00:38:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 30951 transitions. [2025-03-04 00:38:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:38:22,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:22,313 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:38:22,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:38:22,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1341949198, now seen corresponding path program 1 times [2025-03-04 00:38:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573392885] [2025-03-04 00:38:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:38:22,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:38:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:38:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573392885] [2025-03-04 00:38:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573392885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:38:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662879980] [2025-03-04 00:38:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:22,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:22,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:22,654 INFO L87 Difference]: Start difference. First operand 19330 states and 30951 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:23,414 INFO L93 Difference]: Finished difference Result 54580 states and 87327 transitions. [2025-03-04 00:38:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:38:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:23,490 INFO L225 Difference]: With dead ends: 54580 [2025-03-04 00:38:23,490 INFO L226 Difference]: Without dead ends: 35488 [2025-03-04 00:38:23,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:38:23,518 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 212 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:23,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1609 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:38:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35488 states. [2025-03-04 00:38:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35488 to 35456. [2025-03-04 00:38:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35456 states, 33973 states have (on average 1.580931916521944) internal successors, (53709), 34073 states have internal predecessors, (53709), 1360 states have call successors, (1360), 122 states have call predecessors, (1360), 122 states have return successors, (1360), 1260 states have call predecessors, (1360), 1360 states have call successors, (1360) [2025-03-04 00:38:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35456 states to 35456 states and 56429 transitions. [2025-03-04 00:38:24,364 INFO L78 Accepts]: Start accepts. Automaton has 35456 states and 56429 transitions. Word has length 467 [2025-03-04 00:38:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 35456 states and 56429 transitions. [2025-03-04 00:38:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35456 states and 56429 transitions. [2025-03-04 00:38:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:38:24,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:24,389 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:38:24,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:38:24,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:24,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1553885396, now seen corresponding path program 1 times [2025-03-04 00:38:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68490398] [2025-03-04 00:38:24,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:24,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:38:24,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:38:24,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:24,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:38:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68490398] [2025-03-04 00:38:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68490398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:38:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968029403] [2025-03-04 00:38:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:25,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:25,257 INFO L87 Difference]: Start difference. First operand 35456 states and 56429 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:26,888 INFO L93 Difference]: Finished difference Result 112326 states and 178728 transitions. [2025-03-04 00:38:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-03-04 00:38:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:27,030 INFO L225 Difference]: With dead ends: 112326 [2025-03-04 00:38:27,030 INFO L226 Difference]: Without dead ends: 77146 [2025-03-04 00:38:27,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:27,086 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 647 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1469 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:38:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77146 states. [2025-03-04 00:38:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77146 to 76990. [2025-03-04 00:38:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76990 states, 74143 states have (on average 1.5833591842790284) internal successors, (117395), 74387 states have internal predecessors, (117395), 2548 states have call successors, (2548), 298 states have call predecessors, (2548), 298 states have return successors, (2548), 2304 states have call predecessors, (2548), 2548 states have call successors, (2548) [2025-03-04 00:38:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76990 states to 76990 states and 122491 transitions. [2025-03-04 00:38:29,078 INFO L78 Accepts]: Start accepts. Automaton has 76990 states and 122491 transitions. Word has length 467 [2025-03-04 00:38:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:29,078 INFO L471 AbstractCegarLoop]: Abstraction has 76990 states and 122491 transitions. [2025-03-04 00:38:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-04 00:38:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 76990 states and 122491 transitions. [2025-03-04 00:38:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-04 00:38:29,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:29,115 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:38:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:38:29,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1439080396, now seen corresponding path program 1 times [2025-03-04 00:38:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216775284] [2025-03-04 00:38:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:29,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-04 00:38:29,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-04 00:38:29,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:29,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-04 00:38:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:30,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216775284] [2025-03-04 00:38:30,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216775284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:30,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:38:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605618712] [2025-03-04 00:38:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:30,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:38:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:30,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:38:30,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:38:30,742 INFO L87 Difference]: Start difference. First operand 76990 states and 122491 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-04 00:38:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:34,261 INFO L93 Difference]: Finished difference Result 228948 states and 364350 transitions. [2025-03-04 00:38:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:38:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 467 [2025-03-04 00:38:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:34,552 INFO L225 Difference]: With dead ends: 228948 [2025-03-04 00:38:34,553 INFO L226 Difference]: Without dead ends: 152274