./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.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 680347fc0ab3969916196edd845410ec8bd6ad683a6867b166f5af5e8c328a99 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:34:42,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:34:42,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:34:42,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:34:42,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:34:42,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:34:42,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:34:42,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:34:42,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:34:42,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:34:42,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:34:42,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:34:42,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:34:42,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:34:42,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:34:42,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:34:42,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:34:42,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:42,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:34:42,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:34:42,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:34:42,816 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 -> 680347fc0ab3969916196edd845410ec8bd6ad683a6867b166f5af5e8c328a99 [2025-03-16 20:34:43,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:34:43,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:34:43,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:34:43,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:34:43,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:34:43,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-03-16 20:34:44,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed10608/5ac1fa0a9a6f44d89b8fc3c89c53f1b4/FLAG0e29b8968 [2025-03-16 20:34:44,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:34:44,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-03-16 20:34:44,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed10608/5ac1fa0a9a6f44d89b8fc3c89c53f1b4/FLAG0e29b8968 [2025-03-16 20:34:44,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed10608/5ac1fa0a9a6f44d89b8fc3c89c53f1b4 [2025-03-16 20:34:44,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:34:44,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:34:44,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:44,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:34:44,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:34:44,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:44" (1/1) ... [2025-03-16 20:34:44,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e27fb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:44, skipping insertion in model container [2025-03-16 20:34:44,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:34:44" (1/1) ... [2025-03-16 20:34:44,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:34:45,081 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c[20426,20439] [2025-03-16 20:34:45,138 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c[28174,28187] [2025-03-16 20:34:45,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:45,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:34:45,548 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c[20426,20439] [2025-03-16 20:34:45,558 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c[28174,28187] [2025-03-16 20:34:45,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:45,811 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:34:45,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45 WrapperNode [2025-03-16 20:34:45,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:45,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:45,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:34:45,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:34:45,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:45,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,098 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2025-03-16 20:34:46,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:46,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:34:46,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:34:46,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:34:46,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,298 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-16 20:34:46,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:34:46,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:34:46,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:34:46,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:34:46,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (1/1) ... [2025-03-16 20:34:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:34:46,487 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-16 20:34:46,493 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-16 20:34:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:34:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:34:46,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:34:46,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:34:46,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:34:46,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:34:49,880 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc calculate_output_#t~ret46#1; [2025-03-16 20:34:49,881 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3764: havoc calculate_output2_#t~ret47#1; [2025-03-16 20:34:49,881 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5254: havoc calculate_output3_#t~ret48#1; [2025-03-16 20:34:50,036 INFO L? ?]: Removed 751 outVars from TransFormulas that were not future-live. [2025-03-16 20:34:50,036 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:34:50,068 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:34:50,068 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:34:50,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:50 BoogieIcfgContainer [2025-03-16 20:34:50,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:34:50,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:34:50,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:34:50,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:34:50,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:34:44" (1/3) ... [2025-03-16 20:34:50,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c2942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:50, skipping insertion in model container [2025-03-16 20:34:50,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:45" (2/3) ... [2025-03-16 20:34:50,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c2942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:50, skipping insertion in model container [2025-03-16 20:34:50,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:50" (3/3) ... [2025-03-16 20:34:50,075 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-03-16 20:34:50,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:34:50,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label09.c that has 1 procedures, 865 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:34:50,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:34:50,173 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;@1e057055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:34:50,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:34:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 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-16 20:34:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:34:50,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:50,187 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] [2025-03-16 20:34:50,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:50,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1170770383, now seen corresponding path program 1 times [2025-03-16 20:34:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:50,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312102807] [2025-03-16 20:34:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:34:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:34:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:50,414 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-16 20:34:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312102807] [2025-03-16 20:34:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312102807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:34:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388614661] [2025-03-16 20:34:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:50,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:34:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:50,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:34:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:34:50,433 INFO L87 Difference]: Start difference. First operand has 865 states, 862 states have (on average 1.9698375870069607) internal successors, (1698), 864 states have internal predecessors, (1698), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-16 20:34:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:50,500 INFO L93 Difference]: Finished difference Result 1676 states and 3290 transitions. [2025-03-16 20:34:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:34:50,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2025-03-16 20:34:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:50,511 INFO L225 Difference]: With dead ends: 1676 [2025-03-16 20:34:50,511 INFO L226 Difference]: Without dead ends: 861 [2025-03-16 20:34:50,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:34:50,519 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:50,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-16 20:34:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-16 20:34:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.8963911525029105) internal successors, (1629), 860 states have internal predecessors, (1629), 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-16 20:34:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1629 transitions. [2025-03-16 20:34:50,575 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1629 transitions. Word has length 25 [2025-03-16 20:34:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:50,575 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1629 transitions. [2025-03-16 20:34:50,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-16 20:34:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1629 transitions. [2025-03-16 20:34:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:34:50,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:50,576 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] [2025-03-16 20:34:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:34:50,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:50,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1382121296, now seen corresponding path program 1 times [2025-03-16 20:34:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815624449] [2025-03-16 20:34:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:50,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:34:50,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:34:50,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:50,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:50,838 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-16 20:34:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815624449] [2025-03-16 20:34:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815624449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:34:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943600084] [2025-03-16 20:34:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:50,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:50,841 INFO L87 Difference]: Start difference. First operand 861 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-16 20:34:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:50,932 INFO L93 Difference]: Finished difference Result 917 states and 1718 transitions. [2025-03-16 20:34:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2025-03-16 20:34:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:50,936 INFO L225 Difference]: With dead ends: 917 [2025-03-16 20:34:50,936 INFO L226 Difference]: Without dead ends: 861 [2025-03-16 20:34:50,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:50,937 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 0 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:50,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4830 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-16 20:34:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2025-03-16 20:34:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.838183934807916) internal successors, (1579), 860 states have internal predecessors, (1579), 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-16 20:34:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1579 transitions. [2025-03-16 20:34:50,956 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1579 transitions. Word has length 25 [2025-03-16 20:34:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1579 transitions. [2025-03-16 20:34:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-16 20:34:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1579 transitions. [2025-03-16 20:34:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:34:50,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:50,958 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, 1, 1, 1, 1, 1, 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-16 20:34:50,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:34:50,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -491279422, now seen corresponding path program 1 times [2025-03-16 20:34:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:50,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342668515] [2025-03-16 20:34:50,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:50,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:34:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:34:50,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:51,186 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-16 20:34:51,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342668515] [2025-03-16 20:34:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342668515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109243150] [2025-03-16 20:34:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:51,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:51,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:51,187 INFO L87 Difference]: Start difference. First operand 861 states and 1579 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-16 20:34:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:55,766 INFO L93 Difference]: Finished difference Result 3116 states and 5888 transitions. [2025-03-16 20:34:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2025-03-16 20:34:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:55,776 INFO L225 Difference]: With dead ends: 3116 [2025-03-16 20:34:55,776 INFO L226 Difference]: Without dead ends: 2363 [2025-03-16 20:34:55,777 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-16 20:34:55,780 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 2460 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:55,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 833 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 20:34:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-03-16 20:34:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-03-16 20:34:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.5641677255400255) internal successors, (3693), 2362 states have internal predecessors, (3693), 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-16 20:34:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3693 transitions. [2025-03-16 20:34:55,827 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3693 transitions. Word has length 66 [2025-03-16 20:34:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:55,827 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3693 transitions. [2025-03-16 20:34:55,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-16 20:34:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3693 transitions. [2025-03-16 20:34:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:34:55,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:55,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:55,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:34:55,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1833953211, now seen corresponding path program 1 times [2025-03-16 20:34:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751637517] [2025-03-16 20:34:55,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:55,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:34:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:34:55,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:56,034 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-16 20:34:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751637517] [2025-03-16 20:34:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751637517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:56,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808825637] [2025-03-16 20:34:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:56,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:56,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:56,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:56,036 INFO L87 Difference]: Start difference. First operand 2363 states and 3693 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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-16 20:34:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:56,326 INFO L93 Difference]: Finished difference Result 3105 states and 4897 transitions. [2025-03-16 20:34:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:34:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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 74 [2025-03-16 20:34:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:56,337 INFO L225 Difference]: With dead ends: 3105 [2025-03-16 20:34:56,337 INFO L226 Difference]: Without dead ends: 3052 [2025-03-16 20:34:56,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:34:56,339 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 11475 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 5085 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:56,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 5085 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-16 20:34:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2414. [2025-03-16 20:34:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5655058043117744) internal successors, (3776), 2413 states have internal predecessors, (3776), 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-16 20:34:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3776 transitions. [2025-03-16 20:34:56,391 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3776 transitions. Word has length 74 [2025-03-16 20:34:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:56,392 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3776 transitions. [2025-03-16 20:34:56,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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-16 20:34:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3776 transitions. [2025-03-16 20:34:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:56,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:56,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:34:56,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1455262201, now seen corresponding path program 1 times [2025-03-16 20:34:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620550840] [2025-03-16 20:34:56,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:56,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:56,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:56,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:56,811 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-16 20:34:56,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:56,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620550840] [2025-03-16 20:34:56,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620550840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:56,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:56,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380352284] [2025-03-16 20:34:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:56,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:56,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:56,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:56,813 INFO L87 Difference]: Start difference. First operand 2414 states and 3776 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-16 20:34:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,058 INFO L93 Difference]: Finished difference Result 2520 states and 3946 transitions. [2025-03-16 20:34:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 76 [2025-03-16 20:34:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,066 INFO L225 Difference]: With dead ends: 2520 [2025-03-16 20:34:57,066 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 20:34:57,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:34:57,067 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 7545 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7545 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7545 Valid, 2068 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 20:34:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2414. [2025-03-16 20:34:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5650912106135986) internal successors, (3775), 2413 states have internal predecessors, (3775), 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-16 20:34:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3775 transitions. [2025-03-16 20:34:57,106 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3775 transitions. Word has length 76 [2025-03-16 20:34:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3775 transitions. [2025-03-16 20:34:57,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-16 20:34:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3775 transitions. [2025-03-16 20:34:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:57,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:57,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:57,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:34:57,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1456304886, now seen corresponding path program 1 times [2025-03-16 20:34:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761021396] [2025-03-16 20:34:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:57,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:57,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:57,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:57,186 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-16 20:34:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761021396] [2025-03-16 20:34:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761021396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567777126] [2025-03-16 20:34:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:57,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:57,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:57,189 INFO L87 Difference]: Start difference. First operand 2414 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-16 20:34:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,212 INFO L93 Difference]: Finished difference Result 2611 states and 4092 transitions. [2025-03-16 20:34:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-03-16 20:34:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,221 INFO L225 Difference]: With dead ends: 2611 [2025-03-16 20:34:57,221 INFO L226 Difference]: Without dead ends: 2507 [2025-03-16 20:34:57,222 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-16 20:34:57,223 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1496 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2025-03-16 20:34:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2025-03-16 20:34:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.5661206552137434) internal successors, (3920), 2504 states have internal predecessors, (3920), 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-16 20:34:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3920 transitions. [2025-03-16 20:34:57,263 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3920 transitions. Word has length 76 [2025-03-16 20:34:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:57,263 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3920 transitions. [2025-03-16 20:34:57,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-16 20:34:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3920 transitions. [2025-03-16 20:34:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 20:34:57,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:57,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:57,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:34:57,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:57,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2132497085, now seen corresponding path program 1 times [2025-03-16 20:34:57,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:57,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061219953] [2025-03-16 20:34:57,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:57,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 20:34:57,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 20:34:57,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:57,484 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-16 20:34:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061219953] [2025-03-16 20:34:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061219953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:57,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:34:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403884529] [2025-03-16 20:34:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:57,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:34:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:34:57,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:57,486 INFO L87 Difference]: Start difference. First operand 2505 states and 3920 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-16 20:34:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,523 INFO L93 Difference]: Finished difference Result 2511 states and 3927 transitions. [2025-03-16 20:34:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:34:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2025-03-16 20:34:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,531 INFO L225 Difference]: With dead ends: 2511 [2025-03-16 20:34:57,531 INFO L226 Difference]: Without dead ends: 2509 [2025-03-16 20:34:57,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:57,532 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 6289 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7864 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7864 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2025-03-16 20:34:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2509. [2025-03-16 20:34:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.5648185081771042) internal successors, (3923), 2508 states have internal predecessors, (3923), 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-16 20:34:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3923 transitions. [2025-03-16 20:34:57,573 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3923 transitions. Word has length 77 [2025-03-16 20:34:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:57,573 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3923 transitions. [2025-03-16 20:34:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-16 20:34:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3923 transitions. [2025-03-16 20:34:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:57,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:34:57,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1167662761, now seen corresponding path program 1 times [2025-03-16 20:34:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627848711] [2025-03-16 20:34:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:57,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:57,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:57,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:57,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:57,630 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-16 20:34:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627848711] [2025-03-16 20:34:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627848711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215238267] [2025-03-16 20:34:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:57,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:57,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:57,632 INFO L87 Difference]: Start difference. First operand 2509 states and 3923 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,656 INFO L93 Difference]: Finished difference Result 2719 states and 4256 transitions. [2025-03-16 20:34:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:57,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,664 INFO L225 Difference]: With dead ends: 2719 [2025-03-16 20:34:57,664 INFO L226 Difference]: Without dead ends: 2611 [2025-03-16 20:34:57,665 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-16 20:34:57,666 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1514 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1737 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2025-03-16 20:34:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2609. [2025-03-16 20:34:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2607 states have (on average 1.5650172612197928) internal successors, (4080), 2608 states have internal predecessors, (4080), 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-16 20:34:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4080 transitions. [2025-03-16 20:34:57,707 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4080 transitions. Word has length 78 [2025-03-16 20:34:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:57,708 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4080 transitions. [2025-03-16 20:34:57,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4080 transitions. [2025-03-16 20:34:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:57,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:57,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:57,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:34:57,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:57,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1361821271, now seen corresponding path program 1 times [2025-03-16 20:34:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115857136] [2025-03-16 20:34:57,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:57,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:57,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:57,784 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-16 20:34:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115857136] [2025-03-16 20:34:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115857136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:57,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:57,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416988607] [2025-03-16 20:34:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:57,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:57,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:57,787 INFO L87 Difference]: Start difference. First operand 2609 states and 4080 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,811 INFO L93 Difference]: Finished difference Result 3179 states and 4980 transitions. [2025-03-16 20:34:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,820 INFO L225 Difference]: With dead ends: 3179 [2025-03-16 20:34:57,820 INFO L226 Difference]: Without dead ends: 2882 [2025-03-16 20:34:57,821 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-16 20:34:57,823 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1512 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-16 20:34:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2880. [2025-03-16 20:34:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 1.5642807505211953) internal successors, (4502), 2879 states have internal predecessors, (4502), 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-16 20:34:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4502 transitions. [2025-03-16 20:34:57,878 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4502 transitions. Word has length 78 [2025-03-16 20:34:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:57,878 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4502 transitions. [2025-03-16 20:34:57,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4502 transitions. [2025-03-16 20:34:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:57,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:57,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:34:57,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1652303017, now seen corresponding path program 1 times [2025-03-16 20:34:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28183463] [2025-03-16 20:34:57,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:57,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:57,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:57,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:57,937 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-16 20:34:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:57,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28183463] [2025-03-16 20:34:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28183463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:57,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:57,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506419168] [2025-03-16 20:34:57,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:57,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:57,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:57,939 INFO L87 Difference]: Start difference. First operand 2880 states and 4502 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:57,974 INFO L93 Difference]: Finished difference Result 3968 states and 6204 transitions. [2025-03-16 20:34:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:57,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:57,992 INFO L225 Difference]: With dead ends: 3968 [2025-03-16 20:34:57,992 INFO L226 Difference]: Without dead ends: 3400 [2025-03-16 20:34:57,994 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-16 20:34:57,998 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1510 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:57,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2025-03-16 20:34:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3398. [2025-03-16 20:34:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3396 states have (on average 1.5600706713780919) internal successors, (5298), 3397 states have internal predecessors, (5298), 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-16 20:34:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 5298 transitions. [2025-03-16 20:34:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 5298 transitions. Word has length 78 [2025-03-16 20:34:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:58,060 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 5298 transitions. [2025-03-16 20:34:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 5298 transitions. [2025-03-16 20:34:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:58,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:58,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:58,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:34:58,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:58,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1799305303, now seen corresponding path program 1 times [2025-03-16 20:34:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:58,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549436827] [2025-03-16 20:34:58,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:58,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:58,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:58,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:58,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:58,108 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-16 20:34:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549436827] [2025-03-16 20:34:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549436827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:58,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:58,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:58,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866329664] [2025-03-16 20:34:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:58,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:58,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:58,110 INFO L87 Difference]: Start difference. First operand 3398 states and 5298 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:58,152 INFO L93 Difference]: Finished difference Result 5474 states and 8508 transitions. [2025-03-16 20:34:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:58,161 INFO L225 Difference]: With dead ends: 5474 [2025-03-16 20:34:58,161 INFO L226 Difference]: Without dead ends: 4388 [2025-03-16 20:34:58,163 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-16 20:34:58,164 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1508 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:58,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2025-03-16 20:34:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4386. [2025-03-16 20:34:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4384 states have (on average 1.5497262773722629) internal successors, (6794), 4385 states have internal predecessors, (6794), 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-16 20:34:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 6794 transitions. [2025-03-16 20:34:58,242 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 6794 transitions. Word has length 78 [2025-03-16 20:34:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:58,242 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 6794 transitions. [2025-03-16 20:34:58,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 6794 transitions. [2025-03-16 20:34:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:58,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:58,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:34:58,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:58,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:58,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1042264663, now seen corresponding path program 1 times [2025-03-16 20:34:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:58,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422320427] [2025-03-16 20:34:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:58,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:58,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:58,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:58,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:58,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:58,291 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-16 20:34:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:58,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422320427] [2025-03-16 20:34:58,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422320427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:58,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084953405] [2025-03-16 20:34:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:58,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:58,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:58,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:58,294 INFO L87 Difference]: Start difference. First operand 4386 states and 6794 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:58,354 INFO L93 Difference]: Finished difference Result 8342 states and 12828 transitions. [2025-03-16 20:34:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:58,365 INFO L225 Difference]: With dead ends: 8342 [2025-03-16 20:34:58,366 INFO L226 Difference]: Without dead ends: 6268 [2025-03-16 20:34:58,369 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-16 20:34:58,370 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 1504 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:58,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2025-03-16 20:34:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6266. [2025-03-16 20:34:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6264 states have (on average 1.5316091954022988) internal successors, (9594), 6265 states have internal predecessors, (9594), 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-16 20:34:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 9594 transitions. [2025-03-16 20:34:58,479 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 9594 transitions. Word has length 78 [2025-03-16 20:34:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:58,480 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 9594 transitions. [2025-03-16 20:34:58,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 9594 transitions. [2025-03-16 20:34:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:58,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:58,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:34:58,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1592053591, now seen corresponding path program 1 times [2025-03-16 20:34:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012776401] [2025-03-16 20:34:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:58,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:58,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:58,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:58,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:58,560 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-16 20:34:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012776401] [2025-03-16 20:34:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012776401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639918722] [2025-03-16 20:34:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:58,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:58,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:58,562 INFO L87 Difference]: Start difference. First operand 6266 states and 9594 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:58,691 INFO L93 Difference]: Finished difference Result 13790 states and 20892 transitions. [2025-03-16 20:34:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:58,710 INFO L225 Difference]: With dead ends: 13790 [2025-03-16 20:34:58,710 INFO L226 Difference]: Without dead ends: 9836 [2025-03-16 20:34:58,718 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-16 20:34:58,719 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1502 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:58,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2025-03-16 20:34:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 9834. [2025-03-16 20:34:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9832 states have (on average 1.506305939788446) internal successors, (14810), 9833 states have internal predecessors, (14810), 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-16 20:34:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 14810 transitions. [2025-03-16 20:34:58,927 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 14810 transitions. Word has length 78 [2025-03-16 20:34:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 9834 states and 14810 transitions. [2025-03-16 20:34:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 14810 transitions. [2025-03-16 20:34:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:58,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:58,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:34:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:34:58,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash -976082263, now seen corresponding path program 1 times [2025-03-16 20:34:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688894576] [2025-03-16 20:34:58,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:58,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:58,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:58,976 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-16 20:34:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688894576] [2025-03-16 20:34:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688894576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:58,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904199201] [2025-03-16 20:34:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:58,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:58,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:58,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:58,978 INFO L87 Difference]: Start difference. First operand 9834 states and 14810 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:59,127 INFO L93 Difference]: Finished difference Result 24110 states and 35868 transitions. [2025-03-16 20:34:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 20:34:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:59,156 INFO L225 Difference]: With dead ends: 24110 [2025-03-16 20:34:59,156 INFO L226 Difference]: Without dead ends: 16588 [2025-03-16 20:34:59,167 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-16 20:34:59,168 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1506 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:59,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16588 states. [2025-03-16 20:34:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16588 to 16586. [2025-03-16 20:34:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16586 states, 16584 states have (on average 1.4757597684515196) internal successors, (24474), 16585 states have internal predecessors, (24474), 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-16 20:34:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 24474 transitions. [2025-03-16 20:34:59,522 INFO L78 Accepts]: Start accepts. Automaton has 16586 states and 24474 transitions. Word has length 78 [2025-03-16 20:34:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 16586 states and 24474 transitions. [2025-03-16 20:34:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 20:34:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16586 states and 24474 transitions. [2025-03-16 20:34:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:59,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:59,526 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:59,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:34:59,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:59,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -687087655, now seen corresponding path program 1 times [2025-03-16 20:34:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:59,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482018471] [2025-03-16 20:34:59,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:59,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:59,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:59,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:34:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482018471] [2025-03-16 20:34:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482018471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825927502] [2025-03-16 20:34:59,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:59,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:59,702 INFO L87 Difference]: Start difference. First operand 16586 states and 24474 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-16 20:35:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:01,029 INFO L93 Difference]: Finished difference Result 115098 states and 168418 transitions. [2025-03-16 20:35:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 100 [2025-03-16 20:35:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:01,248 INFO L225 Difference]: With dead ends: 115098 [2025-03-16 20:35:01,249 INFO L226 Difference]: Without dead ends: 105112 [2025-03-16 20:35:01,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:01,278 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 9845 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9845 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:01,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9845 Valid, 4630 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105112 states. [2025-03-16 20:35:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105112 to 28746. [2025-03-16 20:35:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28746 states, 28744 states have (on average 1.4637489563039243) internal successors, (42074), 28745 states have internal predecessors, (42074), 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-16 20:35:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28746 states to 28746 states and 42074 transitions. [2025-03-16 20:35:02,611 INFO L78 Accepts]: Start accepts. Automaton has 28746 states and 42074 transitions. Word has length 100 [2025-03-16 20:35:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:02,611 INFO L471 AbstractCegarLoop]: Abstraction has 28746 states and 42074 transitions. [2025-03-16 20:35:02,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-16 20:35:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 28746 states and 42074 transitions. [2025-03-16 20:35:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:02,616 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:35:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:35:02,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1078395609, now seen corresponding path program 1 times [2025-03-16 20:35:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071393238] [2025-03-16 20:35:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:02,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:02,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:02,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:35:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071393238] [2025-03-16 20:35:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071393238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343749189] [2025-03-16 20:35:02,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:02,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:02,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:02,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:02,930 INFO L87 Difference]: Start difference. First operand 28746 states and 42074 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-16 20:35:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:04,543 INFO L93 Difference]: Finished difference Result 129370 states and 189154 transitions. [2025-03-16 20:35:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 100 [2025-03-16 20:35:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:04,701 INFO L225 Difference]: With dead ends: 129370 [2025-03-16 20:35:04,701 INFO L226 Difference]: Without dead ends: 115096 [2025-03-16 20:35:04,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:04,735 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9847 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9847 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:04,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9847 Valid, 4590 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115096 states. [2025-03-16 20:35:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115096 to 48010. [2025-03-16 20:35:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48010 states, 48008 states have (on average 1.4562989501749708) internal successors, (69914), 48009 states have internal predecessors, (69914), 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-16 20:35:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48010 states to 48010 states and 69914 transitions. [2025-03-16 20:35:06,302 INFO L78 Accepts]: Start accepts. Automaton has 48010 states and 69914 transitions. Word has length 100 [2025-03-16 20:35:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:06,302 INFO L471 AbstractCegarLoop]: Abstraction has 48010 states and 69914 transitions. [2025-03-16 20:35:06,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-16 20:35:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48010 states and 69914 transitions. [2025-03-16 20:35:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:06,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:06,309 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:35:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:35:06,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -202447399, now seen corresponding path program 1 times [2025-03-16 20:35:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646146317] [2025-03-16 20:35:06,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:06,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:06,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:06,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:35:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646146317] [2025-03-16 20:35:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646146317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290113122] [2025-03-16 20:35:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:06,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:06,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:06,512 INFO L87 Difference]: Start difference. First operand 48010 states and 69914 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-16 20:35:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:09,106 INFO L93 Difference]: Finished difference Result 143642 states and 209826 transitions. [2025-03-16 20:35:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 100 [2025-03-16 20:35:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:09,284 INFO L225 Difference]: With dead ends: 143642 [2025-03-16 20:35:09,285 INFO L226 Difference]: Without dead ends: 129368 [2025-03-16 20:35:09,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:09,318 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9866 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9866 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9866 Valid, 4553 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129368 states. [2025-03-16 20:35:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129368 to 62282. [2025-03-16 20:35:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62282 states, 62280 states have (on average 1.454495825305074) internal successors, (90586), 62281 states have internal predecessors, (90586), 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-16 20:35:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62282 states to 62282 states and 90586 transitions. [2025-03-16 20:35:11,412 INFO L78 Accepts]: Start accepts. Automaton has 62282 states and 90586 transitions. Word has length 100 [2025-03-16 20:35:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:11,412 INFO L471 AbstractCegarLoop]: Abstraction has 62282 states and 90586 transitions. [2025-03-16 20:35:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-16 20:35:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 62282 states and 90586 transitions. [2025-03-16 20:35:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:11,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:11,420 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:35:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:35:11,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:11,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 640911577, now seen corresponding path program 1 times [2025-03-16 20:35:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:11,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119755224] [2025-03-16 20:35:11,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:11,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:11,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:35:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119755224] [2025-03-16 20:35:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119755224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833903477] [2025-03-16 20:35:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:11,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:11,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:11,621 INFO L87 Difference]: Start difference. First operand 62282 states and 90586 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-16 20:35:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:14,813 INFO L93 Difference]: Finished difference Result 157914 states and 230498 transitions. [2025-03-16 20:35:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:14,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 100 [2025-03-16 20:35:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:15,009 INFO L225 Difference]: With dead ends: 157914 [2025-03-16 20:35:15,009 INFO L226 Difference]: Without dead ends: 143640 [2025-03-16 20:35:15,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:15,038 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 9955 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9955 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:15,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9955 Valid, 4469 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143640 states. [2025-03-16 20:35:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143640 to 76554. [2025-03-16 20:35:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76554 states, 76552 states have (on average 1.4533650329188004) internal successors, (111258), 76553 states have internal predecessors, (111258), 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-16 20:35:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76554 states to 76554 states and 111258 transitions. [2025-03-16 20:35:17,848 INFO L78 Accepts]: Start accepts. Automaton has 76554 states and 111258 transitions. Word has length 100 [2025-03-16 20:35:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 76554 states and 111258 transitions. [2025-03-16 20:35:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-16 20:35:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 76554 states and 111258 transitions. [2025-03-16 20:35:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:17,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:17,855 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:35:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:35:17,855 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1397952217, now seen corresponding path program 1 times [2025-03-16 20:35:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503632820] [2025-03-16 20:35:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:17,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:17,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:17,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:17,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:35:18,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503632820] [2025-03-16 20:35:18,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503632820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:18,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313927773] [2025-03-16 20:35:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:18,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:18,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:18,025 INFO L87 Difference]: Start difference. First operand 76554 states and 111258 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-16 20:35:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:21,968 INFO L93 Difference]: Finished difference Result 172186 states and 251170 transitions. [2025-03-16 20:35:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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 100 [2025-03-16 20:35:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:22,197 INFO L225 Difference]: With dead ends: 172186 [2025-03-16 20:35:22,197 INFO L226 Difference]: Without dead ends: 157912 [2025-03-16 20:35:22,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:22,239 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 10036 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10036 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:22,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10036 Valid, 4529 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157912 states. [2025-03-16 20:35:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157912 to 90826. [2025-03-16 20:35:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90826 states, 90824 states have (on average 1.4525896238879592) internal successors, (131930), 90825 states have internal predecessors, (131930), 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-16 20:35:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90826 states to 90826 states and 131930 transitions. [2025-03-16 20:35:25,015 INFO L78 Accepts]: Start accepts. Automaton has 90826 states and 131930 transitions. Word has length 100 [2025-03-16 20:35:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:35:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 90826 states and 131930 transitions. [2025-03-16 20:35:25,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-16 20:35:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90826 states and 131930 transitions. [2025-03-16 20:35:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:35:25,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:35:25,021 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:35:25,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:35:25,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:35:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:35:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 848163289, now seen corresponding path program 1 times [2025-03-16 20:35:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:35:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972945822] [2025-03-16 20:35:25,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:35:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:35:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:35:25,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:35:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:35:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:35:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:35:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:35:25,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972945822] [2025-03-16 20:35:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972945822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:35:25,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:35:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:35:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026381539] [2025-03-16 20:35:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:35:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:35:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:35:25,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:35:25,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:35:25,154 INFO L87 Difference]: Start difference. First operand 90826 states and 131930 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-16 20:35:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:35:28,558 INFO L93 Difference]: Finished difference Result 186458 states and 271842 transitions. [2025-03-16 20:35:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:35:28,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 100 [2025-03-16 20:35:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:35:28,769 INFO L225 Difference]: With dead ends: 186458 [2025-03-16 20:35:28,769 INFO L226 Difference]: Without dead ends: 172184 [2025-03-16 20:35:28,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:35:28,812 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 9909 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9909 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:35:28,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9909 Valid, 4539 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:35:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172184 states.