./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-14.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 fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:47:38,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:47:38,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:47:38,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:47:38,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:47:38,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:47:38,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:47:38,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:47:38,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:47:38,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:47:38,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:47:38,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:47:38,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:47:38,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:47:38,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:47:38,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:47:38,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:47:38,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:47:38,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:47:38,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:47:38,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:47:38,622 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 -> fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 [2025-03-17 04:47:38,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:47:38,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:47:38,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:47:38,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:47:38,856 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:47:38,856 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-14.i [2025-03-17 04:47:40,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ec29ddd/e2d4e62149b14bb183ded17448b5a91c/FLAGdd8f24c7e [2025-03-17 04:47:40,413 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:47:40,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i [2025-03-17 04:47:40,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ec29ddd/e2d4e62149b14bb183ded17448b5a91c/FLAGdd8f24c7e [2025-03-17 04:47:40,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ec29ddd/e2d4e62149b14bb183ded17448b5a91c [2025-03-17 04:47:40,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:47:40,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:47:40,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:47:40,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:47:40,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:47:40,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:47:40" (1/1) ... [2025-03-17 04:47:40,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:40, skipping insertion in model container [2025-03-17 04:47:40,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:47:40" (1/1) ... [2025-03-17 04:47:40,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:47:40,605 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-14.i[916,929] [2025-03-17 04:47:40,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:47:40,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:47:40,865 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-14.i[916,929] [2025-03-17 04:47:40,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:47:41,019 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:47:41,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41 WrapperNode [2025-03-17 04:47:41,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:47:41,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:41,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:47:41,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:47:41,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,158 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 874 [2025-03-17 04:47:41,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:47:41,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:47:41,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:47:41,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:47:41,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,276 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-17 04:47:41,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:47:41,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:47:41,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:47:41,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:47:41,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (1/1) ... [2025-03-17 04:47:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:47:41,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:47:41,389 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-17 04:47:41,400 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-17 04:47:41,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:47:41,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:47:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:47:41,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:47:41,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:47:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:47:41,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:47:41,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:47:42,755 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc property_#t~ite67#1;havoc property_#t~ite65#1;havoc property_#t~bitwise62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~bitwise66#1;havoc property_#t~short68#1;havoc property_#t~ite71#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short72#1;havoc property_#t~bitwise73#1;havoc property_#t~short74#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short77#1;havoc property_#t~ite80#1;havoc property_#t~ite79#1;havoc property_#t~bitwise78#1;havoc property_#t~short81#1;havoc property_#t~ite84#1;havoc property_#t~ite83#1;havoc property_#t~bitwise82#1;havoc property_#t~short85#1;havoc property_#t~ite87#1;havoc property_#t~bitwise86#1;havoc property_#t~short88#1; [2025-03-17 04:47:42,965 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-03-17 04:47:42,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:47:43,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:47:43,001 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:47:43,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:43 BoogieIcfgContainer [2025-03-17 04:47:43,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:47:43,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:47:43,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:47:43,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:47:43,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:47:40" (1/3) ... [2025-03-17 04:47:43,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4620a512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:43, skipping insertion in model container [2025-03-17 04:47:43,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:47:41" (2/3) ... [2025-03-17 04:47:43,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4620a512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:47:43, skipping insertion in model container [2025-03-17 04:47:43,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:47:43" (3/3) ... [2025-03-17 04:47:43,013 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-14.i [2025-03-17 04:47:43,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:47:43,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-14.i that has 2 procedures, 355 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:47:43,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:47:43,102 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;@4eaca830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:47:43,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:47:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 355 states, 268 states have (on average 1.5335820895522387) internal successors, (411), 269 states have internal predecessors, (411), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 04:47:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 04:47:43,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:43,138 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:43,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:43,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 117725169, now seen corresponding path program 1 times [2025-03-17 04:47:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946893602] [2025-03-17 04:47:43,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:43,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 04:47:43,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 04:47:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946893602] [2025-03-17 04:47:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946893602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:44,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009735320] [2025-03-17 04:47:44,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:44,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:44,185 INFO L87 Difference]: Start difference. First operand has 355 states, 268 states have (on average 1.5335820895522387) internal successors, (411), 269 states have internal predecessors, (411), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:44,394 INFO L93 Difference]: Finished difference Result 957 states and 1683 transitions. [2025-03-17 04:47:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-17 04:47:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:44,416 INFO L225 Difference]: With dead ends: 957 [2025-03-17 04:47:44,417 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 04:47:44,422 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-17 04:47:44,426 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 392 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:44,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1340 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 04:47:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 600. [2025-03-17 04:47:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 476 states have (on average 1.5399159663865547) internal successors, (733), 477 states have internal predecessors, (733), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-17 04:47:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 975 transitions. [2025-03-17 04:47:44,579 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 975 transitions. Word has length 571 [2025-03-17 04:47:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 975 transitions. [2025-03-17 04:47:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 975 transitions. [2025-03-17 04:47:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 04:47:44,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:44,595 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:44,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 04:47:44,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 901104144, now seen corresponding path program 1 times [2025-03-17 04:47:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907589644] [2025-03-17 04:47:44,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:44,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 04:47:44,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 04:47:44,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:44,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907589644] [2025-03-17 04:47:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907589644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:45,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889006823] [2025-03-17 04:47:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:45,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:45,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:45,144 INFO L87 Difference]: Start difference. First operand 600 states and 975 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:45,358 INFO L93 Difference]: Finished difference Result 1735 states and 2813 transitions. [2025-03-17 04:47:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-17 04:47:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:45,372 INFO L225 Difference]: With dead ends: 1735 [2025-03-17 04:47:45,372 INFO L226 Difference]: Without dead ends: 1136 [2025-03-17 04:47:45,377 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-17 04:47:45,377 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 485 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:45,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1433 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-17 04:47:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 816. [2025-03-17 04:47:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 692 states have (on average 1.5780346820809248) internal successors, (1092), 693 states have internal predecessors, (1092), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-17 04:47:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1334 transitions. [2025-03-17 04:47:45,494 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1334 transitions. Word has length 571 [2025-03-17 04:47:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1334 transitions. [2025-03-17 04:47:45,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1334 transitions. [2025-03-17 04:47:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 04:47:45,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:45,509 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:45,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:47:45,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash 372185105, now seen corresponding path program 1 times [2025-03-17 04:47:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378355863] [2025-03-17 04:47:45,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 04:47:45,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 04:47:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378355863] [2025-03-17 04:47:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378355863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294004087] [2025-03-17 04:47:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:45,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:45,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:45,876 INFO L87 Difference]: Start difference. First operand 816 states and 1334 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:46,006 INFO L93 Difference]: Finished difference Result 2363 states and 3861 transitions. [2025-03-17 04:47:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-17 04:47:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:46,015 INFO L225 Difference]: With dead ends: 2363 [2025-03-17 04:47:46,015 INFO L226 Difference]: Without dead ends: 1548 [2025-03-17 04:47:46,018 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-17 04:47:46,019 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 421 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:46,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1396 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-03-17 04:47:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2025-03-17 04:47:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1321 states have (on average 1.5760787282361848) internal successors, (2082), 1324 states have internal predecessors, (2082), 219 states have call successors, (219), 4 states have call predecessors, (219), 4 states have return successors, (219), 216 states have call predecessors, (219), 219 states have call successors, (219) [2025-03-17 04:47:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2520 transitions. [2025-03-17 04:47:46,176 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2520 transitions. Word has length 571 [2025-03-17 04:47:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2520 transitions. [2025-03-17 04:47:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2520 transitions. [2025-03-17 04:47:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 04:47:46,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:46,185 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:46,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:47:46,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:46,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1112870446, now seen corresponding path program 1 times [2025-03-17 04:47:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:46,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021713360] [2025-03-17 04:47:46,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:46,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 04:47:46,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 04:47:46,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:46,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021713360] [2025-03-17 04:47:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021713360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627926449] [2025-03-17 04:47:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:46,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:46,929 INFO L87 Difference]: Start difference. First operand 1545 states and 2520 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:47,784 INFO L93 Difference]: Finished difference Result 9861 states and 16086 transitions. [2025-03-17 04:47:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:47:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-17 04:47:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:47,825 INFO L225 Difference]: With dead ends: 9861 [2025-03-17 04:47:47,825 INFO L226 Difference]: Without dead ends: 8317 [2025-03-17 04:47:47,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:47:47,836 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 1812 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 4562 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:47,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1812 Valid, 4562 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:47:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2025-03-17 04:47:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 6171. [2025-03-17 04:47:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6171 states, 5278 states have (on average 1.5676392572944298) internal successors, (8274), 5290 states have internal predecessors, (8274), 876 states have call successors, (876), 16 states have call predecessors, (876), 16 states have return successors, (876), 864 states have call predecessors, (876), 876 states have call successors, (876) [2025-03-17 04:47:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 10026 transitions. [2025-03-17 04:47:48,219 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 10026 transitions. Word has length 571 [2025-03-17 04:47:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:48,220 INFO L471 AbstractCegarLoop]: Abstraction has 6171 states and 10026 transitions. [2025-03-17 04:47:48,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 10026 transitions. [2025-03-17 04:47:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-17 04:47:48,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:48,234 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:47:48,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1983361585, now seen corresponding path program 1 times [2025-03-17 04:47:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:48,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041032735] [2025-03-17 04:47:48,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:48,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-17 04:47:48,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-17 04:47:48,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041032735] [2025-03-17 04:47:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041032735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146847134] [2025-03-17 04:47:48,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:48,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:48,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:48,662 INFO L87 Difference]: Start difference. First operand 6171 states and 10026 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:48,991 INFO L93 Difference]: Finished difference Result 13885 states and 22570 transitions. [2025-03-17 04:47:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-03-17 04:47:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:49,037 INFO L225 Difference]: With dead ends: 13885 [2025-03-17 04:47:49,038 INFO L226 Difference]: Without dead ends: 7715 [2025-03-17 04:47:49,053 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-17 04:47:49,054 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 393 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:49,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1395 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2025-03-17 04:47:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 4629. [2025-03-17 04:47:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 3959 states have (on average 1.5645364991159383) internal successors, (6194), 3968 states have internal predecessors, (6194), 657 states have call successors, (657), 12 states have call predecessors, (657), 12 states have return successors, (657), 648 states have call predecessors, (657), 657 states have call successors, (657) [2025-03-17 04:47:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 7508 transitions. [2025-03-17 04:47:49,439 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 7508 transitions. Word has length 571 [2025-03-17 04:47:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 7508 transitions. [2025-03-17 04:47:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 7508 transitions. [2025-03-17 04:47:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-17 04:47:49,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:49,454 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:47:49,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:49,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2112898805, now seen corresponding path program 1 times [2025-03-17 04:47:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765744075] [2025-03-17 04:47:49,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:49,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-17 04:47:49,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-17 04:47:49,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765744075] [2025-03-17 04:47:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765744075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:50,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:50,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:47:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4158372] [2025-03-17 04:47:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:50,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:47:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:50,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:47:50,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:47:50,737 INFO L87 Difference]: Start difference. First operand 4629 states and 7508 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:52,224 INFO L93 Difference]: Finished difference Result 19898 states and 32006 transitions. [2025-03-17 04:47:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:47:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 572 [2025-03-17 04:47:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:52,289 INFO L225 Difference]: With dead ends: 19898 [2025-03-17 04:47:52,290 INFO L226 Difference]: Without dead ends: 15270 [2025-03-17 04:47:52,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:47:52,302 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1562 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:52,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 2059 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:47:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15270 states. [2025-03-17 04:47:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15270 to 11604. [2025-03-17 04:47:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11604 states, 10502 states have (on average 1.5871262616644448) internal successors, (16668), 10523 states have internal predecessors, (16668), 1077 states have call successors, (1077), 24 states have call predecessors, (1077), 24 states have return successors, (1077), 1056 states have call predecessors, (1077), 1077 states have call successors, (1077) [2025-03-17 04:47:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11604 states to 11604 states and 18822 transitions. [2025-03-17 04:47:52,803 INFO L78 Accepts]: Start accepts. Automaton has 11604 states and 18822 transitions. Word has length 572 [2025-03-17 04:47:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:52,804 INFO L471 AbstractCegarLoop]: Abstraction has 11604 states and 18822 transitions. [2025-03-17 04:47:52,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 11604 states and 18822 transitions. [2025-03-17 04:47:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-17 04:47:52,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:52,822 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:52,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:47:52,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:52,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1564984616, now seen corresponding path program 1 times [2025-03-17 04:47:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297635032] [2025-03-17 04:47:52,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:52,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-17 04:47:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-17 04:47:52,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:52,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297635032] [2025-03-17 04:47:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297635032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:47:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213908893] [2025-03-17 04:47:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:47:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:53,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:47:53,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:47:53,570 INFO L87 Difference]: Start difference. First operand 11604 states and 18822 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:54,507 INFO L93 Difference]: Finished difference Result 34810 states and 56464 transitions. [2025-03-17 04:47:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:47:54,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 572 [2025-03-17 04:47:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:54,605 INFO L225 Difference]: With dead ends: 34810 [2025-03-17 04:47:54,606 INFO L226 Difference]: Without dead ends: 23207 [2025-03-17 04:47:54,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 04:47:54,646 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 378 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1097 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:47:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23207 states. [2025-03-17 04:47:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23207 to 23205. [2025-03-17 04:47:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23205 states, 21002 states have (on average 1.575754690029521) internal successors, (33094), 21044 states have internal predecessors, (33094), 2154 states have call successors, (2154), 48 states have call predecessors, (2154), 48 states have return successors, (2154), 2112 states have call predecessors, (2154), 2154 states have call successors, (2154) [2025-03-17 04:47:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23205 states to 23205 states and 37402 transitions. [2025-03-17 04:47:55,658 INFO L78 Accepts]: Start accepts. Automaton has 23205 states and 37402 transitions. Word has length 572 [2025-03-17 04:47:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 23205 states and 37402 transitions. [2025-03-17 04:47:55,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23205 states and 37402 transitions. [2025-03-17 04:47:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-17 04:47:55,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:55,678 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:55,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:47:55,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:55,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 91594056, now seen corresponding path program 1 times [2025-03-17 04:47:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563350862] [2025-03-17 04:47:55,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-17 04:47:55,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-17 04:47:55,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:55,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:47:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:47:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:47:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563350862] [2025-03-17 04:47:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563350862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:47:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:47:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:47:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370585744] [2025-03-17 04:47:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:47:56,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:47:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:47:56,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:47:56,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:47:56,267 INFO L87 Difference]: Start difference. First operand 23205 states and 37402 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:47:57,083 INFO L93 Difference]: Finished difference Result 56610 states and 91078 transitions. [2025-03-17 04:47:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:47:57,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 572 [2025-03-17 04:47:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:47:57,282 INFO L225 Difference]: With dead ends: 56610 [2025-03-17 04:47:57,283 INFO L226 Difference]: Without dead ends: 33406 [2025-03-17 04:47:57,349 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-17 04:47:57,349 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 425 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:47:57,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1641 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:47:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33406 states. [2025-03-17 04:47:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33406 to 32412. [2025-03-17 04:47:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32412 states, 30122 states have (on average 1.5876435827634288) internal successors, (47823), 30164 states have internal predecessors, (47823), 2238 states have call successors, (2238), 51 states have call predecessors, (2238), 51 states have return successors, (2238), 2196 states have call predecessors, (2238), 2238 states have call successors, (2238) [2025-03-17 04:47:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32412 states to 32412 states and 52299 transitions. [2025-03-17 04:47:58,495 INFO L78 Accepts]: Start accepts. Automaton has 32412 states and 52299 transitions. Word has length 572 [2025-03-17 04:47:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:47:58,497 INFO L471 AbstractCegarLoop]: Abstraction has 32412 states and 52299 transitions. [2025-03-17 04:47:58,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-17 04:47:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32412 states and 52299 transitions. [2025-03-17 04:47:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-17 04:47:58,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:47:58,520 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:47:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:47:58,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:47:58,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:47:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -520813784, now seen corresponding path program 1 times [2025-03-17 04:47:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:47:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602929953] [2025-03-17 04:47:58,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:47:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:47:58,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-17 04:47:59,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 04:47:59,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:47:59,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:48:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:03,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602929953] [2025-03-17 04:48:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602929953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:03,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:03,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 04:48:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215558985] [2025-03-17 04:48:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:03,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:48:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:03,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:48:03,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:48:03,985 INFO L87 Difference]: Start difference. First operand 32412 states and 52299 transitions. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-17 04:48:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:10,797 INFO L93 Difference]: Finished difference Result 133816 states and 214344 transitions. [2025-03-17 04:48:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:48:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) Word has length 573 [2025-03-17 04:48:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:11,159 INFO L225 Difference]: With dead ends: 133816 [2025-03-17 04:48:11,160 INFO L226 Difference]: Without dead ends: 108372 [2025-03-17 04:48:11,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:48:11,252 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 2960 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2960 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:11,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2960 Valid, 2783 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 04:48:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108372 states. [2025-03-17 04:48:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108372 to 61820. [2025-03-17 04:48:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61820 states, 59194 states have (on average 1.5928472480318951) internal successors, (94287), 59284 states have internal predecessors, (94287), 2478 states have call successors, (2478), 147 states have call predecessors, (2478), 147 states have return successors, (2478), 2388 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-17 04:48:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61820 states to 61820 states and 99243 transitions. [2025-03-17 04:48:14,394 INFO L78 Accepts]: Start accepts. Automaton has 61820 states and 99243 transitions. Word has length 573 [2025-03-17 04:48:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:14,395 INFO L471 AbstractCegarLoop]: Abstraction has 61820 states and 99243 transitions. [2025-03-17 04:48:14,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-17 04:48:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61820 states and 99243 transitions. [2025-03-17 04:48:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-17 04:48:14,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:14,428 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:48:14,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:48:14,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:14,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 172287913, now seen corresponding path program 1 times [2025-03-17 04:48:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122013001] [2025-03-17 04:48:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-17 04:48:14,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 04:48:14,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:48:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122013001] [2025-03-17 04:48:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122013001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:48:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70982137] [2025-03-17 04:48:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:48:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:31,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:48:31,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:48:31,454 INFO L87 Difference]: Start difference. First operand 61820 states and 99243 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-17 04:48:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:36,450 INFO L93 Difference]: Finished difference Result 210524 states and 336690 transitions. [2025-03-17 04:48:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:48:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 573 [2025-03-17 04:48:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:36,816 INFO L225 Difference]: With dead ends: 210524 [2025-03-17 04:48:36,817 INFO L226 Difference]: Without dead ends: 163968 [2025-03-17 04:48:36,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:48:36,889 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 2020 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:36,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 2400 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 04:48:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163968 states. [2025-03-17 04:48:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163968 to 141850. [2025-03-17 04:48:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141850 states, 135917 states have (on average 1.5825982033152586) internal successors, (215102), 136193 states have internal predecessors, (215102), 5544 states have call successors, (5544), 388 states have call predecessors, (5544), 388 states have return successors, (5544), 5268 states have call predecessors, (5544), 5544 states have call successors, (5544) [2025-03-17 04:48:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141850 states to 141850 states and 226190 transitions. [2025-03-17 04:48:42,641 INFO L78 Accepts]: Start accepts. Automaton has 141850 states and 226190 transitions. Word has length 573 [2025-03-17 04:48:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 141850 states and 226190 transitions. [2025-03-17 04:48:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-17 04:48:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 141850 states and 226190 transitions. [2025-03-17 04:48:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-17 04:48:42,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:42,715 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 04:48:42,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:48:42,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -948548344, now seen corresponding path program 1 times [2025-03-17 04:48:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253560616] [2025-03-17 04:48:42,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:42,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-17 04:48:43,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 04:48:43,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-17 04:48:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:47,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253560616] [2025-03-17 04:48:47,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253560616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:47,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:47,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 04:48:47,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792299656] [2025-03-17 04:48:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 04:48:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:47,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 04:48:47,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:48:47,208 INFO L87 Difference]: Start difference. First operand 141850 states and 226190 transitions. Second operand has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84)