./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.4.1.ufo.BOUNDED-8.pals+Problem12_label05.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 bdd390d5e78071bb4aa04f25b0496a60dc92b40efe9cfdfa74b0ce4d53b1a5c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:03:58,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:03:58,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:03:58,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:03:58,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:03:58,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:03:58,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:03:58,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:03:58,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:03:58,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:03:58,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:03:58,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:03:58,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:03:58,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:03:58,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:03:58,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:03:58,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:03:58,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:03:58,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:03:58,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:03:58,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:03:58,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:03:58,981 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 -> bdd390d5e78071bb4aa04f25b0496a60dc92b40efe9cfdfa74b0ce4d53b1a5c6 [2025-03-03 16:03:59,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:03:59,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:03:59,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:03:59,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:03:59,224 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:03:59,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c [2025-03-03 16:04:00,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ddf3ac7/19b6faaa7ffa4f0e844048d8b51034c4/FLAG61706ae3a [2025-03-03 16:04:00,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:04:00,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c [2025-03-03 16:04:00,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ddf3ac7/19b6faaa7ffa4f0e844048d8b51034c4/FLAG61706ae3a [2025-03-03 16:04:00,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ddf3ac7/19b6faaa7ffa4f0e844048d8b51034c4 [2025-03-03 16:04:00,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:04:00,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:04:00,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:04:00,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:04:00,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:04:00,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:04:00" (1/1) ... [2025-03-03 16:04:00,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24744c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:00, skipping insertion in model container [2025-03-03 16:04:00,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:04:00" (1/1) ... [2025-03-03 16:04:00,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:04:01,195 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.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c[8653,8666] [2025-03-03 16:04:01,256 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.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c[15589,15602] [2025-03-03 16:04:01,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:04:01,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:04:01,706 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.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c[8653,8666] [2025-03-03 16:04:01,713 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.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c[15589,15602] [2025-03-03 16:04:01,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:04:01,973 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:04:01,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01 WrapperNode [2025-03-03 16:04:01,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:04:01,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:04:01,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:04:01,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:04:01,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,232 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5034 [2025-03-03 16:04:02,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:04:02,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:04:02,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:04:02,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:04:02,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,430 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-03 16:04:02,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:04:02,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:04:02,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:04:02,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:04:02,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (1/1) ... [2025-03-03 16:04:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:04:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:02,698 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-03 16:04:02,700 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-03 16:04:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:04:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:04:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:04:02,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:04:02,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:04:02,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:04:05,980 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5022: havoc calculate_output3_#t~ret36#1; [2025-03-03 16:04:05,980 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2053: havoc calculate_output_#t~ret34#1; [2025-03-03 16:04:05,980 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3532: havoc calculate_output2_#t~ret35#1; [2025-03-03 16:04:06,115 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-03-03 16:04:06,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:04:06,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:04:06,145 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:04:06,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:04:06 BoogieIcfgContainer [2025-03-03 16:04:06,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:04:06,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:04:06,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:04:06,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:04:06,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:04:00" (1/3) ... [2025-03-03 16:04:06,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bbd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:04:06, skipping insertion in model container [2025-03-03 16:04:06,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:04:01" (2/3) ... [2025-03-03 16:04:06,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bbd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:04:06, skipping insertion in model container [2025-03-03 16:04:06,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:04:06" (3/3) ... [2025-03-03 16:04:06,156 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c [2025-03-03 16:04:06,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:04:06,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label05.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:04:06,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:04:06,235 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;@1baf2836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:04:06,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:04:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 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-03 16:04:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:04:06,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:06,248 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] [2025-03-03 16:04:06,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1657989458, now seen corresponding path program 1 times [2025-03-03 16:04:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213643760] [2025-03-03 16:04:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:06,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:04:06,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:04:06,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:06,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:06,403 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-03 16:04:06,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:06,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213643760] [2025-03-03 16:04:06,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213643760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:06,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:06,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:04:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810409632] [2025-03-03 16:04:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:06,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:04:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:06,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:04:06,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:04:06,428 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-03 16:04:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:06,501 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-03-03 16:04:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:04:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2025-03-03 16:04:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:06,516 INFO L225 Difference]: With dead ends: 1739 [2025-03-03 16:04:06,516 INFO L226 Difference]: Without dead ends: 819 [2025-03-03 16:04:06,525 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-03 16:04:06,526 INFO L435 NwaCegarLoop]: 1614 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, 1614 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-03 16:04:06,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-03 16:04:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-03-03 16:04:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 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-03 16:04:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-03-03 16:04:06,602 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-03-03 16:04:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:06,603 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-03-03 16:04:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-03 16:04:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-03-03 16:04:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:04:06,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:06,605 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] [2025-03-03 16:04:06,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:04:06,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:06,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1147455281, now seen corresponding path program 1 times [2025-03-03 16:04:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336268133] [2025-03-03 16:04:06,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:04:06,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:04:06,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:06,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:06,789 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-03 16:04:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336268133] [2025-03-03 16:04:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336268133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:04:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736274838] [2025-03-03 16:04:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:04:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:06,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:04:06,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:04:06,791 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 16:04:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:06,896 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-03-03 16:04:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:04:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-03-03 16:04:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:06,900 INFO L225 Difference]: With dead ends: 895 [2025-03-03 16:04:06,903 INFO L226 Difference]: Without dead ends: 855 [2025-03-03 16:04:06,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:04:06,904 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:06,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:04:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-03 16:04:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-03-03 16:04:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 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-03 16:04:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-03-03 16:04:06,930 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-03-03 16:04:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:06,930 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-03-03 16:04:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 16:04:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-03-03 16:04:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:04:06,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:06,932 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] [2025-03-03 16:04:06,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:04:06,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1619243067, now seen corresponding path program 1 times [2025-03-03 16:04:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858926130] [2025-03-03 16:04:06,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:06,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:04:06,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:04:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:07,092 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-03 16:04:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:07,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858926130] [2025-03-03 16:04:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858926130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045252963] [2025-03-03 16:04:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:07,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:07,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:07,095 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03 16:04:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:07,284 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-03-03 16:04:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:04:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 44 [2025-03-03 16:04:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:07,289 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 16:04:07,289 INFO L226 Difference]: Without dead ends: 1071 [2025-03-03 16:04:07,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:04:07,290 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:07,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:04:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-03 16:04:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-03-03 16:04:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:04:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-03-03 16:04:07,310 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-03-03 16:04:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-03-03 16:04:07,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03 16:04:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-03-03 16:04:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:04:07,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:07,314 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] [2025-03-03 16:04:07,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:04:07,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1860187818, now seen corresponding path program 1 times [2025-03-03 16:04:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276572755] [2025-03-03 16:04:07,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:07,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:04:07,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:04:07,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:07,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:07,407 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-03 16:04:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276572755] [2025-03-03 16:04:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276572755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179944780] [2025-03-03 16:04:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:07,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:07,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:07,409 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03 16:04:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:07,437 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-03-03 16:04:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:07,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2025-03-03 16:04:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:07,441 INFO L225 Difference]: With dead ends: 982 [2025-03-03 16:04:07,441 INFO L226 Difference]: Without dead ends: 912 [2025-03-03 16:04:07,442 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-03 16:04:07,443 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 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-03 16:04:07,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-03 16:04:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-03 16:04:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 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-03 16:04:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-03 16:04:07,466 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-03-03 16:04:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:07,466 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-03 16:04:07,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03 16:04:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-03 16:04:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:04:07,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:07,469 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] [2025-03-03 16:04:07,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:04:07,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:07,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1827864583, now seen corresponding path program 1 times [2025-03-03 16:04:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:07,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600724338] [2025-03-03 16:04:07,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:07,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:07,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:04:07,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:04:07,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:07,705 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-03 16:04:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600724338] [2025-03-03 16:04:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600724338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281628242] [2025-03-03 16:04:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:07,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:07,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:07,707 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-03 16:04:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:07,808 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-03-03 16:04:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:04:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2025-03-03 16:04:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:07,812 INFO L225 Difference]: With dead ends: 1039 [2025-03-03 16:04:07,812 INFO L226 Difference]: Without dead ends: 912 [2025-03-03 16:04:07,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:04:07,813 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:07,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-03 16:04:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-03 16:04:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 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-03 16:04:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-03-03 16:04:07,833 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-03-03 16:04:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:07,833 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-03-03 16:04:07,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-03 16:04:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-03-03 16:04:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 16:04:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:07,835 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] [2025-03-03 16:04:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:04:07,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash -798689491, now seen corresponding path program 1 times [2025-03-03 16:04:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822109025] [2025-03-03 16:04:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:07,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 16:04:07,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 16:04:07,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,016 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-03 16:04:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822109025] [2025-03-03 16:04:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822109025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:04:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955848873] [2025-03-03 16:04:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:04:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:04:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:04:08,017 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03 16:04:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:08,046 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-03-03 16:04:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:04:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2025-03-03 16:04:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:08,050 INFO L225 Difference]: With dead ends: 918 [2025-03-03 16:04:08,050 INFO L226 Difference]: Without dead ends: 916 [2025-03-03 16:04:08,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:04:08,051 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-03 16:04:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-03-03 16:04:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 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-03 16:04:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-03-03 16:04:08,066 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-03-03 16:04:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:08,066 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-03-03 16:04:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-03 16:04:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-03-03 16:04:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:04:08,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:08,070 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] [2025-03-03 16:04:08,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:04:08,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:08,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash -583055145, now seen corresponding path program 1 times [2025-03-03 16:04:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:08,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879517634] [2025-03-03 16:04:08,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:08,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:04:08,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:04:08,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,123 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-03 16:04:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879517634] [2025-03-03 16:04:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879517634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444164817] [2025-03-03 16:04:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:08,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:08,125 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:08,146 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-03-03 16:04:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-03 16:04:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:08,150 INFO L225 Difference]: With dead ends: 1062 [2025-03-03 16:04:08,150 INFO L226 Difference]: Without dead ends: 986 [2025-03-03 16:04:08,151 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-03 16:04:08,151 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 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-03 16:04:08,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-03 16:04:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-03-03 16:04:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 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-03 16:04:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-03-03 16:04:08,169 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-03-03 16:04:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:08,169 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-03-03 16:04:08,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-03-03 16:04:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:04:08,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:08,171 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] [2025-03-03 16:04:08,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:04:08,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1031000681, now seen corresponding path program 1 times [2025-03-03 16:04:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041372318] [2025-03-03 16:04:08,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:08,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:04:08,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:04:08,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:08,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,216 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-03 16:04:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041372318] [2025-03-03 16:04:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041372318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449295499] [2025-03-03 16:04:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:08,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:08,217 INFO L87 Difference]: Start difference. First operand 984 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:08,238 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-03-03 16:04:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:08,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-03 16:04:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:08,241 INFO L225 Difference]: With dead ends: 1358 [2025-03-03 16:04:08,242 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 16:04:08,242 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-03 16:04:08,242 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 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-03 16:04:08,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 16:04:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-03-03 16:04:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 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-03 16:04:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-03-03 16:04:08,261 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-03-03 16:04:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:08,261 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-03-03 16:04:08,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-03-03 16:04:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:04:08,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:08,262 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] [2025-03-03 16:04:08,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:04:08,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash -615824809, now seen corresponding path program 1 times [2025-03-03 16:04:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996330274] [2025-03-03 16:04:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:08,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:04:08,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:04:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,332 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-03 16:04:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996330274] [2025-03-03 16:04:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996330274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054891427] [2025-03-03 16:04:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:08,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:08,337 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:08,386 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-03-03 16:04:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-03 16:04:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:08,391 INFO L225 Difference]: With dead ends: 1853 [2025-03-03 16:04:08,391 INFO L226 Difference]: Without dead ends: 1481 [2025-03-03 16:04:08,392 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-03 16:04:08,394 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 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-03 16:04:08,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-03-03 16:04:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-03-03 16:04:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 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-03 16:04:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-03-03 16:04:08,423 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-03-03 16:04:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-03-03 16:04:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-03-03 16:04:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:04:08,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:08,425 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] [2025-03-03 16:04:08,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:04:08,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1102543081, now seen corresponding path program 1 times [2025-03-03 16:04:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862223236] [2025-03-03 16:04:08,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:04:08,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:04:08,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,481 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-03 16:04:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862223236] [2025-03-03 16:04:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862223236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419982847] [2025-03-03 16:04:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:08,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:08,484 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:08,515 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-03-03 16:04:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:08,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-03 16:04:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:08,535 INFO L225 Difference]: With dead ends: 2771 [2025-03-03 16:04:08,536 INFO L226 Difference]: Without dead ends: 2077 [2025-03-03 16:04:08,537 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-03 16:04:08,537 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 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-03 16:04:08,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-03 16:04:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-03-03 16:04:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 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-03 16:04:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-03-03 16:04:08,586 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-03-03 16:04:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:08,586 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-03-03 16:04:08,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03 16:04:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-03-03 16:04:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:04:08,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:08,587 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] [2025-03-03 16:04:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:04:08,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2111785418, now seen corresponding path program 1 times [2025-03-03 16:04:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:08,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987668262] [2025-03-03 16:04:08,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:08,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:04:08,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:04:08,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:08,704 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-03 16:04:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:08,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987668262] [2025-03-03 16:04:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987668262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556555619] [2025-03-03 16:04:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:08,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:04:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:08,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:04:08,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:04:08,705 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 16:04:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:13,113 INFO L93 Difference]: Finished difference Result 4330 states and 7604 transitions. [2025-03-03 16:04:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:04:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-03-03 16:04:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:13,123 INFO L225 Difference]: With dead ends: 4330 [2025-03-03 16:04:13,124 INFO L226 Difference]: Without dead ends: 3577 [2025-03-03 16:04:13,125 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-03 16:04:13,125 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2353 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:13,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 797 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 16:04:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-03-03 16:04:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577. [2025-03-03 16:04:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.5163636363636364) internal successors, (5421), 3576 states have internal predecessors, (5421), 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-03 16:04:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5421 transitions. [2025-03-03 16:04:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5421 transitions. Word has length 60 [2025-03-03 16:04:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5421 transitions. [2025-03-03 16:04:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 16:04:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5421 transitions. [2025-03-03 16:04:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:04:13,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:13,234 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:04:13,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash -492453955, now seen corresponding path program 1 times [2025-03-03 16:04:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139705455] [2025-03-03 16:04:13,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:04:13,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:04:13,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:13,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:04:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139705455] [2025-03-03 16:04:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139705455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370493345] [2025-03-03 16:04:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:13,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:13,423 INFO L87 Difference]: Start difference. First operand 3577 states and 5421 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03 16:04:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:13,564 INFO L93 Difference]: Finished difference Result 8667 states and 12610 transitions. [2025-03-03 16:04:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:04:13,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 65 [2025-03-03 16:04:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:13,584 INFO L225 Difference]: With dead ends: 8667 [2025-03-03 16:04:13,585 INFO L226 Difference]: Without dead ends: 7737 [2025-03-03 16:04:13,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:04:13,589 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:13,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:04:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-03-03 16:04:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-03-03 16:04:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4877320247493067) internal successors, (6973), 4688 states have internal predecessors, (6973), 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-03 16:04:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6973 transitions. [2025-03-03 16:04:13,686 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6973 transitions. Word has length 65 [2025-03-03 16:04:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6973 transitions. [2025-03-03 16:04:13,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03 16:04:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6973 transitions. [2025-03-03 16:04:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:04:13,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:13,690 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:04:13,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -940399491, now seen corresponding path program 1 times [2025-03-03 16:04:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502566079] [2025-03-03 16:04:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:13,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:04:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:04:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:04:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:13,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502566079] [2025-03-03 16:04:13,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502566079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:13,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:13,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260961567] [2025-03-03 16:04:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:13,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:13,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:13,782 INFO L87 Difference]: Start difference. First operand 4689 states and 6973 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-03 16:04:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:13,956 INFO L93 Difference]: Finished difference Result 9955 states and 14418 transitions. [2025-03-03 16:04:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:04:13,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 65 [2025-03-03 16:04:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:13,979 INFO L225 Difference]: With dead ends: 9955 [2025-03-03 16:04:13,979 INFO L226 Difference]: Without dead ends: 8665 [2025-03-03 16:04:13,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:04:13,984 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:13,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:04:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-03-03 16:04:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-03-03 16:04:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4618729616400061) internal successors, (9413), 6440 states have internal predecessors, (9413), 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-03 16:04:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9413 transitions. [2025-03-03 16:04:14,117 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9413 transitions. Word has length 65 [2025-03-03 16:04:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:14,117 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9413 transitions. [2025-03-03 16:04:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-03 16:04:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9413 transitions. [2025-03-03 16:04:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:04:14,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:14,119 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:14,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:04:14,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:14,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash -525223619, now seen corresponding path program 1 times [2025-03-03 16:04:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309993008] [2025-03-03 16:04:14,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:04:14,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:04:14,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:14,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:04:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:14,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309993008] [2025-03-03 16:04:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309993008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742807924] [2025-03-03 16:04:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:14,217 INFO L87 Difference]: Start difference. First operand 6441 states and 9413 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-03 16:04:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:14,413 INFO L93 Difference]: Finished difference Result 11243 states and 16218 transitions. [2025-03-03 16:04:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:04:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 65 [2025-03-03 16:04:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:14,431 INFO L225 Difference]: With dead ends: 11243 [2025-03-03 16:04:14,431 INFO L226 Difference]: Without dead ends: 9953 [2025-03-03 16:04:14,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:04:14,435 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4671 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4671 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:14,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4671 Valid, 3336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-03-03 16:04:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-03-03 16:04:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.451145334541219) internal successors, (11213), 7728 states have internal predecessors, (11213), 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-03 16:04:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11213 transitions. [2025-03-03 16:04:14,611 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11213 transitions. Word has length 65 [2025-03-03 16:04:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11213 transitions. [2025-03-03 16:04:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-03 16:04:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11213 transitions. [2025-03-03 16:04:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:04:14,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:14,613 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:14,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:04:14,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1011941891, now seen corresponding path program 1 times [2025-03-03 16:04:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60072411] [2025-03-03 16:04:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:04:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:04:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:14,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:04:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:14,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60072411] [2025-03-03 16:04:14,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60072411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:14,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:04:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332362289] [2025-03-03 16:04:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:14,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:04:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:14,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:04:14,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:04:14,692 INFO L87 Difference]: Start difference. First operand 7729 states and 11213 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03 16:04:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:14,868 INFO L93 Difference]: Finished difference Result 12531 states and 18018 transitions. [2025-03-03 16:04:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:04:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 65 [2025-03-03 16:04:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:14,885 INFO L225 Difference]: With dead ends: 12531 [2025-03-03 16:04:14,885 INFO L226 Difference]: Without dead ends: 11241 [2025-03-03 16:04:14,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:04:14,889 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:14,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-03-03 16:04:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-03-03 16:04:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4434830837493067) internal successors, (13013), 9016 states have internal predecessors, (13013), 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-03 16:04:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 13013 transitions. [2025-03-03 16:04:15,020 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 13013 transitions. Word has length 65 [2025-03-03 16:04:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 13013 transitions. [2025-03-03 16:04:15,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03 16:04:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 13013 transitions. [2025-03-03 16:04:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:04:15,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:15,022 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:04:15,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:15,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash 78192369, now seen corresponding path program 1 times [2025-03-03 16:04:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073226202] [2025-03-03 16:04:15,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:15,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:04:15,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:04:15,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073226202] [2025-03-03 16:04:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073226202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339040250] [2025-03-03 16:04:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:15,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:15,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:15,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:15,087 INFO L87 Difference]: Start difference. First operand 9017 states and 13013 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:04:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:15,207 INFO L93 Difference]: Finished difference Result 15749 states and 22431 transitions. [2025-03-03 16:04:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 16:04:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:15,220 INFO L225 Difference]: With dead ends: 15749 [2025-03-03 16:04:15,220 INFO L226 Difference]: Without dead ends: 9019 [2025-03-03 16:04:15,225 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-03 16:04:15,226 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:15,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-03-03 16:04:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-03-03 16:04:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4297282307265669) internal successors, (12889), 9016 states have internal predecessors, (12889), 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-03 16:04:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12889 transitions. [2025-03-03 16:04:15,351 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12889 transitions. Word has length 66 [2025-03-03 16:04:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:15,351 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12889 transitions. [2025-03-03 16:04:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:04:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12889 transitions. [2025-03-03 16:04:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:04:15,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:15,353 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:15,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:04:15,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:15,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash -628102213, now seen corresponding path program 1 times [2025-03-03 16:04:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365070806] [2025-03-03 16:04:15,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:15,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:15,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:04:15,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:04:15,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:15,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365070806] [2025-03-03 16:04:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365070806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309690337] [2025-03-03 16:04:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:15,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:15,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:15,409 INFO L87 Difference]: Start difference. First operand 9017 states and 12889 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03 16:04:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:15,455 INFO L93 Difference]: Finished difference Result 11590 states and 16473 transitions. [2025-03-03 16:04:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-03-03 16:04:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:15,462 INFO L225 Difference]: With dead ends: 11590 [2025-03-03 16:04:15,463 INFO L226 Difference]: Without dead ends: 4860 [2025-03-03 16:04:15,468 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-03 16:04:15,469 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:15,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-03-03 16:04:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-03-03 16:04:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4696907216494846) internal successors, (7128), 4851 states have internal predecessors, (7128), 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-03 16:04:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7128 transitions. [2025-03-03 16:04:15,524 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7128 transitions. Word has length 67 [2025-03-03 16:04:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7128 transitions. [2025-03-03 16:04:15,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03 16:04:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7128 transitions. [2025-03-03 16:04:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:04:15,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:15,525 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:15,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:04:15,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:15,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 667894008, now seen corresponding path program 1 times [2025-03-03 16:04:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:15,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756024488] [2025-03-03 16:04:15,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:15,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:04:15,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:04:15,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:15,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756024488] [2025-03-03 16:04:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756024488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620697271] [2025-03-03 16:04:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:15,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:15,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:15,628 INFO L87 Difference]: Start difference. First operand 4852 states and 7128 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03 16:04:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:15,720 INFO L93 Difference]: Finished difference Result 6132 states and 8890 transitions. [2025-03-03 16:04:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:15,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-03-03 16:04:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:15,726 INFO L225 Difference]: With dead ends: 6132 [2025-03-03 16:04:15,726 INFO L226 Difference]: Without dead ends: 3578 [2025-03-03 16:04:15,729 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-03 16:04:15,729 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:15,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-03-03 16:04:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-03-03 16:04:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4958030218242866) internal successors, (5346), 3575 states have internal predecessors, (5346), 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-03 16:04:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5346 transitions. [2025-03-03 16:04:15,767 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5346 transitions. Word has length 68 [2025-03-03 16:04:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:15,767 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5346 transitions. [2025-03-03 16:04:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03 16:04:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5346 transitions. [2025-03-03 16:04:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:04:15,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:15,768 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:04:15,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1675746273, now seen corresponding path program 1 times [2025-03-03 16:04:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989166222] [2025-03-03 16:04:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:15,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:04:15,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:04:15,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989166222] [2025-03-03 16:04:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989166222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:04:15,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:04:15,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:04:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687926977] [2025-03-03 16:04:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:04:15,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:04:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:15,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:04:15,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:04:15,847 INFO L87 Difference]: Start difference. First operand 3576 states and 5346 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03 16:04:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:15,868 INFO L93 Difference]: Finished difference Result 4218 states and 6217 transitions. [2025-03-03 16:04:15,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:04:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-03-03 16:04:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:15,873 INFO L225 Difference]: With dead ends: 4218 [2025-03-03 16:04:15,873 INFO L226 Difference]: Without dead ends: 2940 [2025-03-03 16:04:15,874 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-03 16:04:15,874 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:15,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:04:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-03-03 16:04:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-03-03 16:04:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.521117166212534) internal successors, (4466), 2937 states have internal predecessors, (4466), 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-03 16:04:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4466 transitions. [2025-03-03 16:04:15,904 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4466 transitions. Word has length 70 [2025-03-03 16:04:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:15,904 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4466 transitions. [2025-03-03 16:04:15,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03 16:04:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4466 transitions. [2025-03-03 16:04:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:04:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:15,905 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:04:15,905 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 642136166, now seen corresponding path program 1 times [2025-03-03 16:04:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337357206] [2025-03-03 16:04:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:15,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:04:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:04:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337357206] [2025-03-03 16:04:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337357206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:04:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486190098] [2025-03-03 16:04:16,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:16,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:16,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:16,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:04:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:04:16,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:04:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:04:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:16,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:04:16,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:04:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:16,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:04:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486190098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:04:16,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:04:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-03-03 16:04:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804744841] [2025-03-03 16:04:16,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:04:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:04:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:04:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:04:16,782 INFO L87 Difference]: Start difference. First operand 2938 states and 4466 transitions. Second operand has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 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-03 16:04:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:18,447 INFO L93 Difference]: Finished difference Result 8007 states and 11103 transitions. [2025-03-03 16:04:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-03 16:04:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 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 72 [2025-03-03 16:04:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:18,458 INFO L225 Difference]: With dead ends: 8007 [2025-03-03 16:04:18,458 INFO L226 Difference]: Without dead ends: 7293 [2025-03-03 16:04:18,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=3486, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 16:04:18,461 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 15130 mSDsluCounter, 9324 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15130 SdHoareTripleChecker+Valid, 10857 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:18,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15130 Valid, 10857 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:04:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7293 states. [2025-03-03 16:04:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7293 to 6705. [2025-03-03 16:04:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 6703 states have (on average 1.3893778904967924) internal successors, (9313), 6704 states have internal predecessors, (9313), 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-03 16:04:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 9313 transitions. [2025-03-03 16:04:18,614 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 9313 transitions. Word has length 72 [2025-03-03 16:04:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:18,614 INFO L471 AbstractCegarLoop]: Abstraction has 6705 states and 9313 transitions. [2025-03-03 16:04:18,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 19 states have internal predecessors, (203), 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-03 16:04:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 9313 transitions. [2025-03-03 16:04:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:04:18,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:18,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:04:18,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:04:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:18,818 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 542316651, now seen corresponding path program 1 times [2025-03-03 16:04:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653484484] [2025-03-03 16:04:18,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:18,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:04:18,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:04:18,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:18,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653484484] [2025-03-03 16:04:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653484484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:04:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471240173] [2025-03-03 16:04:19,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:19,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:04:19,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:04:19,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:04:19,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:04:19,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:19,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:04:19,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:04:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:19,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:04:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471240173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:04:20,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:04:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 16:04:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269987596] [2025-03-03 16:04:20,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:04:20,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:04:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:20,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:04:20,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:04:20,133 INFO L87 Difference]: Start difference. First operand 6705 states and 9313 transitions. Second operand has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 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-03 16:04:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:20,603 INFO L93 Difference]: Finished difference Result 15617 states and 20916 transitions. [2025-03-03 16:04:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:04:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 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 73 [2025-03-03 16:04:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:20,620 INFO L225 Difference]: With dead ends: 15617 [2025-03-03 16:04:20,621 INFO L226 Difference]: Without dead ends: 11505 [2025-03-03 16:04:20,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:04:20,627 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 15158 mSDsluCounter, 4630 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15158 SdHoareTripleChecker+Valid, 6128 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:20,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15158 Valid, 6128 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:04:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11505 states. [2025-03-03 16:04:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11505 to 11353. [2025-03-03 16:04:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11353 states, 11351 states have (on average 1.335212756585323) internal successors, (15156), 11352 states have internal predecessors, (15156), 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-03 16:04:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11353 states to 11353 states and 15156 transitions. [2025-03-03 16:04:20,833 INFO L78 Accepts]: Start accepts. Automaton has 11353 states and 15156 transitions. Word has length 73 [2025-03-03 16:04:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:20,833 INFO L471 AbstractCegarLoop]: Abstraction has 11353 states and 15156 transitions. [2025-03-03 16:04:20,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 22 states have internal predecessors, (175), 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-03 16:04:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11353 states and 15156 transitions. [2025-03-03 16:04:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:04:20,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:20,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:04:20,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:04:21,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 16:04:21,039 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash -893248341, now seen corresponding path program 1 times [2025-03-03 16:04:21,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:21,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102823569] [2025-03-03 16:04:21,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:04:21,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:04:21,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:21,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:21,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102823569] [2025-03-03 16:04:21,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102823569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:04:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142030573] [2025-03-03 16:04:21,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:21,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:21,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:04:21,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:04:21,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:04:21,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:04:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:21,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:04:21,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:04:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:22,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:04:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142030573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:04:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:04:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-03 16:04:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79089059] [2025-03-03 16:04:22,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:04:22,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 16:04:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 16:04:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:04:22,651 INFO L87 Difference]: Start difference. First operand 11353 states and 15156 transitions. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 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-03 16:04:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:23,336 INFO L93 Difference]: Finished difference Result 29799 states and 38851 transitions. [2025-03-03 16:04:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 16:04:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 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 73 [2025-03-03 16:04:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:23,363 INFO L225 Difference]: With dead ends: 29799 [2025-03-03 16:04:23,363 INFO L226 Difference]: Without dead ends: 21195 [2025-03-03 16:04:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 16:04:23,375 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 19648 mSDsluCounter, 6150 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19648 SdHoareTripleChecker+Valid, 7648 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:23,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19648 Valid, 7648 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:04:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21195 states. [2025-03-03 16:04:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21195 to 20911. [2025-03-03 16:04:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20911 states, 20909 states have (on average 1.2930795351284137) internal successors, (27037), 20910 states have internal predecessors, (27037), 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-03 16:04:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 27037 transitions. [2025-03-03 16:04:23,891 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 27037 transitions. Word has length 73 [2025-03-03 16:04:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:23,891 INFO L471 AbstractCegarLoop]: Abstraction has 20911 states and 27037 transitions. [2025-03-03 16:04:23,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 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-03 16:04:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 27037 transitions. [2025-03-03 16:04:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 16:04:23,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:23,893 INFO L218 NwaCegarLoop]: trace histogram [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-03 16:04:23,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:04:24,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:24,093 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1204747137, now seen corresponding path program 1 times [2025-03-03 16:04:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023109459] [2025-03-03 16:04:24,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:04:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:04:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023109459] [2025-03-03 16:04:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023109459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:04:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627701960] [2025-03-03 16:04:24,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:24,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:24,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:04:24,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:04:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:04:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:04:24,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:24,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 16:04:24,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:04:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:27,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:04:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627701960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:04:29,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:04:29,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 20] total 44 [2025-03-03 16:04:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220639846] [2025-03-03 16:04:29,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:04:29,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 16:04:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:29,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 16:04:29,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 16:04:29,070 INFO L87 Difference]: Start difference. First operand 20911 states and 27037 transitions. Second operand has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 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-03 16:04:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:04:45,985 INFO L93 Difference]: Finished difference Result 90637 states and 115357 transitions. [2025-03-03 16:04:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-03-03 16:04:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 16:04:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:04:46,060 INFO L225 Difference]: With dead ends: 90637 [2025-03-03 16:04:46,060 INFO L226 Difference]: Without dead ends: 72843 [2025-03-03 16:04:46,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15354 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=7208, Invalid=31404, Unknown=0, NotChecked=0, Total=38612 [2025-03-03 16:04:46,087 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 13354 mSDsluCounter, 17688 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13354 SdHoareTripleChecker+Valid, 19290 SdHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:04:46,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13354 Valid, 19290 Invalid, 3448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:04:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72843 states. [2025-03-03 16:04:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72843 to 40959. [2025-03-03 16:04:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40959 states, 40957 states have (on average 1.2729692116121787) internal successors, (52137), 40958 states have internal predecessors, (52137), 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-03 16:04:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40959 states to 40959 states and 52137 transitions. [2025-03-03 16:04:47,468 INFO L78 Accepts]: Start accepts. Automaton has 40959 states and 52137 transitions. Word has length 74 [2025-03-03 16:04:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:04:47,468 INFO L471 AbstractCegarLoop]: Abstraction has 40959 states and 52137 transitions. [2025-03-03 16:04:47,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.318181818181818) internal successors, (190), 44 states have internal predecessors, (190), 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-03 16:04:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 40959 states and 52137 transitions. [2025-03-03 16:04:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:04:47,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:04:47,470 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:04:47,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:04:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:47,670 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:04:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:04:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1881637423, now seen corresponding path program 1 times [2025-03-03 16:04:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:04:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287667874] [2025-03-03 16:04:47,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:04:47,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:04:47,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:04:47,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:04:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287667874] [2025-03-03 16:04:48,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287667874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:04:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283410677] [2025-03-03 16:04:48,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:04:48,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:04:48,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:04:48,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:04:48,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:04:48,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:04:49,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:04:49,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:04:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:04:49,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 16:04:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:04:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:51,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:04:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:04:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283410677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:04:53,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:04:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 61 [2025-03-03 16:04:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394392730] [2025-03-03 16:04:53,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:04:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 16:04:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:04:53,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 16:04:53,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:04:53,874 INFO L87 Difference]: Start difference. First operand 40959 states and 52137 transitions. Second operand has 61 states, 61 states have (on average 3.2295081967213113) internal successors, (197), 61 states have internal predecessors, (197), 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)