./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.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 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:48:07,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:48:07,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:48:07,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:48:07,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:48:07,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:48:07,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:48:07,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:48:07,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:48:07,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:48:07,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:48:07,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:48:07,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:48:07,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:48:07,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:48:07,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:48:07,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:48:07,692 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 -> 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 [2025-03-17 04:48:07,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:48:07,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:48:07,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:48:07,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:48:07,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:48:07,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-03-17 04:48:09,040 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2456229/90fba8b8ab4e46efb9a3a01f7fbc79f8/FLAG6efebd26b [2025-03-17 04:48:09,343 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:48:09,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-03-17 04:48:09,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2456229/90fba8b8ab4e46efb9a3a01f7fbc79f8/FLAG6efebd26b [2025-03-17 04:48:09,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2456229/90fba8b8ab4e46efb9a3a01f7fbc79f8 [2025-03-17 04:48:09,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:48:09,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:48:09,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:48:09,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:48:09,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:48:09,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09, skipping insertion in model container [2025-03-17 04:48:09,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:48:09,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i[915,928] [2025-03-17 04:48:09,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:48:09,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:48:09,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i[915,928] [2025-03-17 04:48:09,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:48:09,822 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:48:09,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09 WrapperNode [2025-03-17 04:48:09,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:48:09,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:48:09,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:48:09,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:48:09,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,916 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 702 [2025-03-17 04:48:09,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:48:09,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:48:09,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:48:09,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:48:09,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,987 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:48:09,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:09,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:48:10,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:48:10,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:48:10,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:48:10,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (1/1) ... [2025-03-17 04:48:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:48:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:48:10,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:48:10,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:48:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:48:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:48:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:48:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:48:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:48:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:48:10,259 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:48:10,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:48:11,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1; [2025-03-17 04:48:11,367 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-03-17 04:48:11,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:48:11,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:48:11,387 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:48:11,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:48:11 BoogieIcfgContainer [2025-03-17 04:48:11,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:48:11,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:48:11,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:48:11,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:48:11,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:48:09" (1/3) ... [2025-03-17 04:48:11,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f72fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:48:11, skipping insertion in model container [2025-03-17 04:48:11,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:48:09" (2/3) ... [2025-03-17 04:48:11,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f72fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:48:11, skipping insertion in model container [2025-03-17 04:48:11,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:48:11" (3/3) ... [2025-03-17 04:48:11,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-2.i [2025-03-17 04:48:11,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:48:11,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-2.i that has 2 procedures, 275 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:48:11,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:48:11,463 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;@4daedeb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:48:11,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:48:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 200 states have internal predecessors, (308), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 04:48:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:11,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:11,487 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:11,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash 965943342, now seen corresponding path program 1 times [2025-03-17 04:48:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080625546] [2025-03-17 04:48:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:11,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-17 04:48:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080625546] [2025-03-17 04:48:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080625546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:48:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899200633] [2025-03-17 04:48:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:12,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:48:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:48:12,087 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-17 04:48:12,088 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-17 04:48:12,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:12,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:12,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:12,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:48:12,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:48:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-17 04:48:12,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:48:12,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899200633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:12,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:48:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:48:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553561373] [2025-03-17 04:48:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:48:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:12,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:48:12,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:48:12,527 INFO L87 Difference]: Start difference. First operand has 275 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 200 states have internal predecessors, (308), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-17 04:48:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:12,587 INFO L93 Difference]: Finished difference Result 547 states and 979 transitions. [2025-03-17 04:48:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:48:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 491 [2025-03-17 04:48:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:12,599 INFO L225 Difference]: With dead ends: 547 [2025-03-17 04:48:12,600 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 04:48:12,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 492 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-17 04:48:12,609 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:12,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:48:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 04:48:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-17 04:48:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 198 states have (on average 1.5353535353535352) internal successors, (304), 198 states have internal predecessors, (304), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 04:48:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 450 transitions. [2025-03-17 04:48:12,686 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 450 transitions. Word has length 491 [2025-03-17 04:48:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:12,689 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 450 transitions. [2025-03-17 04:48:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-17 04:48:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 450 transitions. [2025-03-17 04:48:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:12,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:12,704 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:12,713 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-17 04:48:12,908 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-17 04:48:12,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1847502319, now seen corresponding path program 1 times [2025-03-17 04:48:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288076698] [2025-03-17 04:48:12,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:12,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:13,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:13,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:13,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288076698] [2025-03-17 04:48:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288076698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740605153] [2025-03-17 04:48:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:15,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:15,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:15,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:15,127 INFO L87 Difference]: Start difference. First operand 273 states and 450 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:15,456 INFO L93 Difference]: Finished difference Result 857 states and 1403 transitions. [2025-03-17 04:48:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:15,467 INFO L225 Difference]: With dead ends: 857 [2025-03-17 04:48:15,469 INFO L226 Difference]: Without dead ends: 585 [2025-03-17 04:48:15,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:15,471 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 655 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:15,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1493 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:48:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-17 04:48:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 443. [2025-03-17 04:48:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 349 states have (on average 1.5616045845272206) internal successors, (545), 350 states have internal predecessors, (545), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-17 04:48:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 727 transitions. [2025-03-17 04:48:15,522 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 727 transitions. Word has length 491 [2025-03-17 04:48:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:15,523 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 727 transitions. [2025-03-17 04:48:15,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 727 transitions. [2025-03-17 04:48:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:15,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:15,529 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:48:15,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 493055503, now seen corresponding path program 1 times [2025-03-17 04:48:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718107145] [2025-03-17 04:48:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:15,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:16,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:16,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718107145] [2025-03-17 04:48:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718107145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:17,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:17,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224808707] [2025-03-17 04:48:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:17,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:17,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:17,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:17,083 INFO L87 Difference]: Start difference. First operand 443 states and 727 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:17,406 INFO L93 Difference]: Finished difference Result 1310 states and 2116 transitions. [2025-03-17 04:48:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:17,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:17,414 INFO L225 Difference]: With dead ends: 1310 [2025-03-17 04:48:17,417 INFO L226 Difference]: Without dead ends: 868 [2025-03-17 04:48:17,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:17,420 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 296 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:17,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1361 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:48:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-17 04:48:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 735. [2025-03-17 04:48:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 601 states have (on average 1.562396006655574) internal successors, (939), 604 states have internal predecessors, (939), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-17 04:48:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1197 transitions. [2025-03-17 04:48:17,488 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1197 transitions. Word has length 491 [2025-03-17 04:48:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:17,491 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1197 transitions. [2025-03-17 04:48:17,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1197 transitions. [2025-03-17 04:48:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:17,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:17,500 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:48:17,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1454669520, now seen corresponding path program 1 times [2025-03-17 04:48:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543791884] [2025-03-17 04:48:17,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:17,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543791884] [2025-03-17 04:48:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543791884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:48:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141990061] [2025-03-17 04:48:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:18,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:48:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:18,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:48:18,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:18,104 INFO L87 Difference]: Start difference. First operand 735 states and 1197 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:18,715 INFO L93 Difference]: Finished difference Result 2729 states and 4425 transitions. [2025-03-17 04:48:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:48:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:18,727 INFO L225 Difference]: With dead ends: 2729 [2025-03-17 04:48:18,727 INFO L226 Difference]: Without dead ends: 1995 [2025-03-17 04:48:18,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:48:18,730 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 769 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:18,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2013 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:48:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-17 04:48:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1991. [2025-03-17 04:48:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1591 states have (on average 1.528598365807668) internal successors, (2432), 1600 states have internal predecessors, (2432), 387 states have call successors, (387), 12 states have call predecessors, (387), 12 states have return successors, (387), 378 states have call predecessors, (387), 387 states have call successors, (387) [2025-03-17 04:48:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 3206 transitions. [2025-03-17 04:48:18,926 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 3206 transitions. Word has length 491 [2025-03-17 04:48:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:18,927 INFO L471 AbstractCegarLoop]: Abstraction has 1991 states and 3206 transitions. [2025-03-17 04:48:18,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 3206 transitions. [2025-03-17 04:48:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:18,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:18,939 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:18,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:48:18,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:18,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1547822128, now seen corresponding path program 1 times [2025-03-17 04:48:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:18,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631921841] [2025-03-17 04:48:18,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:18,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:19,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:19,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:19,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631921841] [2025-03-17 04:48:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631921841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321948297] [2025-03-17 04:48:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:19,856 INFO L87 Difference]: Start difference. First operand 1991 states and 3206 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:20,210 INFO L93 Difference]: Finished difference Result 5704 states and 9165 transitions. [2025-03-17 04:48:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:20,230 INFO L225 Difference]: With dead ends: 5704 [2025-03-17 04:48:20,230 INFO L226 Difference]: Without dead ends: 3714 [2025-03-17 04:48:20,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:20,238 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 280 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:20,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1176 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:48:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2025-03-17 04:48:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3709. [2025-03-17 04:48:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 3012 states have (on average 1.5292164674634794) internal successors, (4606), 3033 states have internal predecessors, (4606), 672 states have call successors, (672), 24 states have call predecessors, (672), 24 states have return successors, (672), 651 states have call predecessors, (672), 672 states have call successors, (672) [2025-03-17 04:48:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5950 transitions. [2025-03-17 04:48:20,436 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5950 transitions. Word has length 491 [2025-03-17 04:48:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:20,437 INFO L471 AbstractCegarLoop]: Abstraction has 3709 states and 5950 transitions. [2025-03-17 04:48:20,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5950 transitions. [2025-03-17 04:48:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:20,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:20,445 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:20,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:48:20,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -462281713, now seen corresponding path program 1 times [2025-03-17 04:48:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654559163] [2025-03-17 04:48:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:20,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:20,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:20,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654559163] [2025-03-17 04:48:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654559163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374595824] [2025-03-17 04:48:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:21,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:21,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:21,517 INFO L87 Difference]: Start difference. First operand 3709 states and 5950 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:22,188 INFO L93 Difference]: Finished difference Result 12961 states and 20735 transitions. [2025-03-17 04:48:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:22,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:22,242 INFO L225 Difference]: With dead ends: 12961 [2025-03-17 04:48:22,242 INFO L226 Difference]: Without dead ends: 9253 [2025-03-17 04:48:22,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:22,259 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 582 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:22,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1202 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:48:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9253 states. [2025-03-17 04:48:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9253 to 7859. [2025-03-17 04:48:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7859 states, 6670 states have (on average 1.5517241379310345) internal successors, (10350), 6715 states have internal predecessors, (10350), 1140 states have call successors, (1140), 48 states have call predecessors, (1140), 48 states have return successors, (1140), 1095 states have call predecessors, (1140), 1140 states have call successors, (1140) [2025-03-17 04:48:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 12630 transitions. [2025-03-17 04:48:22,766 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 12630 transitions. Word has length 491 [2025-03-17 04:48:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:22,767 INFO L471 AbstractCegarLoop]: Abstraction has 7859 states and 12630 transitions. [2025-03-17 04:48:22,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 12630 transitions. [2025-03-17 04:48:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:22,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:22,780 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:22,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:48:22,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:22,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 762424050, now seen corresponding path program 1 times [2025-03-17 04:48:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88747649] [2025-03-17 04:48:22,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:22,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:23,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:23,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88747649] [2025-03-17 04:48:23,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88747649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:23,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:23,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:48:23,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904124654] [2025-03-17 04:48:23,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:23,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:48:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:23,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:48:23,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:23,917 INFO L87 Difference]: Start difference. First operand 7859 states and 12630 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:25,314 INFO L93 Difference]: Finished difference Result 31589 states and 50376 transitions. [2025-03-17 04:48:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:48:25,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:25,414 INFO L225 Difference]: With dead ends: 31589 [2025-03-17 04:48:25,414 INFO L226 Difference]: Without dead ends: 23731 [2025-03-17 04:48:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:48:25,438 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 1000 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1752 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:48:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23731 states. [2025-03-17 04:48:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23731 to 10175. [2025-03-17 04:48:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10175 states, 8986 states have (on average 1.5733363009125305) internal successors, (14138), 9031 states have internal predecessors, (14138), 1140 states have call successors, (1140), 48 states have call predecessors, (1140), 48 states have return successors, (1140), 1095 states have call predecessors, (1140), 1140 states have call successors, (1140) [2025-03-17 04:48:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 16418 transitions. [2025-03-17 04:48:26,180 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 16418 transitions. Word has length 491 [2025-03-17 04:48:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:26,182 INFO L471 AbstractCegarLoop]: Abstraction has 10175 states and 16418 transitions. [2025-03-17 04:48:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 16418 transitions. [2025-03-17 04:48:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:26,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:26,199 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:26,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:48:26,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:26,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2024991437, now seen corresponding path program 1 times [2025-03-17 04:48:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:26,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056812304] [2025-03-17 04:48:26,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:26,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:26,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:28,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:28,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:28,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 57 proven. 159 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-17 04:48:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056812304] [2025-03-17 04:48:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056812304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:48:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881619763] [2025-03-17 04:48:28,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:48:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:48:28,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:48:28,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:48:28,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:28,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:28,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:28,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:28,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 04:48:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:48:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 1736 proven. 390 refuted. 0 times theorem prover too weak. 8386 trivial. 0 not checked. [2025-03-17 04:48:30,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:48:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 36 proven. 393 refuted. 0 times theorem prover too weak. 10083 trivial. 0 not checked. [2025-03-17 04:48:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881619763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:48:31,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:48:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 21 [2025-03-17 04:48:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413343397] [2025-03-17 04:48:31,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:48:31,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 04:48:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:31,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 04:48:31,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:48:31,756 INFO L87 Difference]: Start difference. First operand 10175 states and 16418 transitions. Second operand has 21 states, 21 states have (on average 15.333333333333334) internal successors, (322), 21 states have internal predecessors, (322), 8 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-17 04:48:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:34,422 INFO L93 Difference]: Finished difference Result 25143 states and 40183 transitions. [2025-03-17 04:48:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 04:48:34,422 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 15.333333333333334) internal successors, (322), 21 states have internal predecessors, (322), 8 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) Word has length 491 [2025-03-17 04:48:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:34,464 INFO L225 Difference]: With dead ends: 25143 [2025-03-17 04:48:34,464 INFO L226 Difference]: Without dead ends: 14969 [2025-03-17 04:48:34,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 04:48:34,484 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 3582 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3582 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:34,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3582 Valid, 2247 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 04:48:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14969 states. [2025-03-17 04:48:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14969 to 14629. [2025-03-17 04:48:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14629 states, 12996 states have (on average 1.551400430901816) internal successors, (20162), 13062 states have internal predecessors, (20162), 1488 states have call successors, (1488), 144 states have call predecessors, (1488), 144 states have return successors, (1488), 1422 states have call predecessors, (1488), 1488 states have call successors, (1488) [2025-03-17 04:48:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14629 states to 14629 states and 23138 transitions. [2025-03-17 04:48:35,196 INFO L78 Accepts]: Start accepts. Automaton has 14629 states and 23138 transitions. Word has length 491 [2025-03-17 04:48:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:35,198 INFO L471 AbstractCegarLoop]: Abstraction has 14629 states and 23138 transitions. [2025-03-17 04:48:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 15.333333333333334) internal successors, (322), 21 states have internal predecessors, (322), 8 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-17 04:48:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14629 states and 23138 transitions. [2025-03-17 04:48:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:35,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:35,211 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:35,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:48:35,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 04:48:35,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:35,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash -27487724, now seen corresponding path program 1 times [2025-03-17 04:48:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971308303] [2025-03-17 04:48:35,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:35,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:35,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:35,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:35,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971308303] [2025-03-17 04:48:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971308303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:36,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:48:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718564705] [2025-03-17 04:48:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:36,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:48:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:48:36,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:48:36,806 INFO L87 Difference]: Start difference. First operand 14629 states and 23138 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-17 04:48:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:42,604 INFO L93 Difference]: Finished difference Result 89517 states and 140774 transitions. [2025-03-17 04:48:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 04:48:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 491 [2025-03-17 04:48:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:42,786 INFO L225 Difference]: With dead ends: 89517 [2025-03-17 04:48:42,787 INFO L226 Difference]: Without dead ends: 74889 [2025-03-17 04:48:42,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2025-03-17 04:48:42,822 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 2966 mSDsluCounter, 7213 mSDsCounter, 0 mSdLazyCounter, 3353 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2966 SdHoareTripleChecker+Valid, 8385 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 3353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:42,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2966 Valid, 8385 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 3353 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 04:48:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74889 states. [2025-03-17 04:48:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74889 to 36312. [2025-03-17 04:48:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36312 states, 33623 states have (on average 1.5724950182910509) internal successors, (52872), 33758 states have internal predecessors, (52872), 2412 states have call successors, (2412), 276 states have call predecessors, (2412), 276 states have return successors, (2412), 2277 states have call predecessors, (2412), 2412 states have call successors, (2412) [2025-03-17 04:48:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36312 states to 36312 states and 57696 transitions. [2025-03-17 04:48:44,618 INFO L78 Accepts]: Start accepts. Automaton has 36312 states and 57696 transitions. Word has length 491 [2025-03-17 04:48:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 36312 states and 57696 transitions. [2025-03-17 04:48:44,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-17 04:48:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 36312 states and 57696 transitions. [2025-03-17 04:48:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:44,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:44,663 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:48:44,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:44,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1480064085, now seen corresponding path program 1 times [2025-03-17 04:48:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743530652] [2025-03-17 04:48:44,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:44,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:44,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743530652] [2025-03-17 04:48:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743530652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:45,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:48:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815505729] [2025-03-17 04:48:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:45,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:48:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:45,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:48:45,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:45,989 INFO L87 Difference]: Start difference. First operand 36312 states and 57696 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:47,636 INFO L93 Difference]: Finished difference Result 84135 states and 132822 transitions. [2025-03-17 04:48:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:48:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:47,744 INFO L225 Difference]: With dead ends: 84135 [2025-03-17 04:48:47,745 INFO L226 Difference]: Without dead ends: 47824 [2025-03-17 04:48:47,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:48:47,786 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 938 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:47,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1859 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:48:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47824 states. [2025-03-17 04:48:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47824 to 36912. [2025-03-17 04:48:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36912 states, 34133 states have (on average 1.568042656666569) internal successors, (53522), 34272 states have internal predecessors, (53522), 2492 states have call successors, (2492), 286 states have call predecessors, (2492), 286 states have return successors, (2492), 2353 states have call predecessors, (2492), 2492 states have call successors, (2492) [2025-03-17 04:48:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36912 states to 36912 states and 58506 transitions. [2025-03-17 04:48:49,031 INFO L78 Accepts]: Start accepts. Automaton has 36912 states and 58506 transitions. Word has length 491 [2025-03-17 04:48:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:49,032 INFO L471 AbstractCegarLoop]: Abstraction has 36912 states and 58506 transitions. [2025-03-17 04:48:49,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36912 states and 58506 transitions. [2025-03-17 04:48:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:49,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:49,060 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:49,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:48:49,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:49,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1353323212, now seen corresponding path program 1 times [2025-03-17 04:48:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092875736] [2025-03-17 04:48:49,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:49,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:49,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:49,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:49,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092875736] [2025-03-17 04:48:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092875736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535897347] [2025-03-17 04:48:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:49,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:49,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:49,719 INFO L87 Difference]: Start difference. First operand 36912 states and 58506 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:52,101 INFO L93 Difference]: Finished difference Result 85117 states and 133601 transitions. [2025-03-17 04:48:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:52,205 INFO L225 Difference]: With dead ends: 85117 [2025-03-17 04:48:52,205 INFO L226 Difference]: Without dead ends: 48176 [2025-03-17 04:48:52,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:52,250 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 383 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:52,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 916 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:48:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48176 states. [2025-03-17 04:48:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48176 to 26398. [2025-03-17 04:48:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26398 states, 24581 states have (on average 1.5879744518123755) internal successors, (39034), 24646 states have internal predecessors, (39034), 1620 states have call successors, (1620), 196 states have call predecessors, (1620), 196 states have return successors, (1620), 1555 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-03-17 04:48:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26398 states to 26398 states and 42274 transitions. [2025-03-17 04:48:53,560 INFO L78 Accepts]: Start accepts. Automaton has 26398 states and 42274 transitions. Word has length 491 [2025-03-17 04:48:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 26398 states and 42274 transitions. [2025-03-17 04:48:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 26398 states and 42274 transitions. [2025-03-17 04:48:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:53,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:53,579 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:53,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:48:53,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2071357716, now seen corresponding path program 1 times [2025-03-17 04:48:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:53,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856236691] [2025-03-17 04:48:53,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:53,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:53,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:53,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856236691] [2025-03-17 04:48:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856236691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515846778] [2025-03-17 04:48:54,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:54,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:54,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:54,282 INFO L87 Difference]: Start difference. First operand 26398 states and 42274 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:55,401 INFO L93 Difference]: Finished difference Result 67315 states and 107709 transitions. [2025-03-17 04:48:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:55,475 INFO L225 Difference]: With dead ends: 67315 [2025-03-17 04:48:55,475 INFO L226 Difference]: Without dead ends: 40918 [2025-03-17 04:48:55,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:55,522 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 250 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1263 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:48:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40918 states. [2025-03-17 04:48:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40918 to 35382. [2025-03-17 04:48:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35382 states, 33565 states have (on average 1.599195590645017) internal successors, (53677), 33630 states have internal predecessors, (53677), 1620 states have call successors, (1620), 196 states have call predecessors, (1620), 196 states have return successors, (1620), 1555 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-03-17 04:48:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35382 states to 35382 states and 56917 transitions. [2025-03-17 04:48:56,842 INFO L78 Accepts]: Start accepts. Automaton has 35382 states and 56917 transitions. Word has length 491 [2025-03-17 04:48:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:48:56,843 INFO L471 AbstractCegarLoop]: Abstraction has 35382 states and 56917 transitions. [2025-03-17 04:48:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35382 states and 56917 transitions. [2025-03-17 04:48:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:48:56,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:48:56,865 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:48:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:48:56,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:48:56,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:48:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1214601907, now seen corresponding path program 1 times [2025-03-17 04:48:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:48:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178206595] [2025-03-17 04:48:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:48:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:48:56,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:48:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:48:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:48:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:48:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:48:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:48:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178206595] [2025-03-17 04:48:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178206595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:48:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:48:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:48:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922640300] [2025-03-17 04:48:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:48:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:48:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:48:57,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:48:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:48:57,639 INFO L87 Difference]: Start difference. First operand 35382 states and 56917 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:48:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:48:59,422 INFO L93 Difference]: Finished difference Result 104941 states and 169053 transitions. [2025-03-17 04:48:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:48:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:48:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:48:59,544 INFO L225 Difference]: With dead ends: 104941 [2025-03-17 04:48:59,544 INFO L226 Difference]: Without dead ends: 69560 [2025-03-17 04:48:59,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:48:59,607 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 512 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:48:59,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1772 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:48:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69560 states. [2025-03-17 04:49:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69560 to 68644. [2025-03-17 04:49:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68644 states, 65683 states have (on average 1.6053621180518551) internal successors, (105445), 65780 states have internal predecessors, (105445), 2652 states have call successors, (2652), 308 states have call predecessors, (2652), 308 states have return successors, (2652), 2555 states have call predecessors, (2652), 2652 states have call successors, (2652) [2025-03-17 04:49:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68644 states to 68644 states and 110749 transitions. [2025-03-17 04:49:01,498 INFO L78 Accepts]: Start accepts. Automaton has 68644 states and 110749 transitions. Word has length 491 [2025-03-17 04:49:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:49:01,498 INFO L471 AbstractCegarLoop]: Abstraction has 68644 states and 110749 transitions. [2025-03-17 04:49:01,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:49:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 68644 states and 110749 transitions. [2025-03-17 04:49:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-17 04:49:01,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:49:01,531 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:49:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:49:01,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:49:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:49:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 400844147, now seen corresponding path program 1 times [2025-03-17 04:49:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:49:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029361054] [2025-03-17 04:49:01,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:49:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:49:01,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-17 04:49:01,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-17 04:49:01,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:49:01,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:49:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:49:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:49:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029361054] [2025-03-17 04:49:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029361054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:49:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:49:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:49:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417723664] [2025-03-17 04:49:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:49:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:49:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:49:02,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:49:02,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:49:02,370 INFO L87 Difference]: Start difference. First operand 68644 states and 110749 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:49:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:49:03,930 INFO L93 Difference]: Finished difference Result 130696 states and 209971 transitions. [2025-03-17 04:49:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:49:03,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 491 [2025-03-17 04:49:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:49:04,037 INFO L225 Difference]: With dead ends: 130696 [2025-03-17 04:49:04,037 INFO L226 Difference]: Without dead ends: 62053 [2025-03-17 04:49:04,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:49:04,109 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 463 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:49:04,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1058 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:49:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62053 states. [2025-03-17 04:49:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62053 to 32101. [2025-03-17 04:49:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32101 states, 29812 states have (on average 1.573326177378237) internal successors, (46904), 29876 states have internal predecessors, (46904), 2064 states have call successors, (2064), 224 states have call predecessors, (2064), 224 states have return successors, (2064), 2000 states have call predecessors, (2064), 2064 states have call successors, (2064) [2025-03-17 04:49:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32101 states to 32101 states and 51032 transitions. [2025-03-17 04:49:05,279 INFO L78 Accepts]: Start accepts. Automaton has 32101 states and 51032 transitions. Word has length 491 [2025-03-17 04:49:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:49:05,280 INFO L471 AbstractCegarLoop]: Abstraction has 32101 states and 51032 transitions. [2025-03-17 04:49:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:49:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32101 states and 51032 transitions. [2025-03-17 04:49:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 04:49:05,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:49:05,291 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:49:05,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:49:05,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:49:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:49:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 220921392, now seen corresponding path program 1 times [2025-03-17 04:49:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:49:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936853057] [2025-03-17 04:49:05,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:49:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:49:05,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 04:49:05,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 04:49:05,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:49:05,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:49:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-17 04:49:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:49:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936853057] [2025-03-17 04:49:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936853057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:49:06,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:49:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:49:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189350583] [2025-03-17 04:49:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:49:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:49:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:49:06,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:49:06,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:49:06,459 INFO L87 Difference]: Start difference. First operand 32101 states and 51032 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:49:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:49:09,733 INFO L93 Difference]: Finished difference Result 95497 states and 151260 transitions. [2025-03-17 04:49:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:49:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 492 [2025-03-17 04:49:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:49:09,835 INFO L225 Difference]: With dead ends: 95497 [2025-03-17 04:49:09,835 INFO L226 Difference]: Without dead ends: 63397 [2025-03-17 04:49:09,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:49:09,867 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 2192 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:49:09,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 3137 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:49:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63397 states. [2025-03-17 04:49:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63397 to 41513. [2025-03-17 04:49:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41513 states, 39080 states have (on average 1.5785568065506652) internal successors, (61690), 39168 states have internal predecessors, (61690), 2184 states have call successors, (2184), 248 states have call predecessors, (2184), 248 states have return successors, (2184), 2096 states have call predecessors, (2184), 2184 states have call successors, (2184) [2025-03-17 04:49:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41513 states to 41513 states and 66058 transitions. [2025-03-17 04:49:11,370 INFO L78 Accepts]: Start accepts. Automaton has 41513 states and 66058 transitions. Word has length 492 [2025-03-17 04:49:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:49:11,371 INFO L471 AbstractCegarLoop]: Abstraction has 41513 states and 66058 transitions. [2025-03-17 04:49:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-17 04:49:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 41513 states and 66058 transitions. [2025-03-17 04:49:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 04:49:11,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:49:11,388 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:49:11,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:49:11,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:49:11,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:49:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1728473201, now seen corresponding path program 1 times [2025-03-17 04:49:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:49:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609096037] [2025-03-17 04:49:11,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:49:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:49:11,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 04:49:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 04:49:12,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:49:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:49:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 66 proven. 150 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-17 04:49:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:49:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609096037] [2025-03-17 04:49:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609096037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:49:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237939941] [2025-03-17 04:49:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:49:13,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:49:13,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:49:13,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:49:13,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:49:13,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 04:49:13,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 04:49:13,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:49:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:49:13,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 04:49:13,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:49:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4516 proven. 150 refuted. 0 times theorem prover too weak. 5846 trivial. 0 not checked. [2025-03-17 04:49:14,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:49:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 66 proven. 150 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-17 04:49:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237939941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:49:15,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:49:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2025-03-17 04:49:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042800122] [2025-03-17 04:49:15,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:49:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 04:49:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:49:15,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 04:49:15,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:49:15,232 INFO L87 Difference]: Start difference. First operand 41513 states and 66058 transitions. Second operand has 19 states, 19 states have (on average 16.789473684210527) internal successors, (319), 19 states have internal predecessors, (319), 5 states have call successors, (196), 3 states have call predecessors, (196), 6 states have return successors, (197), 5 states have call predecessors, (197), 5 states have call successors, (197)