./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label00.c -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 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:49:57,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:49:57,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:49:57,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:49:57,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:49:57,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:49:57,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:49:57,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:49:57,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:49:57,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:49:57,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:49:57,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:49:57,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:49:57,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:49:57,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:49:57,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:49:57,744 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 -> 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 [2025-03-08 01:49:57,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:49:57,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:49:58,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:49:58,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:49:58,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:49:58,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2025-03-08 01:49:59,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175493da7/f60c28d7cd764d7ea2346a335e66bbab/FLAG8e6ee6be7 [2025-03-08 01:49:59,675 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:49:59,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2025-03-08 01:49:59,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175493da7/f60c28d7cd764d7ea2346a335e66bbab/FLAG8e6ee6be7 [2025-03-08 01:49:59,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175493da7/f60c28d7cd764d7ea2346a335e66bbab [2025-03-08 01:49:59,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:49:59,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:49:59,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:49:59,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:49:59,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:49:59,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:49:59" (1/1) ... [2025-03-08 01:49:59,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c06c6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:59, skipping insertion in model container [2025-03-08 01:49:59,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:49:59" (1/1) ... [2025-03-08 01:49:59,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:50:00,028 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/eca-rers2012/Problem13_label00.c[5434,5447] [2025-03-08 01:50:00,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:50:00,562 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:50:00,577 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/eca-rers2012/Problem13_label00.c[5434,5447] [2025-03-08 01:50:00,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:50:00,875 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:50:00,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00 WrapperNode [2025-03-08 01:50:00,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:50:00,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:50:00,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:50:00,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:50:00,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:00,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,252 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:50:01,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:50:01,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:50:01,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:50:01,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:50:01,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:50:01,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:50:01,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:50:01,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:50:01,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:50:01,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (1/1) ... [2025-03-08 01:50:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:50:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:50:01,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:50:01,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:50:01,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:50:01,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:50:01,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:50:01,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:50:01,892 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:50:01,894 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:50:05,930 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:50:05,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:50:05,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:50:06,131 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:50:06,131 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:50:06,157 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:50:06,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:50:06,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:06 BoogieIcfgContainer [2025-03-08 01:50:06,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:50:06,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:50:06,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:50:06,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:50:06,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:49:59" (1/3) ... [2025-03-08 01:50:06,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280beade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:06, skipping insertion in model container [2025-03-08 01:50:06,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:00" (2/3) ... [2025-03-08 01:50:06,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280beade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:06, skipping insertion in model container [2025-03-08 01:50:06,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:06" (3/3) ... [2025-03-08 01:50:06,167 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label00.c [2025-03-08 01:50:06,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:50:06,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label00.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:50:06,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:50:06,263 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;@39f6a19a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:50:06,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:50:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 01:50:06,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:06,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:06,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:06,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2075515484, now seen corresponding path program 1 times [2025-03-08 01:50:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517094507] [2025-03-08 01:50:06,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 01:50:06,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 01:50:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:06,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517094507] [2025-03-08 01:50:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517094507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781162487] [2025-03-08 01:50:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:50:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:06,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:50:06,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:06,808 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:11,829 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-03-08 01:50:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:50:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 01:50:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:11,846 INFO L225 Difference]: With dead ends: 3829 [2025-03-08 01:50:11,846 INFO L226 Difference]: Without dead ends: 2664 [2025-03-08 01:50:11,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:50:11,851 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2719 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2719 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:11,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2719 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 01:50:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-08 01:50:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-03-08 01:50:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-03-08 01:50:11,940 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 37 [2025-03-08 01:50:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:11,940 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-03-08 01:50:11,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-03-08 01:50:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 01:50:11,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:11,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:50:11,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2136037161, now seen corresponding path program 1 times [2025-03-08 01:50:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486827710] [2025-03-08 01:50:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 01:50:11,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 01:50:11,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:11,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:12,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486827710] [2025-03-08 01:50:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486827710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:12,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521592135] [2025-03-08 01:50:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:12,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:50:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:12,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:50:12,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:12,247 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:18,287 INFO L93 Difference]: Finished difference Result 7866 states and 12670 transitions. [2025-03-08 01:50:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:50:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-03-08 01:50:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:18,305 INFO L225 Difference]: With dead ends: 7866 [2025-03-08 01:50:18,305 INFO L226 Difference]: Without dead ends: 5992 [2025-03-08 01:50:18,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:18,308 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1721 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5285 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 5285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:18,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1070 Invalid, 6127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 5285 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-08 01:50:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-08 01:50:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5859. [2025-03-08 01:50:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5858 states have (on average 1.4453738477296005) internal successors, (8467), 5858 states have internal predecessors, (8467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8467 transitions. [2025-03-08 01:50:18,390 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8467 transitions. Word has length 162 [2025-03-08 01:50:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:18,392 INFO L471 AbstractCegarLoop]: Abstraction has 5859 states and 8467 transitions. [2025-03-08 01:50:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8467 transitions. [2025-03-08 01:50:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 01:50:18,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:18,395 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:18,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:50:18,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:18,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 251587401, now seen corresponding path program 1 times [2025-03-08 01:50:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513601300] [2025-03-08 01:50:18,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:18,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 01:50:18,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 01:50:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 01:50:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513601300] [2025-03-08 01:50:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513601300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99220643] [2025-03-08 01:50:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:18,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:18,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:18,590 INFO L87 Difference]: Start difference. First operand 5859 states and 8467 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:21,800 INFO L93 Difference]: Finished difference Result 15685 states and 23392 transitions. [2025-03-08 01:50:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-03-08 01:50:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:21,832 INFO L225 Difference]: With dead ends: 15685 [2025-03-08 01:50:21,833 INFO L226 Difference]: Without dead ends: 10615 [2025-03-08 01:50:21,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:21,844 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 918 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:21,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 917 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 01:50:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10615 states. [2025-03-08 01:50:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10615 to 10608. [2025-03-08 01:50:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3553313849344772) internal successors, (14376), 10607 states have internal predecessors, (14376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 14376 transitions. [2025-03-08 01:50:21,996 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 14376 transitions. Word has length 204 [2025-03-08 01:50:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:21,997 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 14376 transitions. [2025-03-08 01:50:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 14376 transitions. [2025-03-08 01:50:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 01:50:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:22,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:50:22,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2096496208, now seen corresponding path program 1 times [2025-03-08 01:50:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684060457] [2025-03-08 01:50:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:22,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 01:50:22,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 01:50:22,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:22,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:50:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684060457] [2025-03-08 01:50:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684060457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:22,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844530268] [2025-03-08 01:50:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:22,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:22,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:22,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:22,282 INFO L87 Difference]: Start difference. First operand 10608 states and 14376 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:25,031 INFO L93 Difference]: Finished difference Result 28349 states and 39245 transitions. [2025-03-08 01:50:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-08 01:50:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:25,076 INFO L225 Difference]: With dead ends: 28349 [2025-03-08 01:50:25,077 INFO L226 Difference]: Without dead ends: 18530 [2025-03-08 01:50:25,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:25,091 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 907 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:25,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 616 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:50:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18530 states. [2025-03-08 01:50:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18530 to 18523. [2025-03-08 01:50:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18523 states, 18522 states have (on average 1.3251268761472843) internal successors, (24544), 18522 states have internal predecessors, (24544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 24544 transitions. [2025-03-08 01:50:25,363 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 24544 transitions. Word has length 218 [2025-03-08 01:50:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:25,363 INFO L471 AbstractCegarLoop]: Abstraction has 18523 states and 24544 transitions. [2025-03-08 01:50:25,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 24544 transitions. [2025-03-08 01:50:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-08 01:50:25,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:25,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:50:25,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 254995923, now seen corresponding path program 1 times [2025-03-08 01:50:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292505685] [2025-03-08 01:50:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 01:50:25,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 01:50:25,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292505685] [2025-03-08 01:50:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292505685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:25,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087845456] [2025-03-08 01:50:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:25,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:25,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:25,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:25,800 INFO L87 Difference]: Start difference. First operand 18523 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:29,098 INFO L93 Difference]: Finished difference Result 52015 states and 69799 transitions. [2025-03-08 01:50:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:29,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-03-08 01:50:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:29,159 INFO L225 Difference]: With dead ends: 52015 [2025-03-08 01:50:29,159 INFO L226 Difference]: Without dead ends: 34281 [2025-03-08 01:50:29,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:29,182 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 845 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:29,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 946 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 01:50:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2025-03-08 01:50:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 34271. [2025-03-08 01:50:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34271 states, 34270 states have (on average 1.25503355704698) internal successors, (43010), 34270 states have internal predecessors, (43010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34271 states to 34271 states and 43010 transitions. [2025-03-08 01:50:29,589 INFO L78 Accepts]: Start accepts. Automaton has 34271 states and 43010 transitions. Word has length 244 [2025-03-08 01:50:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:29,590 INFO L471 AbstractCegarLoop]: Abstraction has 34271 states and 43010 transitions. [2025-03-08 01:50:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 34271 states and 43010 transitions. [2025-03-08 01:50:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 01:50:29,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:29,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:29,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:50:29,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:29,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1485238653, now seen corresponding path program 1 times [2025-03-08 01:50:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940606309] [2025-03-08 01:50:29,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:29,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 01:50:29,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 01:50:29,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:29,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:29,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940606309] [2025-03-08 01:50:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940606309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658785162] [2025-03-08 01:50:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:29,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:29,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:29,876 INFO L87 Difference]: Start difference. First operand 34271 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:32,720 INFO L93 Difference]: Finished difference Result 81153 states and 101192 transitions. [2025-03-08 01:50:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:32,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-08 01:50:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:32,811 INFO L225 Difference]: With dead ends: 81153 [2025-03-08 01:50:32,811 INFO L226 Difference]: Without dead ends: 47671 [2025-03-08 01:50:32,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:32,847 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 974 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:32,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1448 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:50:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47671 states. [2025-03-08 01:50:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47671 to 47649. [2025-03-08 01:50:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47649 states, 47648 states have (on average 1.2083193418401612) internal successors, (57574), 47648 states have internal predecessors, (57574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47649 states to 47649 states and 57574 transitions. [2025-03-08 01:50:33,293 INFO L78 Accepts]: Start accepts. Automaton has 47649 states and 57574 transitions. Word has length 258 [2025-03-08 01:50:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:33,294 INFO L471 AbstractCegarLoop]: Abstraction has 47649 states and 57574 transitions. [2025-03-08 01:50:33,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 47649 states and 57574 transitions. [2025-03-08 01:50:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-08 01:50:33,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:33,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:33,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:50:33,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:33,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash 855705726, now seen corresponding path program 1 times [2025-03-08 01:50:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:33,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702684786] [2025-03-08 01:50:33,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:33,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-08 01:50:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-08 01:50:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 01:50:33,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:33,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702684786] [2025-03-08 01:50:33,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702684786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:33,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713431730] [2025-03-08 01:50:33,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:33,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:50:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:33,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:50:33,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:33,613 INFO L87 Difference]: Start difference. First operand 47649 states and 57574 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:39,132 INFO L93 Difference]: Finished difference Result 127792 states and 156476 transitions. [2025-03-08 01:50:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:50:39,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2025-03-08 01:50:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:39,374 INFO L225 Difference]: With dead ends: 127792 [2025-03-08 01:50:39,374 INFO L226 Difference]: Without dead ends: 80932 [2025-03-08 01:50:39,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:39,393 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1741 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6064 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:39,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 748 Invalid, 7251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6064 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 01:50:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80932 states. [2025-03-08 01:50:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80932 to 80806. [2025-03-08 01:50:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80806 states, 80805 states have (on average 1.2057545943939112) internal successors, (97431), 80805 states have internal predecessors, (97431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80806 states to 80806 states and 97431 transitions. [2025-03-08 01:50:40,020 INFO L78 Accepts]: Start accepts. Automaton has 80806 states and 97431 transitions. Word has length 331 [2025-03-08 01:50:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:40,020 INFO L471 AbstractCegarLoop]: Abstraction has 80806 states and 97431 transitions. [2025-03-08 01:50:40,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 80806 states and 97431 transitions. [2025-03-08 01:50:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 01:50:40,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:40,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:40,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:50:40,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:40,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash -246151071, now seen corresponding path program 1 times [2025-03-08 01:50:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:40,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791716239] [2025-03-08 01:50:40,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:40,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:40,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 01:50:40,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 01:50:40,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:50:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791716239] [2025-03-08 01:50:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791716239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:40,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003297823] [2025-03-08 01:50:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:40,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:40,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:40,322 INFO L87 Difference]: Start difference. First operand 80806 states and 97431 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:44,165 INFO L93 Difference]: Finished difference Result 182871 states and 223441 transitions. [2025-03-08 01:50:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:44,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2025-03-08 01:50:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:44,292 INFO L225 Difference]: With dead ends: 182871 [2025-03-08 01:50:44,292 INFO L226 Difference]: Without dead ends: 102854 [2025-03-08 01:50:44,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:44,349 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 915 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 917 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 917 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:44,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 857 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [917 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:50:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102854 states. [2025-03-08 01:50:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102854 to 102833. [2025-03-08 01:50:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102833 states, 102832 states have (on average 1.2054127119962657) internal successors, (123955), 102832 states have internal predecessors, (123955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102833 states to 102833 states and 123955 transitions. [2025-03-08 01:50:45,505 INFO L78 Accepts]: Start accepts. Automaton has 102833 states and 123955 transitions. Word has length 333 [2025-03-08 01:50:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 102833 states and 123955 transitions. [2025-03-08 01:50:45,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 102833 states and 123955 transitions. [2025-03-08 01:50:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-08 01:50:45,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:45,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:45,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:50:45,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:45,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1124200351, now seen corresponding path program 1 times [2025-03-08 01:50:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592726113] [2025-03-08 01:50:45,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:45,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-08 01:50:45,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-08 01:50:45,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592726113] [2025-03-08 01:50:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592726113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112091505] [2025-03-08 01:50:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:45,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:45,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:45,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:45,834 INFO L87 Difference]: Start difference. First operand 102833 states and 123955 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:48,843 INFO L93 Difference]: Finished difference Result 204064 states and 246108 transitions. [2025-03-08 01:50:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-03-08 01:50:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:48,983 INFO L225 Difference]: With dead ends: 204064 [2025-03-08 01:50:48,983 INFO L226 Difference]: Without dead ends: 102020 [2025-03-08 01:50:49,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:49,042 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 943 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:49,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1666 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:50:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102020 states. [2025-03-08 01:50:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102020 to 102011. [2025-03-08 01:50:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102011 states, 102010 states have (on average 1.1385452406626801) internal successors, (116143), 102010 states have internal predecessors, (116143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102011 states to 102011 states and 116143 transitions. [2025-03-08 01:50:50,342 INFO L78 Accepts]: Start accepts. Automaton has 102011 states and 116143 transitions. Word has length 340 [2025-03-08 01:50:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:50,342 INFO L471 AbstractCegarLoop]: Abstraction has 102011 states and 116143 transitions. [2025-03-08 01:50:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 102011 states and 116143 transitions. [2025-03-08 01:50:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-08 01:50:50,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:50,348 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:50:50,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash -742774692, now seen corresponding path program 1 times [2025-03-08 01:50:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967261689] [2025-03-08 01:50:50,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 01:50:50,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 01:50:50,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:50,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 01:50:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:50,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967261689] [2025-03-08 01:50:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967261689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:50,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094060881] [2025-03-08 01:50:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:50,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:50,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:50,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:50,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:50,758 INFO L87 Difference]: Start difference. First operand 102011 states and 116143 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:54,259 INFO L93 Difference]: Finished difference Result 188311 states and 215780 transitions. [2025-03-08 01:50:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-08 01:50:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:54,387 INFO L225 Difference]: With dead ends: 188311 [2025-03-08 01:50:54,388 INFO L226 Difference]: Without dead ends: 102053 [2025-03-08 01:50:54,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:54,441 INFO L435 NwaCegarLoop]: 1873 mSDtfsCounter, 741 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:54,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2013 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 01:50:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102053 states. [2025-03-08 01:50:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102053 to 102012. [2025-03-08 01:50:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102012 states, 102011 states have (on average 1.1325641352403173) internal successors, (115534), 102011 states have internal predecessors, (115534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102012 states to 102012 states and 115534 transitions. [2025-03-08 01:50:55,733 INFO L78 Accepts]: Start accepts. Automaton has 102012 states and 115534 transitions. Word has length 346 [2025-03-08 01:50:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 102012 states and 115534 transitions. [2025-03-08 01:50:55,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 102012 states and 115534 transitions. [2025-03-08 01:50:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 01:50:55,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:55,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:55,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:50:55,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:55,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1955332186, now seen corresponding path program 1 times [2025-03-08 01:50:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368990500] [2025-03-08 01:50:55,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:55,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 01:50:55,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 01:50:55,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:55,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 01:50:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368990500] [2025-03-08 01:50:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368990500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:55,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:55,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654989441] [2025-03-08 01:50:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:55,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:55,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:55,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:55,960 INFO L87 Difference]: Start difference. First operand 102012 states and 115534 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:59,269 INFO L93 Difference]: Finished difference Result 267749 states and 305110 transitions. [2025-03-08 01:50:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 369 [2025-03-08 01:50:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:59,455 INFO L225 Difference]: With dead ends: 267749 [2025-03-08 01:50:59,455 INFO L226 Difference]: Without dead ends: 162586 [2025-03-08 01:50:59,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:59,516 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 810 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 862 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 862 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:59,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1056 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [862 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:50:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162586 states. [2025-03-08 01:51:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162586 to 152337. [2025-03-08 01:51:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152337 states, 152336 states have (on average 1.107328536918391) internal successors, (168686), 152336 states have internal predecessors, (168686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152337 states to 152337 states and 168686 transitions. [2025-03-08 01:51:01,130 INFO L78 Accepts]: Start accepts. Automaton has 152337 states and 168686 transitions. Word has length 369 [2025-03-08 01:51:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 152337 states and 168686 transitions. [2025-03-08 01:51:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 152337 states and 168686 transitions. [2025-03-08 01:51:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 01:51:01,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:01,133 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:01,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:51:01,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1808132261, now seen corresponding path program 1 times [2025-03-08 01:51:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858523055] [2025-03-08 01:51:01,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:01,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 01:51:01,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 01:51:01,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 262 proven. 113 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 01:51:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858523055] [2025-03-08 01:51:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858523055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:51:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887974712] [2025-03-08 01:51:02,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:51:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:51:02,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:51:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:51:02,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 01:51:02,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 01:51:02,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:02,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:02,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:51:02,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:51:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 01:51:02,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:51:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887974712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:51:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:51:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706620313] [2025-03-08 01:51:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:02,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:02,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:51:02,661 INFO L87 Difference]: Start difference. First operand 152337 states and 168686 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:06,028 INFO L93 Difference]: Finished difference Result 301521 states and 333816 transitions. [2025-03-08 01:51:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 375 [2025-03-08 01:51:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:06,221 INFO L225 Difference]: With dead ends: 301521 [2025-03-08 01:51:06,221 INFO L226 Difference]: Without dead ends: 149973 [2025-03-08 01:51:06,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:51:06,277 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 1100 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:06,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1418 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:51:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149973 states. [2025-03-08 01:51:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149973 to 149181. [2025-03-08 01:51:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149181 states, 149180 states have (on average 1.081311167716852) internal successors, (161310), 149180 states have internal predecessors, (161310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149181 states to 149181 states and 161310 transitions. [2025-03-08 01:51:07,873 INFO L78 Accepts]: Start accepts. Automaton has 149181 states and 161310 transitions. Word has length 375 [2025-03-08 01:51:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 149181 states and 161310 transitions. [2025-03-08 01:51:07,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 149181 states and 161310 transitions. [2025-03-08 01:51:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 01:51:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:07,877 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:07,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 01:51:08,078 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,SelfDestructingSolverStorable11 [2025-03-08 01:51:08,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1331990586, now seen corresponding path program 1 times [2025-03-08 01:51:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869923684] [2025-03-08 01:51:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:08,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 01:51:08,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 01:51:08,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:08,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 01:51:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869923684] [2025-03-08 01:51:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869923684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:08,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:08,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:08,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304072407] [2025-03-08 01:51:08,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:08,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:08,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:08,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:08,601 INFO L87 Difference]: Start difference. First operand 149181 states and 161310 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:12,592 INFO L93 Difference]: Finished difference Result 318106 states and 343822 transitions. [2025-03-08 01:51:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-08 01:51:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:12,786 INFO L225 Difference]: With dead ends: 318106 [2025-03-08 01:51:12,786 INFO L226 Difference]: Without dead ends: 169714 [2025-03-08 01:51:12,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:12,859 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 844 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:12,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1787 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:51:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169714 states. [2025-03-08 01:51:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169714 to 158634. [2025-03-08 01:51:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158634 states, 158633 states have (on average 1.077537460679682) internal successors, (170933), 158633 states have internal predecessors, (170933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158634 states to 158634 states and 170933 transitions. [2025-03-08 01:51:14,593 INFO L78 Accepts]: Start accepts. Automaton has 158634 states and 170933 transitions. Word has length 392 [2025-03-08 01:51:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:14,594 INFO L471 AbstractCegarLoop]: Abstraction has 158634 states and 170933 transitions. [2025-03-08 01:51:14,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 158634 states and 170933 transitions. [2025-03-08 01:51:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 01:51:14,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:14,601 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:14,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:51:14,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:14,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1717037750, now seen corresponding path program 1 times [2025-03-08 01:51:14,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:14,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819061731] [2025-03-08 01:51:14,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:14,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 01:51:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 01:51:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:51:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819061731] [2025-03-08 01:51:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819061731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524019116] [2025-03-08 01:51:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:15,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:15,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:15,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:15,049 INFO L87 Difference]: Start difference. First operand 158634 states and 170933 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:18,564 INFO L93 Difference]: Finished difference Result 351127 states and 379889 transitions. [2025-03-08 01:51:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2025-03-08 01:51:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:18,830 INFO L225 Difference]: With dead ends: 351127 [2025-03-08 01:51:18,830 INFO L226 Difference]: Without dead ends: 191708 [2025-03-08 01:51:18,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:18,924 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 745 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:18,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1880 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:51:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191708 states. [2025-03-08 01:51:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191708 to 188541. [2025-03-08 01:51:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188541 states, 188540 states have (on average 1.0686803861249603) internal successors, (201489), 188540 states have internal predecessors, (201489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188541 states to 188541 states and 201489 transitions. [2025-03-08 01:51:20,875 INFO L78 Accepts]: Start accepts. Automaton has 188541 states and 201489 transitions. Word has length 468 [2025-03-08 01:51:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:20,875 INFO L471 AbstractCegarLoop]: Abstraction has 188541 states and 201489 transitions. [2025-03-08 01:51:20,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 188541 states and 201489 transitions. [2025-03-08 01:51:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 01:51:20,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:20,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:51:20,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1469862747, now seen corresponding path program 1 times [2025-03-08 01:51:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113558528] [2025-03-08 01:51:20,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:20,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 01:51:20,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 01:51:20,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:20,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:51:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113558528] [2025-03-08 01:51:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113558528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235356288] [2025-03-08 01:51:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:21,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:21,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:21,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:21,653 INFO L87 Difference]: Start difference. First operand 188541 states and 201489 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)