./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodesize_ps-cn-500_file-9.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 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:23:36,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:23:36,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:23:36,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:23:36,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:23:36,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:23:36,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:23:36,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:23:36,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:23:36,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:23:36,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:23:36,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:23:36,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:23:36,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:23:36,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:23:36,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:23:36,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:23:36,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:23:36,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:23:36,856 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 -> 8c719a907edd740487c94e158c335e04c63c8abfa905aa57ad8e2c1d74785261 [2025-03-08 11:23:37,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:23:37,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:23:37,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:23:37,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:23:37,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:23:37,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-08 11:23:38,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853fc5e10/29f0ca2bc1d44dbcbadcf2a2ed03707e/FLAGe593182b2 [2025-03-08 11:23:38,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:23:38,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-08 11:23:38,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853fc5e10/29f0ca2bc1d44dbcbadcf2a2ed03707e/FLAGe593182b2 [2025-03-08 11:23:38,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853fc5e10/29f0ca2bc1d44dbcbadcf2a2ed03707e [2025-03-08 11:23:38,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:23:38,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:23:38,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:23:38,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:23:38,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:23:38,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:23:38" (1/1) ... [2025-03-08 11:23:38,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3454046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:38, skipping insertion in model container [2025-03-08 11:23:38,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:23:38" (1/1) ... [2025-03-08 11:23:38,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:23:38,976 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_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-03-08 11:23:39,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:23:39,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:23:39,151 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_fillercode_fillercodesize_ps-cn-500_file-9.i[915,928] [2025-03-08 11:23:39,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:23:39,238 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:23:39,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39 WrapperNode [2025-03-08 11:23:39,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:23:39,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:23:39,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:23:39,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:23:39,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,315 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-03-08 11:23:39,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:23:39,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:23:39,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:23:39,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:23:39,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,369 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-08 11:23:39,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:23:39,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:23:39,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:23:39,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:23:39,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (1/1) ... [2025-03-08 11:23:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:23:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:23:39,455 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-08 11:23:39,457 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-08 11:23:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:23:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:23:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:23:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:23:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:23:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:23:39,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:23:39,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:23:40,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc property_#t~bitwise67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~bitwise70#1;havoc property_#t~short71#1; [2025-03-08 11:23:40,504 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 11:23:40,504 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:23:40,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:23:40,542 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:23:40,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:23:40 BoogieIcfgContainer [2025-03-08 11:23:40,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:23:40,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:23:40,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:23:40,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:23:40,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:23:38" (1/3) ... [2025-03-08 11:23:40,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129885b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:23:40, skipping insertion in model container [2025-03-08 11:23:40,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:23:39" (2/3) ... [2025-03-08 11:23:40,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129885b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:23:40, skipping insertion in model container [2025-03-08 11:23:40,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:23:40" (3/3) ... [2025-03-08 11:23:40,551 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i [2025-03-08 11:23:40,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:23:40,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-9.i that has 2 procedures, 336 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:23:40,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:23:40,636 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;@6b5c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:23:40,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:23:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 11:23:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-08 11:23:40,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:40,663 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:40,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:40,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2062739904, now seen corresponding path program 1 times [2025-03-08 11:23:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983070825] [2025-03-08 11:23:40,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:40,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-08 11:23:40,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-08 11:23:40,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-08 11:23:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983070825] [2025-03-08 11:23:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983070825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:23:41,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106337584] [2025-03-08 11:23:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:41,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:23:41,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:23:41,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:23:41,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:23:41,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-08 11:23:41,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-08 11:23:41,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:41,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:41,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:23:41,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:23:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-03-08 11:23:41,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:23:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106337584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:41,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:23:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:23:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751249694] [2025-03-08 11:23:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:41,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:23:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:41,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:23:41,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:23:41,565 INFO L87 Difference]: Start difference. First operand has 336 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 245 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-08 11:23:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:41,666 INFO L93 Difference]: Finished difference Result 662 states and 1221 transitions. [2025-03-08 11:23:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:23:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 587 [2025-03-08 11:23:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:41,680 INFO L225 Difference]: With dead ends: 662 [2025-03-08 11:23:41,680 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 11:23:41,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:23:41,688 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:41,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:23:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 11:23:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-08 11:23:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 238 states have (on average 1.5924369747899159) internal successors, (379), 238 states have internal predecessors, (379), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 11:23:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 557 transitions. [2025-03-08 11:23:41,775 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 557 transitions. Word has length 587 [2025-03-08 11:23:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:41,776 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 557 transitions. [2025-03-08 11:23:41,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-08 11:23:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 557 transitions. [2025-03-08 11:23:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-08 11:23:41,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:41,787 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:41,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:23:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:23:41,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1544642467, now seen corresponding path program 1 times [2025-03-08 11:23:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446173081] [2025-03-08 11:23:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-08 11:23:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-08 11:23:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446173081] [2025-03-08 11:23:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446173081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:42,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:42,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:23:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369071839] [2025-03-08 11:23:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:23:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:42,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:23:42,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:23:42,495 INFO L87 Difference]: Start difference. First operand 329 states and 557 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:42,601 INFO L93 Difference]: Finished difference Result 862 states and 1465 transitions. [2025-03-08 11:23:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:23:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-03-08 11:23:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:42,607 INFO L225 Difference]: With dead ends: 862 [2025-03-08 11:23:42,607 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 11:23:42,608 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-08 11:23:42,609 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 362 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:42,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1291 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:23:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 11:23:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-03-08 11:23:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 412 states have internal predecessors, (669), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-08 11:23:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 907 transitions. [2025-03-08 11:23:42,666 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 907 transitions. Word has length 587 [2025-03-08 11:23:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:42,670 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 907 transitions. [2025-03-08 11:23:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 907 transitions. [2025-03-08 11:23:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-08 11:23:42,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:42,680 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:23:42,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 59586916, now seen corresponding path program 1 times [2025-03-08 11:23:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766839320] [2025-03-08 11:23:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:42,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-08 11:23:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-08 11:23:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766839320] [2025-03-08 11:23:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766839320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:23:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761103190] [2025-03-08 11:23:43,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:43,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:23:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:43,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:23:43,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:23:43,268 INFO L87 Difference]: Start difference. First operand 533 states and 907 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:43,337 INFO L93 Difference]: Finished difference Result 1065 states and 1815 transitions. [2025-03-08 11:23:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:23:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 587 [2025-03-08 11:23:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:43,347 INFO L225 Difference]: With dead ends: 1065 [2025-03-08 11:23:43,349 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 11:23:43,350 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-08 11:23:43,352 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:43,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1074 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:23:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 11:23:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 11:23:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 413 states have (on average 1.6246973365617434) internal successors, (671), 414 states have internal predecessors, (671), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-08 11:23:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 909 transitions. [2025-03-08 11:23:43,396 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 909 transitions. Word has length 587 [2025-03-08 11:23:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 909 transitions. [2025-03-08 11:23:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 909 transitions. [2025-03-08 11:23:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-08 11:23:43,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:43,405 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:43,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:23:43,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:43,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 956932387, now seen corresponding path program 1 times [2025-03-08 11:23:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420284379] [2025-03-08 11:23:43,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:43,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-08 11:23:43,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-08 11:23:43,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:43,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420284379] [2025-03-08 11:23:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420284379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:23:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500979029] [2025-03-08 11:23:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:44,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:23:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:44,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:23:44,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:23:44,042 INFO L87 Difference]: Start difference. First operand 535 states and 909 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:44,141 INFO L93 Difference]: Finished difference Result 1597 states and 2717 transitions. [2025-03-08 11:23:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:23:44,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-03-08 11:23:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:44,150 INFO L225 Difference]: With dead ends: 1597 [2025-03-08 11:23:44,151 INFO L226 Difference]: Without dead ends: 1065 [2025-03-08 11:23:44,152 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-08 11:23:44,153 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 345 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1068 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:23:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-08 11:23:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1063. [2025-03-08 11:23:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 820 states have (on average 1.6219512195121952) internal successors, (1330), 822 states have internal predecessors, (1330), 238 states have call successors, (238), 4 states have call predecessors, (238), 4 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 11:23:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1806 transitions. [2025-03-08 11:23:44,258 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1806 transitions. Word has length 588 [2025-03-08 11:23:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:44,258 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1806 transitions. [2025-03-08 11:23:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1806 transitions. [2025-03-08 11:23:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-08 11:23:44,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:44,264 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:23:44,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:44,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1918546404, now seen corresponding path program 1 times [2025-03-08 11:23:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506108178] [2025-03-08 11:23:44,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:44,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-08 11:23:44,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-08 11:23:44,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:44,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506108178] [2025-03-08 11:23:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506108178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85444291] [2025-03-08 11:23:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:44,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:44,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:44,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:44,757 INFO L87 Difference]: Start difference. First operand 1063 states and 1806 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:45,292 INFO L93 Difference]: Finished difference Result 3293 states and 5495 transitions. [2025-03-08 11:23:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:23:45,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 588 [2025-03-08 11:23:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:45,304 INFO L225 Difference]: With dead ends: 3293 [2025-03-08 11:23:45,304 INFO L226 Difference]: Without dead ends: 2233 [2025-03-08 11:23:45,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:45,307 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 577 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:45,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 2024 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:23:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2025-03-08 11:23:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2225. [2025-03-08 11:23:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1592 states have (on average 1.5339195979899498) internal successors, (2442), 1602 states have internal predecessors, (2442), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 610 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-08 11:23:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3682 transitions. [2025-03-08 11:23:45,485 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3682 transitions. Word has length 588 [2025-03-08 11:23:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:45,487 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3682 transitions. [2025-03-08 11:23:45,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3682 transitions. [2025-03-08 11:23:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:23:45,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:45,492 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:23:45,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1860873528, now seen corresponding path program 1 times [2025-03-08 11:23:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109749682] [2025-03-08 11:23:45,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:45,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:23:45,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:23:45,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:45,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:45,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109749682] [2025-03-08 11:23:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109749682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:23:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963152974] [2025-03-08 11:23:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:45,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:23:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:45,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:23:45,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:23:45,673 INFO L87 Difference]: Start difference. First operand 2225 states and 3682 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:45,937 INFO L93 Difference]: Finished difference Result 5985 states and 9806 transitions. [2025-03-08 11:23:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:23:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-08 11:23:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:45,956 INFO L225 Difference]: With dead ends: 5985 [2025-03-08 11:23:45,956 INFO L226 Difference]: Without dead ends: 3763 [2025-03-08 11:23:45,961 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-08 11:23:45,962 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 304 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:45,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1086 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:23:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-08 11:23:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3757. [2025-03-08 11:23:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3757 states, 2532 states have (on average 1.4684044233807267) internal successors, (3718), 2554 states have internal predecessors, (3718), 1200 states have call successors, (1200), 24 states have call predecessors, (1200), 24 states have return successors, (1200), 1178 states have call predecessors, (1200), 1200 states have call successors, (1200) [2025-03-08 11:23:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 6118 transitions. [2025-03-08 11:23:46,298 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 6118 transitions. Word has length 589 [2025-03-08 11:23:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:46,299 INFO L471 AbstractCegarLoop]: Abstraction has 3757 states and 6118 transitions. [2025-03-08 11:23:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 6118 transitions. [2025-03-08 11:23:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:23:46,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:46,308 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:46,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:23:46,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1793866775, now seen corresponding path program 1 times [2025-03-08 11:23:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582116500] [2025-03-08 11:23:46,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:46,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:23:46,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:23:46,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:46,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:47,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:47,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582116500] [2025-03-08 11:23:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582116500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:47,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:23:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553506440] [2025-03-08 11:23:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:23:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:47,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:23:47,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:23:47,358 INFO L87 Difference]: Start difference. First operand 3757 states and 6118 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-08 11:23:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:49,911 INFO L93 Difference]: Finished difference Result 22076 states and 35777 transitions. [2025-03-08 11:23:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:23:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 589 [2025-03-08 11:23:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:50,020 INFO L225 Difference]: With dead ends: 22076 [2025-03-08 11:23:50,020 INFO L226 Difference]: Without dead ends: 18322 [2025-03-08 11:23:50,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:23:50,039 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 5021 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5021 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:50,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5021 Valid, 2414 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 11:23:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2025-03-08 11:23:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 16037. [2025-03-08 11:23:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16037 states, 12004 states have (on average 1.5254915028323892) internal successors, (18312), 12120 states have internal predecessors, (18312), 3912 states have call successors, (3912), 120 states have call predecessors, (3912), 120 states have return successors, (3912), 3796 states have call predecessors, (3912), 3912 states have call successors, (3912) [2025-03-08 11:23:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 26136 transitions. [2025-03-08 11:23:51,185 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 26136 transitions. Word has length 589 [2025-03-08 11:23:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:51,186 INFO L471 AbstractCegarLoop]: Abstraction has 16037 states and 26136 transitions. [2025-03-08 11:23:51,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-03-08 11:23:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 26136 transitions. [2025-03-08 11:23:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:23:51,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:51,202 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:51,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:23:51,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1345170136, now seen corresponding path program 1 times [2025-03-08 11:23:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:51,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784727419] [2025-03-08 11:23:51,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:51,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:23:51,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:23:51,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:51,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784727419] [2025-03-08 11:23:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784727419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:23:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568422909] [2025-03-08 11:23:51,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:23:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:23:51,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:23:51,827 INFO L87 Difference]: Start difference. First operand 16037 states and 26136 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:52,867 INFO L93 Difference]: Finished difference Result 35308 states and 57697 transitions. [2025-03-08 11:23:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:23:52,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-08 11:23:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:52,954 INFO L225 Difference]: With dead ends: 35308 [2025-03-08 11:23:52,954 INFO L226 Difference]: Without dead ends: 19274 [2025-03-08 11:23:52,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 11:23:53,000 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 964 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:53,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1676 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:23:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-03-08 11:23:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 10955. [2025-03-08 11:23:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10955 states, 8402 states have (on average 1.5615329683408712) internal successors, (13120), 8459 states have internal predecessors, (13120), 2466 states have call successors, (2466), 86 states have call predecessors, (2466), 86 states have return successors, (2466), 2409 states have call predecessors, (2466), 2466 states have call successors, (2466) [2025-03-08 11:23:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10955 states to 10955 states and 18052 transitions. [2025-03-08 11:23:54,015 INFO L78 Accepts]: Start accepts. Automaton has 10955 states and 18052 transitions. Word has length 589 [2025-03-08 11:23:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:54,016 INFO L471 AbstractCegarLoop]: Abstraction has 10955 states and 18052 transitions. [2025-03-08 11:23:54,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:23:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10955 states and 18052 transitions. [2025-03-08 11:23:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:23:54,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:54,029 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:23:54,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:23:54,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -999496905, now seen corresponding path program 1 times [2025-03-08 11:23:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147125227] [2025-03-08 11:23:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:54,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:23:54,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:23:54,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:23:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147125227] [2025-03-08 11:23:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147125227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:55,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:23:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3827976] [2025-03-08 11:23:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:55,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:23:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:23:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:23:55,188 INFO L87 Difference]: Start difference. First operand 10955 states and 18052 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:00,486 INFO L93 Difference]: Finished difference Result 81343 states and 133591 transitions. [2025-03-08 11:24:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:24:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-08 11:24:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:00,714 INFO L225 Difference]: With dead ends: 81343 [2025-03-08 11:24:00,714 INFO L226 Difference]: Without dead ends: 70445 [2025-03-08 11:24:00,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:24:00,761 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 3221 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3221 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:00,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3221 Valid, 2741 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 11:24:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70445 states. [2025-03-08 11:24:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70445 to 30955. [2025-03-08 11:24:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30955 states, 25305 states have (on average 1.5985378383718634) internal successors, (40451), 25482 states have internal predecessors, (40451), 5418 states have call successors, (5418), 231 states have call predecessors, (5418), 231 states have return successors, (5418), 5241 states have call predecessors, (5418), 5418 states have call successors, (5418) [2025-03-08 11:24:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 51287 transitions. [2025-03-08 11:24:03,660 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 51287 transitions. Word has length 589 [2025-03-08 11:24:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 30955 states and 51287 transitions. [2025-03-08 11:24:03,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 51287 transitions. [2025-03-08 11:24:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:24:03,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:03,699 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:03,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:24:03,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -369038280, now seen corresponding path program 1 times [2025-03-08 11:24:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657125022] [2025-03-08 11:24:03,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:03,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:24:03,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:24:03,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:03,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:24:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657125022] [2025-03-08 11:24:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657125022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:24:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927631941] [2025-03-08 11:24:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:04,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:24:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:04,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:24:04,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:24:04,973 INFO L87 Difference]: Start difference. First operand 30955 states and 51287 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:14,906 INFO L93 Difference]: Finished difference Result 161459 states and 266613 transitions. [2025-03-08 11:24:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:24:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-08 11:24:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:15,513 INFO L225 Difference]: With dead ends: 161459 [2025-03-08 11:24:15,513 INFO L226 Difference]: Without dead ends: 130565 [2025-03-08 11:24:15,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:24:15,636 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 3530 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3530 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:15,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3530 Valid, 2226 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:24:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130565 states. [2025-03-08 11:24:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130565 to 74823. [2025-03-08 11:24:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74823 states, 62069 states have (on average 1.6102563276353736) internal successors, (99947), 62482 states have internal predecessors, (99947), 12234 states have call successors, (12234), 519 states have call predecessors, (12234), 519 states have return successors, (12234), 11821 states have call predecessors, (12234), 12234 states have call successors, (12234) [2025-03-08 11:24:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74823 states to 74823 states and 124415 transitions. [2025-03-08 11:24:21,684 INFO L78 Accepts]: Start accepts. Automaton has 74823 states and 124415 transitions. Word has length 589 [2025-03-08 11:24:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 74823 states and 124415 transitions. [2025-03-08 11:24:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 74823 states and 124415 transitions. [2025-03-08 11:24:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:24:21,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:21,733 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:24:21,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 511546746, now seen corresponding path program 1 times [2025-03-08 11:24:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926629736] [2025-03-08 11:24:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:21,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:24:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:24:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:24:22,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926629736] [2025-03-08 11:24:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926629736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:24:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313384490] [2025-03-08 11:24:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:22,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:24:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:22,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:24:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:24:22,724 INFO L87 Difference]: Start difference. First operand 74823 states and 124415 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:39,005 INFO L93 Difference]: Finished difference Result 283037 states and 466556 transitions. [2025-03-08 11:24:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:24:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 589 [2025-03-08 11:24:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:39,617 INFO L225 Difference]: With dead ends: 283037 [2025-03-08 11:24:39,617 INFO L226 Difference]: Without dead ends: 208275 [2025-03-08 11:24:39,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:24:39,773 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2911 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:39,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2911 Valid, 3348 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 11:24:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208275 states. [2025-03-08 11:24:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208275 to 178571. [2025-03-08 11:24:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178571 states, 147936 states have (on average 1.5952709279688515) internal successors, (235998), 149013 states have internal predecessors, (235998), 29274 states have call successors, (29274), 1360 states have call predecessors, (29274), 1360 states have return successors, (29274), 28197 states have call predecessors, (29274), 29274 states have call successors, (29274) [2025-03-08 11:24:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178571 states to 178571 states and 294546 transitions. [2025-03-08 11:24:55,678 INFO L78 Accepts]: Start accepts. Automaton has 178571 states and 294546 transitions. Word has length 589 [2025-03-08 11:24:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:55,679 INFO L471 AbstractCegarLoop]: Abstraction has 178571 states and 294546 transitions. [2025-03-08 11:24:55,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-03-08 11:24:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 178571 states and 294546 transitions. [2025-03-08 11:24:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 11:24:56,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:56,094 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:24:56,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 949556249, now seen corresponding path program 1 times [2025-03-08 11:24:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649034504] [2025-03-08 11:24:56,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:56,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 11:24:56,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 11:24:56,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:56,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-03-08 11:24:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649034504] [2025-03-08 11:24:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649034504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:24:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749697259] [2025-03-08 11:24:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:24:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:56,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:24:56,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:24:56,798 INFO L87 Difference]: Start difference. First operand 178571 states and 294546 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89)