./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.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 d6cbf9f81ba67bad6e6530216804abdcdebcc68311bbd0903d94efa0ae091f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:19:20,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:19:20,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:19:20,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:19:20,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:19:20,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:19:20,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:19:20,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:19:20,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:19:20,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:19:20,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:19:20,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:19:20,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:19:20,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:19:20,086 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:19:20,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:19:20,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:19:20,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:19:20,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:19:20,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:19:20,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:19:20,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:19:20,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:19:20,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:19:20,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:19:20,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:19:20,089 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 -> d6cbf9f81ba67bad6e6530216804abdcdebcc68311bbd0903d94efa0ae091f20 [2025-03-08 07:19:20,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:19:20,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:19:20,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:19:20,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:19:20,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:19:20,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c [2025-03-08 07:19:21,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754cb692d/a2746c92db784157bfae2989acca546e/FLAG1b003e239 [2025-03-08 07:19:21,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:19:21,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c [2025-03-08 07:19:21,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754cb692d/a2746c92db784157bfae2989acca546e/FLAG1b003e239 [2025-03-08 07:19:21,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754cb692d/a2746c92db784157bfae2989acca546e [2025-03-08 07:19:21,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:19:21,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:19:21,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:19:21,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:19:22,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:19:22,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:19:21" (1/1) ... [2025-03-08 07:19:22,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5a079c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:22, skipping insertion in model container [2025-03-08 07:19:22,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:19:21" (1/1) ... [2025-03-08 07:19:22,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:19:22,340 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.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c[11677,11690] [2025-03-08 07:19:22,390 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.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c[18738,18751] [2025-03-08 07:19:22,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:19:22,788 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:19:22,819 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.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c[11677,11690] [2025-03-08 07:19:22,828 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.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c[18738,18751] [2025-03-08 07:19:23,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:19:23,093 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:19:23,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23 WrapperNode [2025-03-08 07:19:23,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:19:23,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:19:23,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:19:23,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:19:23,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,395 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5094 [2025-03-08 07:19:23,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:19:23,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:19:23,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:19:23,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:19:23,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,580 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:19:23,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:19:23,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:19:23,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:19:23,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:19:23,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (1/1) ... [2025-03-08 07:19:23,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:19:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:23,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:19:23,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:19:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:19:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:19:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:19:23,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:19:23,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:19:23,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:19:27,045 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret38#1; [2025-03-08 07:19:27,046 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret39#1; [2025-03-08 07:19:27,046 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret40#1; [2025-03-08 07:19:27,133 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-08 07:19:27,133 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:19:27,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:19:27,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:19:27,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:19:27 BoogieIcfgContainer [2025-03-08 07:19:27,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:19:27,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:19:27,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:19:27,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:19:27,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:19:21" (1/3) ... [2025-03-08 07:19:27,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:19:27, skipping insertion in model container [2025-03-08 07:19:27,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:19:23" (2/3) ... [2025-03-08 07:19:27,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:19:27, skipping insertion in model container [2025-03-08 07:19:27,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:19:27" (3/3) ... [2025-03-08 07:19:27,176 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c [2025-03-08 07:19:27,188 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:19:27,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label04.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:19:27,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:19:27,263 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f835bf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:19:27,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:19:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:19:27,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:27,273 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] [2025-03-08 07:19:27,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:27,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-03-08 07:19:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889904125] [2025-03-08 07:19:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:27,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 07:19:27,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:19:27,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:27,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:27,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889904125] [2025-03-08 07:19:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889904125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:27,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:27,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:19:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802708964] [2025-03-08 07:19:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:19:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:27,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:19:27,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:19:27,485 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:27,546 INFO L93 Difference]: Finished difference Result 1759 states and 3338 transitions. [2025-03-08 07:19:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:19:27,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-08 07:19:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:27,556 INFO L225 Difference]: With dead ends: 1759 [2025-03-08 07:19:27,556 INFO L226 Difference]: Without dead ends: 833 [2025-03-08 07:19:27,560 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-08 07:19:27,563 INFO L435 NwaCegarLoop]: 1640 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, 1640 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-08 07:19:27,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-08 07:19:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-08 07:19:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-03-08 07:19:27,622 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-03-08 07:19:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:27,622 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-03-08 07:19:27,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-03-08 07:19:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:19:27,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:27,623 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] [2025-03-08 07:19:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:19:27,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-03-08 07:19:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116870576] [2025-03-08 07:19:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:27,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 07:19:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:19:27,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116870576] [2025-03-08 07:19:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116870576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:19:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211073088] [2025-03-08 07:19:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:19:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:27,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:19:27,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:19:27,843 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:27,996 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-03-08 07:19:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:19:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-08 07:19:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:28,004 INFO L225 Difference]: With dead ends: 879 [2025-03-08 07:19:28,004 INFO L226 Difference]: Without dead ends: 833 [2025-03-08 07:19:28,005 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-08 07:19:28,006 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:28,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-08 07:19:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-08 07:19:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-03-08 07:19:28,064 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-03-08 07:19:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:28,064 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-03-08 07:19:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-03-08 07:19:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 07:19:28,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:28,065 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] [2025-03-08 07:19:28,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:19:28,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:28,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-03-08 07:19:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:28,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611642337] [2025-03-08 07:19:28,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:28,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 07:19:28,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 07:19:28,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:28,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611642337] [2025-03-08 07:19:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611642337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304686573] [2025-03-08 07:19:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:28,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:28,287 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:28,479 INFO L93 Difference]: Finished difference Result 1253 states and 2213 transitions. [2025-03-08 07:19:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:19:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 07:19:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:28,485 INFO L225 Difference]: With dead ends: 1253 [2025-03-08 07:19:28,485 INFO L226 Difference]: Without dead ends: 1211 [2025-03-08 07:19:28,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:19:28,487 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:28,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-03-08 07:19:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 873. [2025-03-08 07:19:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8450057405281286) internal successors, (1607), 872 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1607 transitions. [2025-03-08 07:19:28,509 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1607 transitions. Word has length 54 [2025-03-08 07:19:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1607 transitions. [2025-03-08 07:19:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1607 transitions. [2025-03-08 07:19:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 07:19:28,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:28,514 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] [2025-03-08 07:19:28,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:19:28,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-03-08 07:19:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419051800] [2025-03-08 07:19:28,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:28,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 07:19:28,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 07:19:28,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:28,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419051800] [2025-03-08 07:19:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419051800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807010034] [2025-03-08 07:19:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:28,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:28,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:28,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:28,598 INFO L87 Difference]: Start difference. First operand 873 states and 1607 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:28,623 INFO L93 Difference]: Finished difference Result 1026 states and 1850 transitions. [2025-03-08 07:19:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 07:19:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:28,627 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 07:19:28,628 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 07:19:28,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:28,629 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 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-08 07:19:28,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 07:19:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-08 07:19:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-03-08 07:19:28,650 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 56 [2025-03-08 07:19:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-03-08 07:19:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-03-08 07:19:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 07:19:28,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:28,654 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] [2025-03-08 07:19:28,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:19:28,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-03-08 07:19:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939630758] [2025-03-08 07:19:28,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:28,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 07:19:28,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 07:19:28,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:28,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939630758] [2025-03-08 07:19:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939630758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:28,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372719543] [2025-03-08 07:19:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:28,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:28,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:28,934 INFO L87 Difference]: Start difference. First operand 942 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,064 INFO L93 Difference]: Finished difference Result 1095 states and 1955 transitions. [2025-03-08 07:19:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 07:19:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,068 INFO L225 Difference]: With dead ends: 1095 [2025-03-08 07:19:29,068 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 07:19:29,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:19:29,069 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5964 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:29,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 1792 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 07:19:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-03-08 07:19:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.8223404255319149) internal successors, (1713), 941 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1713 transitions. [2025-03-08 07:19:29,110 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1713 transitions. Word has length 56 [2025-03-08 07:19:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1713 transitions. [2025-03-08 07:19:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1713 transitions. [2025-03-08 07:19:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 07:19:29,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,111 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] [2025-03-08 07:19:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:19:29,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-03-08 07:19:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287608521] [2025-03-08 07:19:29,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 07:19:29,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 07:19:29,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287608521] [2025-03-08 07:19:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287608521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:19:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574374897] [2025-03-08 07:19:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:19:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:19:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:19:29,318 INFO L87 Difference]: Start difference. First operand 942 states and 1713 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,371 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2025-03-08 07:19:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:19:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-08 07:19:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,374 INFO L225 Difference]: With dead ends: 950 [2025-03-08 07:19:29,375 INFO L226 Difference]: Without dead ends: 948 [2025-03-08 07:19:29,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:19:29,375 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:29,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-08 07:19:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-03-08 07:19:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8160676532769555) internal successors, (1718), 947 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1718 transitions. [2025-03-08 07:19:29,391 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1718 transitions. Word has length 57 [2025-03-08 07:19:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,391 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1718 transitions. [2025-03-08 07:19:29,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1718 transitions. [2025-03-08 07:19:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:19:29,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,392 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] [2025-03-08 07:19:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:19:29,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-03-08 07:19:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446606924] [2025-03-08 07:19:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:19:29,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:19:29,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:29,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446606924] [2025-03-08 07:19:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446606924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860760302] [2025-03-08 07:19:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:29,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,437 INFO L87 Difference]: Start difference. First operand 948 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,462 INFO L93 Difference]: Finished difference Result 1118 states and 1979 transitions. [2025-03-08 07:19:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-08 07:19:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,466 INFO L225 Difference]: With dead ends: 1118 [2025-03-08 07:19:29,466 INFO L226 Difference]: Without dead ends: 1030 [2025-03-08 07:19:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,468 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 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-08 07:19:29,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-03-08 07:19:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2025-03-08 07:19:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1026 states have (on average 1.7923976608187135) internal successors, (1839), 1027 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1839 transitions. [2025-03-08 07:19:29,485 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1839 transitions. Word has length 58 [2025-03-08 07:19:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,486 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1839 transitions. [2025-03-08 07:19:29,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1839 transitions. [2025-03-08 07:19:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:19:29,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,487 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] [2025-03-08 07:19:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:19:29,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-03-08 07:19:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162821770] [2025-03-08 07:19:29,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:19:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:19:29,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162821770] [2025-03-08 07:19:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162821770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:29,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792059374] [2025-03-08 07:19:29,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:29,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,533 INFO L87 Difference]: Start difference. First operand 1028 states and 1839 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,554 INFO L93 Difference]: Finished difference Result 1474 states and 2519 transitions. [2025-03-08 07:19:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-08 07:19:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,559 INFO L225 Difference]: With dead ends: 1474 [2025-03-08 07:19:29,560 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 07:19:29,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,561 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 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-08 07:19:29,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 07:19:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2025-03-08 07:19:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.7417004048582996) internal successors, (2151), 1236 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2151 transitions. [2025-03-08 07:19:29,582 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2151 transitions. Word has length 58 [2025-03-08 07:19:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,584 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2151 transitions. [2025-03-08 07:19:29,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2151 transitions. [2025-03-08 07:19:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:19:29,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,586 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] [2025-03-08 07:19:29,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:19:29,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-03-08 07:19:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659107566] [2025-03-08 07:19:29,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:19:29,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:19:29,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659107566] [2025-03-08 07:19:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659107566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632176688] [2025-03-08 07:19:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:29,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,632 INFO L87 Difference]: Start difference. First operand 1237 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,660 INFO L93 Difference]: Finished difference Result 2077 states and 3413 transitions. [2025-03-08 07:19:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:29,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-08 07:19:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,666 INFO L225 Difference]: With dead ends: 2077 [2025-03-08 07:19:29,666 INFO L226 Difference]: Without dead ends: 1633 [2025-03-08 07:19:29,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,668 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 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-08 07:19:29,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-08 07:19:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1631. [2025-03-08 07:19:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6740331491712708) internal successors, (2727), 1630 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2727 transitions. [2025-03-08 07:19:29,737 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2727 transitions. Word has length 58 [2025-03-08 07:19:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,737 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2727 transitions. [2025-03-08 07:19:29,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2727 transitions. [2025-03-08 07:19:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:19:29,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,738 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] [2025-03-08 07:19:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:19:29,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-03-08 07:19:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829774959] [2025-03-08 07:19:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:19:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:19:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,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-08 07:19:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829774959] [2025-03-08 07:19:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829774959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706662995] [2025-03-08 07:19:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:29,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,791 INFO L87 Difference]: Start difference. First operand 1631 states and 2727 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:29,830 INFO L93 Difference]: Finished difference Result 3211 states and 5057 transitions. [2025-03-08 07:19:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:29,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-08 07:19:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:29,838 INFO L225 Difference]: With dead ends: 3211 [2025-03-08 07:19:29,838 INFO L226 Difference]: Without dead ends: 2373 [2025-03-08 07:19:29,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,840 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 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-08 07:19:29,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-08 07:19:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-03-08 07:19:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2369 states have (on average 1.5968763191219923) internal successors, (3783), 2370 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3783 transitions. [2025-03-08 07:19:29,897 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3783 transitions. Word has length 58 [2025-03-08 07:19:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:29,898 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3783 transitions. [2025-03-08 07:19:29,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3783 transitions. [2025-03-08 07:19:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:19:29,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:29,898 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] [2025-03-08 07:19:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:19:29,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-03-08 07:19:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452148564] [2025-03-08 07:19:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:29,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:19:29,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:19:29,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:29,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452148564] [2025-03-08 07:19:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452148564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19141256] [2025-03-08 07:19:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:29,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:29,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:29,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:29,950 INFO L87 Difference]: Start difference. First operand 2371 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:30,003 INFO L93 Difference]: Finished difference Result 5335 states and 8057 transitions. [2025-03-08 07:19:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:30,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-08 07:19:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:30,014 INFO L225 Difference]: With dead ends: 5335 [2025-03-08 07:19:30,014 INFO L226 Difference]: Without dead ends: 3757 [2025-03-08 07:19:30,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:30,017 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 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-08 07:19:30,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2025-03-08 07:19:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3755. [2025-03-08 07:19:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3753 states have (on average 1.5195843325339728) internal successors, (5703), 3754 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5703 transitions. [2025-03-08 07:19:30,094 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5703 transitions. Word has length 58 [2025-03-08 07:19:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 5703 transitions. [2025-03-08 07:19:30,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 07:19:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5703 transitions. [2025-03-08 07:19:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 07:19:30,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:30,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:30,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:19:30,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:30,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1445214600, now seen corresponding path program 1 times [2025-03-08 07:19:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811760966] [2025-03-08 07:19:30,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 07:19:30,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 07:19:30,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:30,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811760966] [2025-03-08 07:19:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811760966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:30,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:30,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:19:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137138644] [2025-03-08 07:19:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:30,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:30,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:30,147 INFO L87 Difference]: Start difference. First operand 3755 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:32,801 INFO L93 Difference]: Finished difference Result 5259 states and 8576 transitions. [2025-03-08 07:19:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-08 07:19:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:32,813 INFO L225 Difference]: With dead ends: 5259 [2025-03-08 07:19:32,813 INFO L226 Difference]: Without dead ends: 4506 [2025-03-08 07:19:32,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:32,815 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 844 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:32,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 579 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 07:19:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2025-03-08 07:19:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4506. [2025-03-08 07:19:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4504 states have (on average 1.483570159857904) internal successors, (6682), 4505 states have internal predecessors, (6682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 6682 transitions. [2025-03-08 07:19:32,886 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 6682 transitions. Word has length 61 [2025-03-08 07:19:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:32,887 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 6682 transitions. [2025-03-08 07:19:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 6682 transitions. [2025-03-08 07:19:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:19:32,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:32,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:32,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:19:32,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-03-08 07:19:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912962556] [2025-03-08 07:19:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:19:32,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:19:32,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:19:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912962556] [2025-03-08 07:19:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912962556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296624131] [2025-03-08 07:19:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:33,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:33,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:33,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:33,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:33,041 INFO L87 Difference]: Start difference. First operand 4506 states and 6682 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:33,242 INFO L93 Difference]: Finished difference Result 19110 states and 27488 transitions. [2025-03-08 07:19:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 07:19:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:33,282 INFO L225 Difference]: With dead ends: 19110 [2025-03-08 07:19:33,282 INFO L226 Difference]: Without dead ends: 16996 [2025-03-08 07:19:33,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:19:33,291 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6307 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:33,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3694 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2025-03-08 07:19:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 7050. [2025-03-08 07:19:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7048 states have (on average 1.456583427922815) internal successors, (10266), 7049 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10266 transitions. [2025-03-08 07:19:33,535 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10266 transitions. Word has length 77 [2025-03-08 07:19:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:33,535 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10266 transitions. [2025-03-08 07:19:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10266 transitions. [2025-03-08 07:19:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:19:33,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:33,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:33,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:19:33,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:33,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-03-08 07:19:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931159028] [2025-03-08 07:19:33,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:33,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:19:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:19:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:19:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931159028] [2025-03-08 07:19:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931159028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652281551] [2025-03-08 07:19:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:33,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:33,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:33,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:33,645 INFO L87 Difference]: Start difference. First operand 7050 states and 10266 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:33,957 INFO L93 Difference]: Finished difference Result 22070 states and 31680 transitions. [2025-03-08 07:19:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 07:19:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:34,023 INFO L225 Difference]: With dead ends: 22070 [2025-03-08 07:19:34,026 INFO L226 Difference]: Without dead ends: 19108 [2025-03-08 07:19:34,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:19:34,045 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6309 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6309 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:34,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6309 Valid, 3665 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-03-08 07:19:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 11066. [2025-03-08 07:19:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11064 states have (on average 1.4383586406362978) internal successors, (15914), 11065 states have internal predecessors, (15914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 15914 transitions. [2025-03-08 07:19:34,337 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 15914 transitions. Word has length 77 [2025-03-08 07:19:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:34,339 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 15914 transitions. [2025-03-08 07:19:34,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 15914 transitions. [2025-03-08 07:19:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:19:34,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:34,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:34,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:19:34,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-03-08 07:19:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89547137] [2025-03-08 07:19:34,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:19:34,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:19:34,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:34,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:19:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89547137] [2025-03-08 07:19:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89547137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518085083] [2025-03-08 07:19:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:34,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:34,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:34,465 INFO L87 Difference]: Start difference. First operand 11066 states and 15914 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:34,815 INFO L93 Difference]: Finished difference Result 25030 states and 35856 transitions. [2025-03-08 07:19:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 07:19:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:34,850 INFO L225 Difference]: With dead ends: 25030 [2025-03-08 07:19:34,850 INFO L226 Difference]: Without dead ends: 22068 [2025-03-08 07:19:34,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:19:34,857 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:34,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22068 states. [2025-03-08 07:19:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22068 to 14026. [2025-03-08 07:19:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 14024 states have (on average 1.4325442099258414) internal successors, (20090), 14025 states have internal predecessors, (20090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 20090 transitions. [2025-03-08 07:19:35,246 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 20090 transitions. Word has length 77 [2025-03-08 07:19:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 14026 states and 20090 transitions. [2025-03-08 07:19:35,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 20090 transitions. [2025-03-08 07:19:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:19:35,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:35,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:19:35,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-03-08 07:19:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913170154] [2025-03-08 07:19:35,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:19:35,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:19:35,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:35,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:19:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913170154] [2025-03-08 07:19:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913170154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370633091] [2025-03-08 07:19:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:35,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:35,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:35,375 INFO L87 Difference]: Start difference. First operand 14026 states and 20090 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 07:19:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:35,788 INFO L93 Difference]: Finished difference Result 27990 states and 40032 transitions. [2025-03-08 07:19:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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 77 [2025-03-08 07:19:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:35,829 INFO L225 Difference]: With dead ends: 27990 [2025-03-08 07:19:35,830 INFO L226 Difference]: Without dead ends: 25028 [2025-03-08 07:19:35,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:19:35,839 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6367 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6367 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:35,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6367 Valid, 3642 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-03-08 07:19:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 16986. [2025-03-08 07:19:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16984 states have (on average 1.4287564766839378) internal successors, (24266), 16985 states have internal predecessors, (24266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 24266 transitions. [2025-03-08 07:19:36,160 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 24266 transitions. Word has length 77 [2025-03-08 07:19:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:36,160 INFO L471 AbstractCegarLoop]: Abstraction has 16986 states and 24266 transitions. [2025-03-08 07:19:36,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 07:19:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 24266 transitions. [2025-03-08 07:19:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:19:36,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:36,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:36,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:19:36,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:36,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-03-08 07:19:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:36,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466950921] [2025-03-08 07:19:36,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:19:36,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:19:36,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:36,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 07:19:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466950921] [2025-03-08 07:19:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466950921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:19:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604575489] [2025-03-08 07:19:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:19:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:36,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:19:36,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:19:36,299 INFO L87 Difference]: Start difference. First operand 16986 states and 24266 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-08 07:19:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:36,656 INFO L93 Difference]: Finished difference Result 30950 states and 44208 transitions. [2025-03-08 07:19:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:19:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 77 [2025-03-08 07:19:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:36,693 INFO L225 Difference]: With dead ends: 30950 [2025-03-08 07:19:36,693 INFO L226 Difference]: Without dead ends: 27988 [2025-03-08 07:19:36,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:19:36,704 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6325 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6325 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:36,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6325 Valid, 3686 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2025-03-08 07:19:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 19946. [2025-03-08 07:19:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.426093060569595) internal successors, (28442), 19945 states have internal predecessors, (28442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28442 transitions. [2025-03-08 07:19:37,116 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28442 transitions. Word has length 77 [2025-03-08 07:19:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:37,116 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28442 transitions. [2025-03-08 07:19:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-08 07:19:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28442 transitions. [2025-03-08 07:19:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:19:37,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:37,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:19:37,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-03-08 07:19:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035043858] [2025-03-08 07:19:37,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:37,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:19:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:19:37,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035043858] [2025-03-08 07:19:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035043858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:37,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046202510] [2025-03-08 07:19:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:37,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:37,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:37,190 INFO L87 Difference]: Start difference. First operand 19946 states and 28442 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:37,539 INFO L93 Difference]: Finished difference Result 38350 states and 54428 transitions. [2025-03-08 07:19:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 07:19:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:37,569 INFO L225 Difference]: With dead ends: 38350 [2025-03-08 07:19:37,569 INFO L226 Difference]: Without dead ends: 19948 [2025-03-08 07:19:37,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:37,585 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 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-08 07:19:37,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-08 07:19:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 19946. [2025-03-08 07:19:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.411251504211793) internal successors, (28146), 19945 states have internal predecessors, (28146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28146 transitions. [2025-03-08 07:19:38,108 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28146 transitions. Word has length 78 [2025-03-08 07:19:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:38,109 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28146 transitions. [2025-03-08 07:19:38,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28146 transitions. [2025-03-08 07:19:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:19:38,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:38,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:38,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:19:38,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:38,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-03-08 07:19:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819481213] [2025-03-08 07:19:38,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:38,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:19:38,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:19:38,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:38,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819481213] [2025-03-08 07:19:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819481213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786940045] [2025-03-08 07:19:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:38,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:38,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:38,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,198 INFO L87 Difference]: Start difference. First operand 19946 states and 28146 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:38,367 INFO L93 Difference]: Finished difference Result 26833 states and 37840 transitions. [2025-03-08 07:19:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 07:19:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:38,383 INFO L225 Difference]: With dead ends: 26833 [2025-03-08 07:19:38,383 INFO L226 Difference]: Without dead ends: 8431 [2025-03-08 07:19:38,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,398 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 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-08 07:19:38,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2025-03-08 07:19:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8423. [2025-03-08 07:19:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8421 states have (on average 1.4296401852511578) internal successors, (12039), 8422 states have internal predecessors, (12039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12039 transitions. [2025-03-08 07:19:38,591 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12039 transitions. Word has length 79 [2025-03-08 07:19:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 12039 transitions. [2025-03-08 07:19:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12039 transitions. [2025-03-08 07:19:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:19:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:38,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:19:38,595 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:38,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-03-08 07:19:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770408784] [2025-03-08 07:19:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:19:38,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:19:38,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:38,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770408784] [2025-03-08 07:19:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770408784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:38,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577399758] [2025-03-08 07:19:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:38,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:38,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:38,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,687 INFO L87 Difference]: Start difference. First operand 8423 states and 12039 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:38,757 INFO L93 Difference]: Finished difference Result 11859 states and 16825 transitions. [2025-03-08 07:19:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-08 07:19:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:38,765 INFO L225 Difference]: With dead ends: 11859 [2025-03-08 07:19:38,766 INFO L226 Difference]: Without dead ends: 4993 [2025-03-08 07:19:38,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,774 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 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-08 07:19:38,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-08 07:19:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-03-08 07:19:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4989 states have (on average 1.44377630787733) internal successors, (7203), 4990 states have internal predecessors, (7203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7203 transitions. [2025-03-08 07:19:38,850 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7203 transitions. Word has length 80 [2025-03-08 07:19:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:38,850 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 7203 transitions. [2025-03-08 07:19:38,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7203 transitions. [2025-03-08 07:19:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:19:38,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:38,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:38,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:19:38,852 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:38,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-03-08 07:19:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447695498] [2025-03-08 07:19:38,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:38,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:19:38,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:19:38,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:38,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447695498] [2025-03-08 07:19:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447695498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920087372] [2025-03-08 07:19:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:38,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:38,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:38,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,934 INFO L87 Difference]: Start difference. First operand 4991 states and 7203 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:38,970 INFO L93 Difference]: Finished difference Result 6711 states and 9571 transitions. [2025-03-08 07:19:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 07:19:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:38,976 INFO L225 Difference]: With dead ends: 6711 [2025-03-08 07:19:38,977 INFO L226 Difference]: Without dead ends: 3277 [2025-03-08 07:19:38,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:38,980 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 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-08 07:19:38,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-03-08 07:19:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2025-03-08 07:19:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3273 states have (on average 1.4699052856706385) internal successors, (4811), 3274 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4811 transitions. [2025-03-08 07:19:39,027 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4811 transitions. Word has length 82 [2025-03-08 07:19:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:39,028 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4811 transitions. [2025-03-08 07:19:39,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4811 transitions. [2025-03-08 07:19:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 07:19:39,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:39,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:39,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:19:39,030 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-03-08 07:19:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:39,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295082211] [2025-03-08 07:19:39,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:39,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 07:19:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 07:19:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295082211] [2025-03-08 07:19:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295082211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:19:39,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:19:39,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:19:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56995616] [2025-03-08 07:19:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:19:39,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:19:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:39,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:19:39,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:39,097 INFO L87 Difference]: Start difference. First operand 3275 states and 4811 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:39,122 INFO L93 Difference]: Finished difference Result 4137 states and 5983 transitions. [2025-03-08 07:19:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:19:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 07:19:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:39,128 INFO L225 Difference]: With dead ends: 4137 [2025-03-08 07:19:39,129 INFO L226 Difference]: Without dead ends: 2419 [2025-03-08 07:19:39,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:19:39,131 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 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-08 07:19:39,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:19:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-03-08 07:19:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2417. [2025-03-08 07:19:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2415 states have (on average 1.5022774327122153) internal successors, (3628), 2416 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3628 transitions. [2025-03-08 07:19:39,161 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3628 transitions. Word has length 84 [2025-03-08 07:19:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:39,161 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3628 transitions. [2025-03-08 07:19:39,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3628 transitions. [2025-03-08 07:19:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:19:39,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:39,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:39,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:19:39,162 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-03-08 07:19:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574295590] [2025-03-08 07:19:39,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:19:39,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:19:39,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:39,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:19:39,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574295590] [2025-03-08 07:19:39,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574295590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894523797] [2025-03-08 07:19:39,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:39,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:19:39,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:19:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:19:39,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:19:39,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:39,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:39,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:19:39,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:39,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:39,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894523797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:39,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:39,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-03-08 07:19:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128477740] [2025-03-08 07:19:39,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:39,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:19:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:39,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:19:39,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:19:39,926 INFO L87 Difference]: Start difference. First operand 2417 states and 3628 transitions. Second operand has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:40,124 INFO L93 Difference]: Finished difference Result 5245 states and 7399 transitions. [2025-03-08 07:19:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:19:40,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 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 86 [2025-03-08 07:19:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:40,130 INFO L225 Difference]: With dead ends: 5245 [2025-03-08 07:19:40,130 INFO L226 Difference]: Without dead ends: 4357 [2025-03-08 07:19:40,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:19:40,132 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 7574 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7574 SdHoareTripleChecker+Valid, 6518 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:40,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7574 Valid, 6518 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:19:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2025-03-08 07:19:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4294. [2025-03-08 07:19:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 4292 states have (on average 1.408434296365331) internal successors, (6045), 4293 states have internal predecessors, (6045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6045 transitions. [2025-03-08 07:19:40,201 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6045 transitions. Word has length 86 [2025-03-08 07:19:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:40,201 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 6045 transitions. [2025-03-08 07:19:40,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6045 transitions. [2025-03-08 07:19:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:19:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:40,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:40,209 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-08 07:19:40,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 07:19:40,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:40,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1757617236, now seen corresponding path program 1 times [2025-03-08 07:19:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:40,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827413216] [2025-03-08 07:19:40,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:19:40,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:19:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827413216] [2025-03-08 07:19:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827413216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979984049] [2025-03-08 07:19:41,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:41,173 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-08 07:19:41,174 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-08 07:19:41,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:19:41,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:19:41,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:41,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:41,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:19:41,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:41,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979984049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:42,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-03-08 07:19:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849646095] [2025-03-08 07:19:42,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 07:19:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:42,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 07:19:42,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 07:19:42,594 INFO L87 Difference]: Start difference. First operand 4294 states and 6045 transitions. Second operand has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:44,994 INFO L93 Difference]: Finished difference Result 23029 states and 30706 transitions. [2025-03-08 07:19:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 07:19:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 07:19:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:45,014 INFO L225 Difference]: With dead ends: 23029 [2025-03-08 07:19:45,014 INFO L226 Difference]: Without dead ends: 20410 [2025-03-08 07:19:45,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1256, Invalid=6400, Unknown=0, NotChecked=0, Total=7656 [2025-03-08 07:19:45,021 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 14799 mSDsluCounter, 9796 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14799 SdHoareTripleChecker+Valid, 11307 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:45,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14799 Valid, 11307 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:19:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20410 states. [2025-03-08 07:19:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20410 to 13004. [2025-03-08 07:19:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13004 states, 13002 states have (on average 1.3256422088909399) internal successors, (17236), 13003 states have internal predecessors, (17236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 17236 transitions. [2025-03-08 07:19:45,292 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 17236 transitions. Word has length 87 [2025-03-08 07:19:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 13004 states and 17236 transitions. [2025-03-08 07:19:45,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 17236 transitions. [2025-03-08 07:19:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:19:45,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:45,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:45,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:45,498 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,SelfDestructingSolverStorable23 [2025-03-08 07:19:45,498 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-03-08 07:19:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148327139] [2025-03-08 07:19:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:45,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:19:45,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:19:45,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148327139] [2025-03-08 07:19:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148327139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611535219] [2025-03-08 07:19:45,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:45,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:45,725 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-08 07:19:45,726 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-08 07:19:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:19:45,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:19:45,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:45,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:45,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:19:45,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:46,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611535219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:46,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:46,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-08 07:19:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468901908] [2025-03-08 07:19:46,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 07:19:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:46,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 07:19:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 07:19:46,651 INFO L87 Difference]: Start difference. First operand 13004 states and 17236 transitions. Second operand has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:47,848 INFO L93 Difference]: Finished difference Result 45544 states and 59403 transitions. [2025-03-08 07:19:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:19:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 07:19:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:47,879 INFO L225 Difference]: With dead ends: 45544 [2025-03-08 07:19:47,879 INFO L226 Difference]: Without dead ends: 34374 [2025-03-08 07:19:47,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 07:19:47,892 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 18492 mSDsluCounter, 8048 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18492 SdHoareTripleChecker+Valid, 9574 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:47,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18492 Valid, 9574 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:19:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34374 states. [2025-03-08 07:19:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34374 to 34222. [2025-03-08 07:19:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34222 states, 34220 states have (on average 1.2796317942723554) internal successors, (43789), 34221 states have internal predecessors, (43789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34222 states to 34222 states and 43789 transitions. [2025-03-08 07:19:48,632 INFO L78 Accepts]: Start accepts. Automaton has 34222 states and 43789 transitions. Word has length 87 [2025-03-08 07:19:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:48,632 INFO L471 AbstractCegarLoop]: Abstraction has 34222 states and 43789 transitions. [2025-03-08 07:19:48,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34222 states and 43789 transitions. [2025-03-08 07:19:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:19:48,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:48,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:48,643 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-08 07:19:48,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:48,837 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:48,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1583507714, now seen corresponding path program 1 times [2025-03-08 07:19:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539354001] [2025-03-08 07:19:48,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:48,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:19:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:19:48,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:49,105 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-08 07:19:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539354001] [2025-03-08 07:19:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539354001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525815857] [2025-03-08 07:19:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:49,108 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-08 07:19:49,110 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-08 07:19:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:19:49,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:19:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:49,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:19:49,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:49,511 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-08 07:19:49,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:50,148 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-08 07:19:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525815857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:50,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 07:19:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709778646] [2025-03-08 07:19:50,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:50,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 07:19:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:50,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 07:19:50,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 07:19:50,149 INFO L87 Difference]: Start difference. First operand 34222 states and 43789 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:19:51,116 INFO L93 Difference]: Finished difference Result 72879 states and 92922 transitions. [2025-03-08 07:19:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:19:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 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 88 [2025-03-08 07:19:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:19:51,161 INFO L225 Difference]: With dead ends: 72879 [2025-03-08 07:19:51,161 INFO L226 Difference]: Without dead ends: 42109 [2025-03-08 07:19:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:19:51,180 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 12164 mSDsluCounter, 4849 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12164 SdHoareTripleChecker+Valid, 6359 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:19:51,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12164 Valid, 6359 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:19:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42109 states. [2025-03-08 07:19:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42109 to 42105. [2025-03-08 07:19:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42105 states, 42103 states have (on average 1.2746835142388904) internal successors, (53668), 42104 states have internal predecessors, (53668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42105 states to 42105 states and 53668 transitions. [2025-03-08 07:19:52,406 INFO L78 Accepts]: Start accepts. Automaton has 42105 states and 53668 transitions. Word has length 88 [2025-03-08 07:19:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:19:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 42105 states and 53668 transitions. [2025-03-08 07:19:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:19:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 42105 states and 53668 transitions. [2025-03-08 07:19:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 07:19:52,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:19:52,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:19:52,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:19:52,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 07:19:52,609 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:19:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:19:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1347305649, now seen corresponding path program 1 times [2025-03-08 07:19:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:19:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655281398] [2025-03-08 07:19:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:19:52,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:19:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:19:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:19:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655281398] [2025-03-08 07:19:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655281398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:19:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957744468] [2025-03-08 07:19:52,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:19:52,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:19:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:19:52,914 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-08 07:19:52,916 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-08 07:19:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 07:19:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 07:19:53,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:19:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:19:53,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 07:19:53,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:19:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:56,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:19:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:19:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957744468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:19:59,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:19:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 24] total 55 [2025-03-08 07:19:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946441167] [2025-03-08 07:19:59,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:19:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 07:19:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:19:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 07:19:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2656, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 07:19:59,207 INFO L87 Difference]: Start difference. First operand 42105 states and 53668 transitions. Second operand has 55 states, 55 states have (on average 4.490909090909091) internal successors, (247), 55 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)