./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.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.8.ufo.BOUNDED-16.pals+Problem12_label03.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 3736b39782d33d69e49d45bc83c966fe9403fa4c46d3557706bbbfc10e7a8136 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:36:38,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:36:38,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:36:38,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:36:38,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:36:38,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:36:38,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:36:38,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:36:38,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:36:38,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:36:38,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:36:38,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:36:38,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:36:38,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:36:38,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:36:38,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:36:38,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:36:38,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:36:38,094 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 -> 3736b39782d33d69e49d45bc83c966fe9403fa4c46d3557706bbbfc10e7a8136 [2025-03-16 20:36:38,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:36:38,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:36:38,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:36:38,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:36:38,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:36:38,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c [2025-03-16 20:36:39,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973a21b9f/8e5278c551b0464698044906dbc70fa4/FLAG7c62da071 [2025-03-16 20:36:39,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:36:39,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c [2025-03-16 20:36:39,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973a21b9f/8e5278c551b0464698044906dbc70fa4/FLAG7c62da071 [2025-03-16 20:36:39,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973a21b9f/8e5278c551b0464698044906dbc70fa4 [2025-03-16 20:36:39,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:36:39,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:36:39,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:36:39,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:36:39,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:36:39,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:36:39" (1/1) ... [2025-03-16 20:36:39,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3e7c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:39, skipping insertion in model container [2025-03-16 20:36:39,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:36:39" (1/1) ... [2025-03-16 20:36:40,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:36:40,295 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.8.ufo.BOUNDED-16.pals+Problem12_label03.c[26860,26873] [2025-03-16 20:36:40,316 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.8.ufo.BOUNDED-16.pals+Problem12_label03.c[29197,29210] [2025-03-16 20:36:40,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:36:40,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:36:40,761 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.8.ufo.BOUNDED-16.pals+Problem12_label03.c[26860,26873] [2025-03-16 20:36:40,764 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.8.ufo.BOUNDED-16.pals+Problem12_label03.c[29197,29210] [2025-03-16 20:36:40,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:36:40,989 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:36:40,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40 WrapperNode [2025-03-16 20:36:40,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:36:40,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:36:40,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:36:40,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:36:40,996 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:36:40" (1/1) ... [2025-03-16 20:36:41,028 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:36:40" (1/1) ... [2025-03-16 20:36:41,263 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5287 [2025-03-16 20:36:41,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:36:41,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:36:41,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:36:41,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:36:41,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,450 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:36:41,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:36:41,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:36:41,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:36:41,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:36:41,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (1/1) ... [2025-03-16 20:36:41,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:36:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:36:41,661 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:36:41,667 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:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:36:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:36:41,805 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:36:41,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:36:45,322 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc calculate_output_#t~ret50#1; [2025-03-16 20:36:45,323 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3852: havoc calculate_output2_#t~ret51#1; [2025-03-16 20:36:45,323 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5342: havoc calculate_output3_#t~ret52#1; [2025-03-16 20:36:45,431 INFO L? ?]: Removed 756 outVars from TransFormulas that were not future-live. [2025-03-16 20:36:45,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:36:45,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:36:45,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:36:45,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:36:45 BoogieIcfgContainer [2025-03-16 20:36:45,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:36:45,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:36:45,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:36:45,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:36:45,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:36:39" (1/3) ... [2025-03-16 20:36:45,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:36:45, skipping insertion in model container [2025-03-16 20:36:45,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:36:40" (2/3) ... [2025-03-16 20:36:45,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f0764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:36:45, skipping insertion in model container [2025-03-16 20:36:45,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:36:45" (3/3) ... [2025-03-16 20:36:45,471 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c [2025-03-16 20:36:45,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:36:45,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label03.c that has 1 procedures, 882 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:36:45,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:36:45,551 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;@34ae18b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:36:45,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:36:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 882 states, 879 states have (on average 1.9681456200227532) internal successors, (1730), 881 states have internal predecessors, (1730), 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:36:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:36:45,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:45,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:45,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1982470663, now seen corresponding path program 1 times [2025-03-16 20:36:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433773220] [2025-03-16 20:36:45,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:45,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:36:45,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:36:45,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:45,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:45,749 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:36:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433773220] [2025-03-16 20:36:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433773220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:36:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255608161] [2025-03-16 20:36:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:36:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:45,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:36:45,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:36:45,771 INFO L87 Difference]: Start difference. First operand has 882 states, 879 states have (on average 1.9681456200227532) internal successors, (1730), 881 states have internal predecessors, (1730), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:36:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:45,834 INFO L93 Difference]: Finished difference Result 1699 states and 3332 transitions. [2025-03-16 20:36:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:36:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2025-03-16 20:36:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:45,852 INFO L225 Difference]: With dead ends: 1699 [2025-03-16 20:36:45,852 INFO L226 Difference]: Without dead ends: 878 [2025-03-16 20:36:45,856 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:36:45,858 INFO L435 NwaCegarLoop]: 1666 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, 1666 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:36:45,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-16 20:36:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2025-03-16 20:36:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8961187214611872) internal successors, (1661), 877 states have internal predecessors, (1661), 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:36:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1661 transitions. [2025-03-16 20:36:45,919 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1661 transitions. Word has length 19 [2025-03-16 20:36:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:45,920 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1661 transitions. [2025-03-16 20:36:45,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:36:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1661 transitions. [2025-03-16 20:36:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:36:45,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:45,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:45,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:36:45,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:45,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1550009162, now seen corresponding path program 1 times [2025-03-16 20:36:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628725093] [2025-03-16 20:36:45,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:36:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:36:45,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:46,134 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:36:46,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628725093] [2025-03-16 20:36:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628725093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:36:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307532943] [2025-03-16 20:36:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:46,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:46,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:46,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:46,136 INFO L87 Difference]: Start difference. First operand 878 states and 1661 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:36:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:48,797 INFO L93 Difference]: Finished difference Result 2382 states and 4534 transitions. [2025-03-16 20:36:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:48,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2025-03-16 20:36:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:48,803 INFO L225 Difference]: With dead ends: 2382 [2025-03-16 20:36:48,803 INFO L226 Difference]: Without dead ends: 1629 [2025-03-16 20:36:48,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:48,804 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 999 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:48,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 769 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:36:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-16 20:36:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2025-03-16 20:36:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.5783650891210816) internal successors, (2568), 1628 states have internal predecessors, (2568), 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:36:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2568 transitions. [2025-03-16 20:36:48,837 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2568 transitions. Word has length 19 [2025-03-16 20:36:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2568 transitions. [2025-03-16 20:36:48,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:36:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2568 transitions. [2025-03-16 20:36:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:36:48,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:48,840 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] [2025-03-16 20:36:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:36:48,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1366537241, now seen corresponding path program 1 times [2025-03-16 20:36:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15363537] [2025-03-16 20:36:48,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:48,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:36:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:36:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:48,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:48,999 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:36:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15363537] [2025-03-16 20:36:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15363537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:36:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720541404] [2025-03-16 20:36:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:48,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:36:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:49,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:36:49,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:36:49,000 INFO L87 Difference]: Start difference. First operand 1629 states and 2568 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:36:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:49,067 INFO L93 Difference]: Finished difference Result 1691 states and 2667 transitions. [2025-03-16 20:36:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:36:49,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-03-16 20:36:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:49,072 INFO L225 Difference]: With dead ends: 1691 [2025-03-16 20:36:49,073 INFO L226 Difference]: Without dead ends: 1629 [2025-03-16 20:36:49,073 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:36:49,074 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 0 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4915 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:49,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4915 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-16 20:36:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2025-03-16 20:36:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.5408727719729565) internal successors, (2507), 1628 states have internal predecessors, (2507), 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:36:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2507 transitions. [2025-03-16 20:36:49,114 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2507 transitions. Word has length 27 [2025-03-16 20:36:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:49,114 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2507 transitions. [2025-03-16 20:36:49,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:36:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2507 transitions. [2025-03-16 20:36:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:36:49,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:49,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:36:49,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:49,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1216942699, now seen corresponding path program 1 times [2025-03-16 20:36:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360868921] [2025-03-16 20:36:49,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:36:49,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:36:49,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:49,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:49,480 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:36:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360868921] [2025-03-16 20:36:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360868921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:36:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79111199] [2025-03-16 20:36:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:36:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:36:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:36:49,482 INFO L87 Difference]: Start difference. First operand 1629 states and 2507 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:36:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:49,970 INFO L93 Difference]: Finished difference Result 2573 states and 4043 transitions. [2025-03-16 20:36:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:36:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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 87 [2025-03-16 20:36:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:49,979 INFO L225 Difference]: With dead ends: 2573 [2025-03-16 20:36:49,979 INFO L226 Difference]: Without dead ends: 2514 [2025-03-16 20:36:49,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:36:49,982 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 13338 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13338 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:49,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13338 Valid, 6801 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:36:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-03-16 20:36:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1686. [2025-03-16 20:36:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1684 states have (on average 1.5439429928741093) internal successors, (2600), 1685 states have internal predecessors, (2600), 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:36:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2600 transitions. [2025-03-16 20:36:50,029 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2600 transitions. Word has length 87 [2025-03-16 20:36:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:50,031 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2600 transitions. [2025-03-16 20:36:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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:36:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2600 transitions. [2025-03-16 20:36:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:36:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:50,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:36:50,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1288011437, now seen corresponding path program 1 times [2025-03-16 20:36:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463215830] [2025-03-16 20:36:50,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:50,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:36:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:36:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:50,534 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:36:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463215830] [2025-03-16 20:36:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463215830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:50,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:50,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:36:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655644953] [2025-03-16 20:36:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:36:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:50,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:36:50,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:36:50,536 INFO L87 Difference]: Start difference. First operand 1686 states and 2600 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:36:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:50,874 INFO L93 Difference]: Finished difference Result 1804 states and 2790 transitions. [2025-03-16 20:36:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:36:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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 89 [2025-03-16 20:36:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:50,882 INFO L225 Difference]: With dead ends: 1804 [2025-03-16 20:36:50,882 INFO L226 Difference]: Without dead ends: 1688 [2025-03-16 20:36:50,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 20:36:50,883 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 6100 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6100 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:50,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6100 Valid, 2244 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:36:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2025-03-16 20:36:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1686. [2025-03-16 20:36:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1684 states have (on average 1.5433491686460807) internal successors, (2599), 1685 states have internal predecessors, (2599), 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:36:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2599 transitions. [2025-03-16 20:36:50,916 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2599 transitions. Word has length 89 [2025-03-16 20:36:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2599 transitions. [2025-03-16 20:36:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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:36:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2599 transitions. [2025-03-16 20:36:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:36:50,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:50,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:36:50,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1286968752, now seen corresponding path program 1 times [2025-03-16 20:36:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240273053] [2025-03-16 20:36:50,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:50,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:36:50,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:36:50,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:50,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:51,113 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:36:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240273053] [2025-03-16 20:36:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240273053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927884021] [2025-03-16 20:36:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:51,115 INFO L87 Difference]: Start difference. First operand 1686 states and 2599 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:36:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:51,150 INFO L93 Difference]: Finished difference Result 1907 states and 2956 transitions. [2025-03-16 20:36:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 89 [2025-03-16 20:36:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:51,157 INFO L225 Difference]: With dead ends: 1907 [2025-03-16 20:36:51,157 INFO L226 Difference]: Without dead ends: 1791 [2025-03-16 20:36:51,158 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:36:51,159 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1504 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1690 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:36:51,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1690 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-16 20:36:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1789. [2025-03-16 20:36:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1787 states have (on average 1.5467263570229435) internal successors, (2764), 1788 states have internal predecessors, (2764), 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:36:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2764 transitions. [2025-03-16 20:36:51,239 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2764 transitions. Word has length 89 [2025-03-16 20:36:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:51,242 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2764 transitions. [2025-03-16 20:36:51,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:36:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2764 transitions. [2025-03-16 20:36:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:36:51,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:51,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:51,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:36:51,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:51,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1274633943, now seen corresponding path program 1 times [2025-03-16 20:36:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250487759] [2025-03-16 20:36:51,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:36:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:36:51,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:51,547 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:36:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250487759] [2025-03-16 20:36:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250487759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:36:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607646670] [2025-03-16 20:36:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:51,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:36:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:51,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:36:51,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:36:51,549 INFO L87 Difference]: Start difference. First operand 1789 states and 2764 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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:36:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:51,587 INFO L93 Difference]: Finished difference Result 1795 states and 2771 transitions. [2025-03-16 20:36:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:36:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 90 [2025-03-16 20:36:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:51,592 INFO L225 Difference]: With dead ends: 1795 [2025-03-16 20:36:51,592 INFO L226 Difference]: Without dead ends: 1793 [2025-03-16 20:36:51,593 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:36:51,593 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 6373 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7969 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:36:51,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7969 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-16 20:36:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1793. [2025-03-16 20:36:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1791 states have (on average 1.5449469570072585) internal successors, (2767), 1792 states have internal predecessors, (2767), 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:36:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2767 transitions. [2025-03-16 20:36:51,622 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2767 transitions. Word has length 90 [2025-03-16 20:36:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2767 transitions. [2025-03-16 20:36:51,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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:36:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2767 transitions. [2025-03-16 20:36:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:36:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:51,625 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] [2025-03-16 20:36:51,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:36:51,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:51,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash 379664803, now seen corresponding path program 1 times [2025-03-16 20:36:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724969880] [2025-03-16 20:36:51,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:51,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:36:51,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:36:51,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:51,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:36:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724969880] [2025-03-16 20:36:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724969880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:51,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:51,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:36:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535492484] [2025-03-16 20:36:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:51,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:51,736 INFO L87 Difference]: Start difference. First operand 1793 states and 2767 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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:36:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:54,019 INFO L93 Difference]: Finished difference Result 4799 states and 7454 transitions. [2025-03-16 20:36:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 90 [2025-03-16 20:36:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:54,028 INFO L225 Difference]: With dead ends: 4799 [2025-03-16 20:36:54,029 INFO L226 Difference]: Without dead ends: 3295 [2025-03-16 20:36:54,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:54,031 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 887 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:36:54,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 635 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 20:36:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2025-03-16 20:36:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3295. [2025-03-16 20:36:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 3293 states have (on average 1.3802004251442455) internal successors, (4545), 3294 states have internal predecessors, (4545), 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:36:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4545 transitions. [2025-03-16 20:36:54,082 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4545 transitions. Word has length 90 [2025-03-16 20:36:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:54,082 INFO L471 AbstractCegarLoop]: Abstraction has 3295 states and 4545 transitions. [2025-03-16 20:36:54,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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:36:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4545 transitions. [2025-03-16 20:36:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:54,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:54,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:54,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:36:54,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 226374351, now seen corresponding path program 1 times [2025-03-16 20:36:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376907373] [2025-03-16 20:36:54,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:54,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:54,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:54,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:54,165 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:36:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376907373] [2025-03-16 20:36:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376907373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142000621] [2025-03-16 20:36:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:54,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:54,166 INFO L87 Difference]: Start difference. First operand 3295 states and 4545 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:54,201 INFO L93 Difference]: Finished difference Result 3529 states and 4918 transitions. [2025-03-16 20:36:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:54,210 INFO L225 Difference]: With dead ends: 3529 [2025-03-16 20:36:54,210 INFO L226 Difference]: Without dead ends: 3409 [2025-03-16 20:36:54,211 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:36:54,212 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1524 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1778 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:36:54,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1778 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2025-03-16 20:36:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3407. [2025-03-16 20:36:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3405 states have (on average 1.386784140969163) internal successors, (4722), 3406 states have internal predecessors, (4722), 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:36:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4722 transitions. [2025-03-16 20:36:54,265 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4722 transitions. Word has length 91 [2025-03-16 20:36:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:54,265 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4722 transitions. [2025-03-16 20:36:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4722 transitions. [2025-03-16 20:36:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:54,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:54,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:54,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:36:54,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:54,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash 343709135, now seen corresponding path program 1 times [2025-03-16 20:36:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:54,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798024502] [2025-03-16 20:36:54,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:54,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:54,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:54,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:54,340 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:36:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798024502] [2025-03-16 20:36:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798024502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552850572] [2025-03-16 20:36:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:54,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:54,342 INFO L87 Difference]: Start difference. First operand 3407 states and 4722 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:54,370 INFO L93 Difference]: Finished difference Result 4049 states and 5742 transitions. [2025-03-16 20:36:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:54,381 INFO L225 Difference]: With dead ends: 4049 [2025-03-16 20:36:54,382 INFO L226 Difference]: Without dead ends: 3716 [2025-03-16 20:36:54,383 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:36:54,384 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1522 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1784 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:36:54,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2025-03-16 20:36:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3714. [2025-03-16 20:36:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3712 states have (on average 1.4019396551724137) internal successors, (5204), 3713 states have internal predecessors, (5204), 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:36:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 5204 transitions. [2025-03-16 20:36:54,514 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 5204 transitions. Word has length 91 [2025-03-16 20:36:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 5204 transitions. [2025-03-16 20:36:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 5204 transitions. [2025-03-16 20:36:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:54,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:54,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:36:54,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2109192399, now seen corresponding path program 1 times [2025-03-16 20:36:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402137340] [2025-03-16 20:36:54,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:54,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:54,633 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:36:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402137340] [2025-03-16 20:36:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402137340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:54,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614755451] [2025-03-16 20:36:54,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:54,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:54,638 INFO L87 Difference]: Start difference. First operand 3714 states and 5204 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:54,726 INFO L93 Difference]: Finished difference Result 4946 states and 7146 transitions. [2025-03-16 20:36:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:54,748 INFO L225 Difference]: With dead ends: 4946 [2025-03-16 20:36:54,748 INFO L226 Difference]: Without dead ends: 4306 [2025-03-16 20:36:54,751 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:36:54,755 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1520 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1786 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:36:54,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2025-03-16 20:36:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4304. [2025-03-16 20:36:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4304 states, 4302 states have (on average 1.4225941422594142) internal successors, (6120), 4303 states have internal predecessors, (6120), 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:36:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 6120 transitions. [2025-03-16 20:36:54,838 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 6120 transitions. Word has length 91 [2025-03-16 20:36:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:54,839 INFO L471 AbstractCegarLoop]: Abstraction has 4304 states and 6120 transitions. [2025-03-16 20:36:54,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 6120 transitions. [2025-03-16 20:36:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:54,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:54,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:54,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:36:54,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:54,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:54,842 INFO L85 PathProgramCache]: Analyzing trace with hash 828349391, now seen corresponding path program 1 times [2025-03-16 20:36:54,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981776082] [2025-03-16 20:36:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:54,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:54,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:54,908 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:36:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981776082] [2025-03-16 20:36:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981776082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092075610] [2025-03-16 20:36:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:54,910 INFO L87 Difference]: Start difference. First operand 4304 states and 6120 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:54,956 INFO L93 Difference]: Finished difference Result 6668 states and 9810 transitions. [2025-03-16 20:36:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:54,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:54,966 INFO L225 Difference]: With dead ends: 6668 [2025-03-16 20:36:54,967 INFO L226 Difference]: Without dead ends: 5438 [2025-03-16 20:36:54,970 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:36:54,971 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1518 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1788 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:36:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2025-03-16 20:36:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 5436. [2025-03-16 20:36:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5436 states, 5434 states have (on average 1.4457121825542878) internal successors, (7856), 5435 states have internal predecessors, (7856), 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:36:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5436 states to 5436 states and 7856 transitions. [2025-03-16 20:36:55,072 INFO L78 Accepts]: Start accepts. Automaton has 5436 states and 7856 transitions. Word has length 91 [2025-03-16 20:36:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 5436 states and 7856 transitions. [2025-03-16 20:36:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5436 states and 7856 transitions. [2025-03-16 20:36:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:55,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:55,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:36:55,073 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:55,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1671708367, now seen corresponding path program 1 times [2025-03-16 20:36:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268962670] [2025-03-16 20:36:55,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:55,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:55,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:55,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:55,158 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:36:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268962670] [2025-03-16 20:36:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268962670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:55,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856659777] [2025-03-16 20:36:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:55,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:55,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:55,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:55,160 INFO L87 Difference]: Start difference. First operand 5436 states and 7856 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:55,216 INFO L93 Difference]: Finished difference Result 9968 states and 14850 transitions. [2025-03-16 20:36:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:55,231 INFO L225 Difference]: With dead ends: 9968 [2025-03-16 20:36:55,231 INFO L226 Difference]: Without dead ends: 7606 [2025-03-16 20:36:55,236 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:36:55,237 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1516 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1790 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:36:55,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2025-03-16 20:36:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7604. [2025-03-16 20:36:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7604 states, 7602 states have (on average 1.4648776637726915) internal successors, (11136), 7603 states have internal predecessors, (11136), 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:36:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7604 states to 7604 states and 11136 transitions. [2025-03-16 20:36:55,374 INFO L78 Accepts]: Start accepts. Automaton has 7604 states and 11136 transitions. Word has length 91 [2025-03-16 20:36:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:55,374 INFO L471 AbstractCegarLoop]: Abstraction has 7604 states and 11136 transitions. [2025-03-16 20:36:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7604 states and 11136 transitions. [2025-03-16 20:36:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:55,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:36:55,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1866218289, now seen corresponding path program 1 times [2025-03-16 20:36:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842167084] [2025-03-16 20:36:55,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:55,442 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:36:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:55,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842167084] [2025-03-16 20:36:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842167084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:55,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:55,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:55,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865736122] [2025-03-16 20:36:55,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:55,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:55,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:55,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:55,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:55,444 INFO L87 Difference]: Start difference. First operand 7604 states and 11136 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:55,604 INFO L93 Difference]: Finished difference Result 16280 states and 24354 transitions. [2025-03-16 20:36:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:55,626 INFO L225 Difference]: With dead ends: 16280 [2025-03-16 20:36:55,626 INFO L226 Difference]: Without dead ends: 11750 [2025-03-16 20:36:55,634 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:36:55,635 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 1512 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1786 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:36:55,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11750 states. [2025-03-16 20:36:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11750 to 11748. [2025-03-16 20:36:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11748 states, 11746 states have (on average 1.47386344287417) internal successors, (17312), 11747 states have internal predecessors, (17312), 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:36:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11748 states to 11748 states and 17312 transitions. [2025-03-16 20:36:55,905 INFO L78 Accepts]: Start accepts. Automaton has 11748 states and 17312 transitions. Word has length 91 [2025-03-16 20:36:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 11748 states and 17312 transitions. [2025-03-16 20:36:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11748 states and 17312 transitions. [2025-03-16 20:36:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:55,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:55,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:55,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:36:55,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1878960079, now seen corresponding path program 1 times [2025-03-16 20:36:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106015326] [2025-03-16 20:36:55,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:55,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:55,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:55,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:55,971 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:36:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:55,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106015326] [2025-03-16 20:36:55,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106015326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:55,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:55,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142650643] [2025-03-16 20:36:55,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:55,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:55,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:55,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:55,973 INFO L87 Difference]: Start difference. First operand 11748 states and 17312 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:56,298 INFO L93 Difference]: Finished difference Result 28328 states and 42210 transitions. [2025-03-16 20:36:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:56,398 INFO L225 Difference]: With dead ends: 28328 [2025-03-16 20:36:56,398 INFO L226 Difference]: Without dead ends: 19654 [2025-03-16 20:36:56,426 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:36:56,428 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1510 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1788 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:36:56,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2025-03-16 20:36:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 19652. [2025-03-16 20:36:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19652 states, 19650 states have (on average 1.4705343511450382) internal successors, (28896), 19651 states have internal predecessors, (28896), 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:36:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19652 states to 19652 states and 28896 transitions. [2025-03-16 20:36:56,841 INFO L78 Accepts]: Start accepts. Automaton has 19652 states and 28896 transitions. Word has length 91 [2025-03-16 20:36:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 19652 states and 28896 transitions. [2025-03-16 20:36:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 19652 states and 28896 transitions. [2025-03-16 20:36:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:36:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:56,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:36:56,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:36:56,843 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:56,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1800035889, now seen corresponding path program 1 times [2025-03-16 20:36:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498581425] [2025-03-16 20:36:56,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:36:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:36:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:56,909 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:36:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498581425] [2025-03-16 20:36:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498581425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382991746] [2025-03-16 20:36:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:36:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:56,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:36:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:36:56,911 INFO L87 Difference]: Start difference. First operand 19652 states and 28896 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:36:57,352 INFO L93 Difference]: Finished difference Result 51272 states and 75618 transitions. [2025-03-16 20:36:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:36:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:36:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:36:57,482 INFO L225 Difference]: With dead ends: 51272 [2025-03-16 20:36:57,483 INFO L226 Difference]: Without dead ends: 34694 [2025-03-16 20:36:57,506 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:36:57,529 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1514 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1792 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:36:57,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:36:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34694 states. [2025-03-16 20:36:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34694 to 34692. [2025-03-16 20:36:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34692 states, 34690 states have (on average 1.4565580859037186) internal successors, (50528), 34691 states have internal predecessors, (50528), 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:36:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34692 states to 34692 states and 50528 transitions. [2025-03-16 20:36:58,299 INFO L78 Accepts]: Start accepts. Automaton has 34692 states and 50528 transitions. Word has length 91 [2025-03-16 20:36:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:36:58,299 INFO L471 AbstractCegarLoop]: Abstraction has 34692 states and 50528 transitions. [2025-03-16 20:36:58,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:36:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34692 states and 50528 transitions. [2025-03-16 20:36:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 20:36:58,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:36:58,301 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] [2025-03-16 20:36:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:36:58,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:36:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:36:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -282199822, now seen corresponding path program 1 times [2025-03-16 20:36:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:36:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954993680] [2025-03-16 20:36:58,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:36:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:36:58,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 20:36:58,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 20:36:58,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:36:58,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:36:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:36:58,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:36:58,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954993680] [2025-03-16 20:36:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954993680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:36:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:36:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:36:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350239582] [2025-03-16 20:36:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:36:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:36:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:36:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:36:58,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:36:58,471 INFO L87 Difference]: Start difference. First operand 34692 states and 50528 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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:37:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:02,289 INFO L93 Difference]: Finished difference Result 41453 states and 59570 transitions. [2025-03-16 20:37:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2025-03-16 20:37:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:02,348 INFO L225 Difference]: With dead ends: 41453 [2025-03-16 20:37:02,348 INFO L226 Difference]: Without dead ends: 38447 [2025-03-16 20:37:02,356 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:37:02,357 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 2505 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5025 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 5650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 5025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:02,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 788 Invalid, 5650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 5025 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 20:37:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38447 states. [2025-03-16 20:37:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38447 to 38447. [2025-03-16 20:37:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38447 states, 38445 states have (on average 1.432566003381454) internal successors, (55075), 38446 states have internal predecessors, (55075), 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:37:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38447 states to 38447 states and 55075 transitions. [2025-03-16 20:37:03,030 INFO L78 Accepts]: Start accepts. Automaton has 38447 states and 55075 transitions. Word has length 96 [2025-03-16 20:37:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:03,030 INFO L471 AbstractCegarLoop]: Abstraction has 38447 states and 55075 transitions. [2025-03-16 20:37:03,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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:37:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38447 states and 55075 transitions. [2025-03-16 20:37:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:03,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:03,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:03,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:37:03,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:03,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash 428308800, now seen corresponding path program 1 times [2025-03-16 20:37:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:03,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365892827] [2025-03-16 20:37:03,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:03,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:03,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:37:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:03,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365892827] [2025-03-16 20:37:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365892827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:03,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:03,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675151079] [2025-03-16 20:37:03,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:03,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:03,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:03,244 INFO L87 Difference]: Start difference. First operand 38447 states and 55075 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:37:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:07,024 INFO L93 Difference]: Finished difference Result 288065 states and 420780 transitions. [2025-03-16 20:37:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 115 [2025-03-16 20:37:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:07,470 INFO L225 Difference]: With dead ends: 288065 [2025-03-16 20:37:07,470 INFO L226 Difference]: Without dead ends: 266047 [2025-03-16 20:37:07,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:07,558 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 11684 mSDsluCounter, 3722 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11684 SdHoareTripleChecker+Valid, 5419 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:07,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11684 Valid, 5419 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266047 states. [2025-03-16 20:37:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266047 to 65327. [2025-03-16 20:37:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65327 states, 65325 states have (on average 1.4407194795254497) internal successors, (94115), 65326 states have internal predecessors, (94115), 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:37:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65327 states to 65327 states and 94115 transitions. [2025-03-16 20:37:10,117 INFO L78 Accepts]: Start accepts. Automaton has 65327 states and 94115 transitions. Word has length 115 [2025-03-16 20:37:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:10,117 INFO L471 AbstractCegarLoop]: Abstraction has 65327 states and 94115 transitions. [2025-03-16 20:37:10,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:37:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 65327 states and 94115 transitions. [2025-03-16 20:37:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:10,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:10,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:37:10,125 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:10,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 545643584, now seen corresponding path program 1 times [2025-03-16 20:37:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850185170] [2025-03-16 20:37:10,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:10,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:10,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:37:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850185170] [2025-03-16 20:37:10,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850185170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:10,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461866719] [2025-03-16 20:37:10,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:10,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:10,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:10,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:10,317 INFO L87 Difference]: Start difference. First operand 65327 states and 94115 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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:37:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:15,463 INFO L93 Difference]: Finished difference Result 319681 states and 466860 transitions. [2025-03-16 20:37:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 115 [2025-03-16 20:37:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:15,837 INFO L225 Difference]: With dead ends: 319681 [2025-03-16 20:37:15,837 INFO L226 Difference]: Without dead ends: 288063 [2025-03-16 20:37:15,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:15,910 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 11686 mSDsluCounter, 3676 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11686 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:15,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11686 Valid, 5372 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288063 states. [2025-03-16 20:37:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288063 to 107951. [2025-03-16 20:37:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107951 states, 107949 states have (on average 1.4445617838053155) internal successors, (155939), 107950 states have internal predecessors, (155939), 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:37:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107951 states to 107951 states and 155939 transitions. [2025-03-16 20:37:20,747 INFO L78 Accepts]: Start accepts. Automaton has 107951 states and 155939 transitions. Word has length 115 [2025-03-16 20:37:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:20,748 INFO L471 AbstractCegarLoop]: Abstraction has 107951 states and 155939 transitions. [2025-03-16 20:37:20,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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:37:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 107951 states and 155939 transitions. [2025-03-16 20:37:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:20,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:20,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:37:20,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1983840448, now seen corresponding path program 1 times [2025-03-16 20:37:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574784152] [2025-03-16 20:37:20,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:20,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:20,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:20,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:20,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:37:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574784152] [2025-03-16 20:37:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574784152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854866340] [2025-03-16 20:37:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:20,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:20,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:20,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:20,991 INFO L87 Difference]: Start difference. First operand 107951 states and 155939 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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:37:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:26,669 INFO L93 Difference]: Finished difference Result 351297 states and 512812 transitions. [2025-03-16 20:37:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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 115 [2025-03-16 20:37:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:27,162 INFO L225 Difference]: With dead ends: 351297 [2025-03-16 20:37:27,162 INFO L226 Difference]: Without dead ends: 319679 [2025-03-16 20:37:27,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:27,250 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 11707 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11707 SdHoareTripleChecker+Valid, 5293 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:27,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11707 Valid, 5293 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319679 states.