./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.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 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:20:31,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:20:31,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:20:31,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:20:31,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:20:31,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:20:31,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:20:31,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:20:31,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:20:31,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:20:31,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:20:31,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:20:31,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:20:31,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:20:31,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:20:31,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:20:31,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:20:31,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:20:31,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:20:31,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:20:31,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:20:31,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:20:31,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:31,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:20:31,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:20:31,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:20:31,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:20:31,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:20:31,697 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 -> 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 [2025-03-16 20:20:31,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:20:31,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:20:31,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:20:31,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:20:31,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:20:31,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2025-03-16 20:20:33,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c4fdcf8/9b60640a4fd1473ab395a5cc56f46d6e/FLAG37431d976 [2025-03-16 20:20:33,451 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:20:33,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2025-03-16 20:20:33,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c4fdcf8/9b60640a4fd1473ab395a5cc56f46d6e/FLAG37431d976 [2025-03-16 20:20:33,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c4fdcf8/9b60640a4fd1473ab395a5cc56f46d6e [2025-03-16 20:20:33,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:20:33,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:20:33,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:33,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:20:33,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:20:33,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:33" (1/1) ... [2025-03-16 20:20:33,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba8ab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:33, skipping insertion in model container [2025-03-16 20:20:33,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:33" (1/1) ... [2025-03-16 20:20:33,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:20:33,781 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2025-03-16 20:20:33,805 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2025-03-16 20:20:34,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:34,222 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:20:34,239 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2025-03-16 20:20:34,241 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2025-03-16 20:20:34,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:34,514 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:20:34,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34 WrapperNode [2025-03-16 20:20:34,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:34,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:34,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:20:34,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:20:34,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:34,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:34,782 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-16 20:20:34,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:34,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:20:34,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:20:34,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:20:34,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:34,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:34,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:20:35,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:20:35,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:20:35,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:20:35,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:20:35,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (1/1) ... [2025-03-16 20:20:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:35,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:20:35,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:20:35,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:20:35,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:20:35,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:20:35,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:20:35,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:20:35,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:20:38,831 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-16 20:20:38,832 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-16 20:20:38,832 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-16 20:20:38,964 INFO L? ?]: Removed 729 outVars from TransFormulas that were not future-live. [2025-03-16 20:20:38,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:20:38,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:20:38,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:20:38,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:38 BoogieIcfgContainer [2025-03-16 20:20:38,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:20:38,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:20:38,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:20:39,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:20:39,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:20:33" (1/3) ... [2025-03-16 20:20:39,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478c12bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:39, skipping insertion in model container [2025-03-16 20:20:39,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:34" (2/3) ... [2025-03-16 20:20:39,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478c12bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:39, skipping insertion in model container [2025-03-16 20:20:39,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:38" (3/3) ... [2025-03-16 20:20:39,002 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2025-03-16 20:20:39,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:20:39,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c that has 1 procedures, 807 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:20:39,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:20:39,086 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;@72479879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:20:39,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:20:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 20:20:39,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:39,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 20:20:39,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -57292418, now seen corresponding path program 1 times [2025-03-16 20:20:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957198710] [2025-03-16 20:20:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:39,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 20:20:39,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 20:20:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957198710] [2025-03-16 20:20:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957198710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:20:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153583152] [2025-03-16 20:20:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:39,279 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,168 INFO L93 Difference]: Finished difference Result 2349 states and 4643 transitions. [2025-03-16 20:20:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-16 20:20:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,185 INFO L225 Difference]: With dead ends: 2349 [2025-03-16 20:20:42,185 INFO L226 Difference]: Without dead ends: 1554 [2025-03-16 20:20:42,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:42,190 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 896 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:42,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 168 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 20:20:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-16 20:20:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-16 20:20:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.865979381443299) internal successors, (2896), 1553 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2896 transitions. [2025-03-16 20:20:42,264 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2896 transitions. Word has length 6 [2025-03-16 20:20:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,264 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2896 transitions. [2025-03-16 20:20:42,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2896 transitions. [2025-03-16 20:20:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:20:42,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:42,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:20:42,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash 474899080, now seen corresponding path program 1 times [2025-03-16 20:20:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295727479] [2025-03-16 20:20:42,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:20:42,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:20:42,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295727479] [2025-03-16 20:20:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295727479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:20:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944877321] [2025-03-16 20:20:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:20:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:20:42,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:42,401 INFO L87 Difference]: Start difference. First operand 1554 states and 2896 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,446 INFO L93 Difference]: Finished difference Result 1615 states and 2991 transitions. [2025-03-16 20:20:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:20:42,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:20:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,452 INFO L225 Difference]: With dead ends: 1615 [2025-03-16 20:20:42,452 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:20:42,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:42,453 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 45 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:42,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4533 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:20:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1554. [2025-03-16 20:20:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.8556701030927836) internal successors, (2880), 1553 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2880 transitions. [2025-03-16 20:20:42,486 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2880 transitions. Word has length 17 [2025-03-16 20:20:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,486 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2880 transitions. [2025-03-16 20:20:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2880 transitions. [2025-03-16 20:20:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:20:42,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,488 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] [2025-03-16 20:20:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:20:42,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1346779243, now seen corresponding path program 1 times [2025-03-16 20:20:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566164836] [2025-03-16 20:20:42,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:20:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:20:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566164836] [2025-03-16 20:20:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566164836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839804701] [2025-03-16 20:20:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:42,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:42,629 INFO L87 Difference]: Start difference. First operand 1554 states and 2880 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,733 INFO L93 Difference]: Finished difference Result 1728 states and 3156 transitions. [2025-03-16 20:20:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:20:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 20:20:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,744 INFO L225 Difference]: With dead ends: 1728 [2025-03-16 20:20:42,745 INFO L226 Difference]: Without dead ends: 1699 [2025-03-16 20:20:42,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:20:42,747 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 4611 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:42,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1759 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-16 20:20:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1581. [2025-03-16 20:20:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.8511716276124128) internal successors, (2923), 1580 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2923 transitions. [2025-03-16 20:20:42,779 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2923 transitions. Word has length 32 [2025-03-16 20:20:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2923 transitions. [2025-03-16 20:20:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2923 transitions. [2025-03-16 20:20:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:42,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,781 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] [2025-03-16 20:20:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:20:42,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1506878637, now seen corresponding path program 1 times [2025-03-16 20:20:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883910545] [2025-03-16 20:20:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:42,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:42,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883910545] [2025-03-16 20:20:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883910545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801061148] [2025-03-16 20:20:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:42,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:42,982 INFO L87 Difference]: Start difference. First operand 1581 states and 2923 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,099 INFO L93 Difference]: Finished difference Result 1639 states and 3013 transitions. [2025-03-16 20:20:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:20:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,104 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 20:20:43,105 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:20:43,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:43,109 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 4411 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1584 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:20:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1581. [2025-03-16 20:20:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.850538315389487) internal successors, (2922), 1580 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2922 transitions. [2025-03-16 20:20:43,137 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2922 transitions. Word has length 34 [2025-03-16 20:20:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2922 transitions. [2025-03-16 20:20:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2922 transitions. [2025-03-16 20:20:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:43,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,139 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] [2025-03-16 20:20:43,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:20:43,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1505835952, now seen corresponding path program 1 times [2025-03-16 20:20:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037819261] [2025-03-16 20:20:43,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:43,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:43,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037819261] [2025-03-16 20:20:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037819261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364865418] [2025-03-16 20:20:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:43,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,197 INFO L87 Difference]: Start difference. First operand 1581 states and 2922 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,222 INFO L93 Difference]: Finished difference Result 1682 states and 3079 transitions. [2025-03-16 20:20:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:20:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,227 INFO L225 Difference]: With dead ends: 1682 [2025-03-16 20:20:43,227 INFO L226 Difference]: Without dead ends: 1626 [2025-03-16 20:20:43,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,229 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-03-16 20:20:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2025-03-16 20:20:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.841553637484587) internal successors, (2987), 1623 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2987 transitions. [2025-03-16 20:20:43,257 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2987 transitions. Word has length 34 [2025-03-16 20:20:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2987 transitions. [2025-03-16 20:20:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2987 transitions. [2025-03-16 20:20:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:20:43,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,261 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] [2025-03-16 20:20:43,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:20:43,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -530417449, now seen corresponding path program 1 times [2025-03-16 20:20:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615586788] [2025-03-16 20:20:43,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:20:43,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:20:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615586788] [2025-03-16 20:20:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615586788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:20:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770178969] [2025-03-16 20:20:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:20:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:20:43,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:43,425 INFO L87 Difference]: Start difference. First operand 1624 states and 2987 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,452 INFO L93 Difference]: Finished difference Result 1630 states and 2994 transitions. [2025-03-16 20:20:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:20:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 20:20:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,459 INFO L225 Difference]: With dead ends: 1630 [2025-03-16 20:20:43,459 INFO L226 Difference]: Without dead ends: 1628 [2025-03-16 20:20:43,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:43,461 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 0 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4501 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4501 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-16 20:20:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2025-03-16 20:20:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1626 states have (on average 1.8388683886838868) internal successors, (2990), 1627 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2990 transitions. [2025-03-16 20:20:43,491 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2990 transitions. Word has length 35 [2025-03-16 20:20:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2990 transitions. [2025-03-16 20:20:43,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2990 transitions. [2025-03-16 20:20:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:43,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,492 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] [2025-03-16 20:20:43,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:20:43,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236593, now seen corresponding path program 1 times [2025-03-16 20:20:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145556662] [2025-03-16 20:20:43,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:43,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:43,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145556662] [2025-03-16 20:20:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145556662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600063235] [2025-03-16 20:20:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:43,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:43,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,528 INFO L87 Difference]: Start difference. First operand 1628 states and 2990 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,551 INFO L93 Difference]: Finished difference Result 1818 states and 3274 transitions. [2025-03-16 20:20:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,557 INFO L225 Difference]: With dead ends: 1818 [2025-03-16 20:20:43,557 INFO L226 Difference]: Without dead ends: 1715 [2025-03-16 20:20:43,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,558 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-16 20:20:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1713. [2025-03-16 20:20:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1711 states have (on average 1.8194038573933373) internal successors, (3113), 1712 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 3113 transitions. [2025-03-16 20:20:43,586 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 3113 transitions. Word has length 36 [2025-03-16 20:20:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,586 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 3113 transitions. [2025-03-16 20:20:43,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 3113 transitions. [2025-03-16 20:20:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:43,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:43,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:20:43,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1756941775, now seen corresponding path program 1 times [2025-03-16 20:20:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653952826] [2025-03-16 20:20:43,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:43,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:43,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653952826] [2025-03-16 20:20:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653952826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916835727] [2025-03-16 20:20:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:43,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,621 INFO L87 Difference]: Start difference. First operand 1713 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,645 INFO L93 Difference]: Finished difference Result 2057 states and 3615 transitions. [2025-03-16 20:20:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,651 INFO L225 Difference]: With dead ends: 2057 [2025-03-16 20:20:43,651 INFO L226 Difference]: Without dead ends: 1869 [2025-03-16 20:20:43,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,653 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1470 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-16 20:20:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1867. [2025-03-16 20:20:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1865 states have (on average 1.7839142091152815) internal successors, (3327), 1866 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 3327 transitions. [2025-03-16 20:20:43,684 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 3327 transitions. Word has length 36 [2025-03-16 20:20:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,684 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 3327 transitions. [2025-03-16 20:20:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 3327 transitions. [2025-03-16 20:20:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:43,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,685 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] [2025-03-16 20:20:43,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:20:43,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1922054193, now seen corresponding path program 1 times [2025-03-16 20:20:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740319301] [2025-03-16 20:20:43,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:43,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:43,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740319301] [2025-03-16 20:20:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740319301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49696511] [2025-03-16 20:20:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:43,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,722 INFO L87 Difference]: Start difference. First operand 1867 states and 3327 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:43,747 INFO L93 Difference]: Finished difference Result 2241 states and 3876 transitions. [2025-03-16 20:20:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:43,754 INFO L225 Difference]: With dead ends: 2241 [2025-03-16 20:20:43,754 INFO L226 Difference]: Without dead ends: 2039 [2025-03-16 20:20:43,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:43,758 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1474 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:43,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-03-16 20:20:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2025-03-16 20:20:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.7518427518427517) internal successors, (3565), 2036 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3565 transitions. [2025-03-16 20:20:43,797 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3565 transitions. Word has length 36 [2025-03-16 20:20:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:43,797 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3565 transitions. [2025-03-16 20:20:43,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3565 transitions. [2025-03-16 20:20:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:43,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:43,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:43,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:20:43,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:43,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash 512007547, now seen corresponding path program 1 times [2025-03-16 20:20:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:43,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586082757] [2025-03-16 20:20:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:43,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:43,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:20:43,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586082757] [2025-03-16 20:20:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586082757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367558384] [2025-03-16 20:20:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:43,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:43,947 INFO L87 Difference]: Start difference. First operand 2037 states and 3565 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:44,029 INFO L93 Difference]: Finished difference Result 3685 states and 5909 transitions. [2025-03-16 20:20:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:44,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 20:20:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:44,039 INFO L225 Difference]: With dead ends: 3685 [2025-03-16 20:20:44,039 INFO L226 Difference]: Without dead ends: 3175 [2025-03-16 20:20:44,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:20:44,041 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 3033 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:44,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3145 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-03-16 20:20:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2545. [2025-03-16 20:20:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.6834447502949272) internal successors, (4281), 2544 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4281 transitions. [2025-03-16 20:20:44,088 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4281 transitions. Word has length 50 [2025-03-16 20:20:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:44,088 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4281 transitions. [2025-03-16 20:20:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4281 transitions. [2025-03-16 20:20:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:44,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:44,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:20:44,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -37781381, now seen corresponding path program 1 times [2025-03-16 20:20:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28659862] [2025-03-16 20:20:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:44,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:44,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:44,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:20:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28659862] [2025-03-16 20:20:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28659862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925755462] [2025-03-16 20:20:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:44,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:44,184 INFO L87 Difference]: Start difference. First operand 2545 states and 4281 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:44,275 INFO L93 Difference]: Finished difference Result 4193 states and 6625 transitions. [2025-03-16 20:20:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-03-16 20:20:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:44,286 INFO L225 Difference]: With dead ends: 4193 [2025-03-16 20:20:44,286 INFO L226 Difference]: Without dead ends: 3683 [2025-03-16 20:20:44,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:20:44,288 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 3039 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:44,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2025-03-16 20:20:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3309. [2025-03-16 20:20:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 3307 states have (on average 1.6162685213184156) internal successors, (5345), 3308 states have internal predecessors, (5345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 5345 transitions. [2025-03-16 20:20:44,356 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 5345 transitions. Word has length 50 [2025-03-16 20:20:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:44,356 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 5345 transitions. [2025-03-16 20:20:44,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 5345 transitions. [2025-03-16 20:20:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:44,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:44,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:44,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:20:44,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:44,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash 578189947, now seen corresponding path program 1 times [2025-03-16 20:20:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:44,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893075385] [2025-03-16 20:20:44,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:44,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:44,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:44,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893075385] [2025-03-16 20:20:44,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893075385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:44,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:44,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001244878] [2025-03-16 20:20:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:44,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:44,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:44,432 INFO L87 Difference]: Start difference. First operand 3309 states and 5345 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:44,523 INFO L93 Difference]: Finished difference Result 4421 states and 6957 transitions. [2025-03-16 20:20:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2025-03-16 20:20:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:44,531 INFO L225 Difference]: With dead ends: 4421 [2025-03-16 20:20:44,531 INFO L226 Difference]: Without dead ends: 4051 [2025-03-16 20:20:44,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:20:44,533 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 3032 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3032 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:44,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3032 Valid, 3155 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2025-03-16 20:20:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2025-03-16 20:20:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.598095238095238) internal successors, (5873), 3676 states have internal predecessors, (5873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5873 transitions. [2025-03-16 20:20:44,698 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5873 transitions. Word has length 50 [2025-03-16 20:20:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:44,698 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5873 transitions. [2025-03-16 20:20:44,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5873 transitions. [2025-03-16 20:20:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:20:44,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:44,699 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] [2025-03-16 20:20:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:20:44,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:44,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1763746431, now seen corresponding path program 1 times [2025-03-16 20:20:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097627238] [2025-03-16 20:20:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:44,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:20:44,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:20:44,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097627238] [2025-03-16 20:20:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097627238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084408619] [2025-03-16 20:20:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:44,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:44,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:44,816 INFO L87 Difference]: Start difference. First operand 3677 states and 5873 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:44,871 INFO L93 Difference]: Finished difference Result 5829 states and 8911 transitions. [2025-03-16 20:20:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:44,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 20:20:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:44,878 INFO L225 Difference]: With dead ends: 5829 [2025-03-16 20:20:44,878 INFO L226 Difference]: Without dead ends: 3679 [2025-03-16 20:20:44,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:44,881 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 29 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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-16 20:20:44,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2025-03-16 20:20:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2025-03-16 20:20:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5844897959183672) internal successors, (5823), 3676 states have internal predecessors, (5823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5823 transitions. [2025-03-16 20:20:44,961 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5823 transitions. Word has length 51 [2025-03-16 20:20:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5823 transitions. [2025-03-16 20:20:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5823 transitions. [2025-03-16 20:20:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:20:44,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:44,963 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] [2025-03-16 20:20:44,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:20:44,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804163, now seen corresponding path program 1 times [2025-03-16 20:20:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628709371] [2025-03-16 20:20:44,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:20:44,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:20:44,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628709371] [2025-03-16 20:20:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628709371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908154923] [2025-03-16 20:20:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:45,030 INFO L87 Difference]: Start difference. First operand 3677 states and 5823 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:45,060 INFO L93 Difference]: Finished difference Result 4523 states and 7010 transitions. [2025-03-16 20:20:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:20:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:45,064 INFO L225 Difference]: With dead ends: 4523 [2025-03-16 20:20:45,064 INFO L226 Difference]: Without dead ends: 2373 [2025-03-16 20:20:45,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:45,067 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 23 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3013 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-16 20:20:45,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3013 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-16 20:20:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2025-03-16 20:20:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.6912013536379018) internal successors, (3998), 2365 states have internal predecessors, (3998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3998 transitions. [2025-03-16 20:20:45,105 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3998 transitions. Word has length 52 [2025-03-16 20:20:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:45,105 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3998 transitions. [2025-03-16 20:20:45,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3998 transitions. [2025-03-16 20:20:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:20:45,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:45,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:45,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:20:45,106 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:45,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 120675386, now seen corresponding path program 1 times [2025-03-16 20:20:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27589455] [2025-03-16 20:20:45,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:45,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:20:45,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:20:45,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27589455] [2025-03-16 20:20:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27589455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:45,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:45,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635526716] [2025-03-16 20:20:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:45,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:45,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:45,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:45,171 INFO L87 Difference]: Start difference. First operand 2366 states and 3998 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:45,197 INFO L93 Difference]: Finished difference Result 2784 states and 4576 transitions. [2025-03-16 20:20:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:20:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:45,201 INFO L225 Difference]: With dead ends: 2784 [2025-03-16 20:20:45,201 INFO L226 Difference]: Without dead ends: 1954 [2025-03-16 20:20:45,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:45,202 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 25 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2992 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-16 20:20:45,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2992 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-03-16 20:20:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2025-03-16 20:20:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.7502564102564102) internal successors, (3413), 1951 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3413 transitions. [2025-03-16 20:20:45,254 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3413 transitions. Word has length 53 [2025-03-16 20:20:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3413 transitions. [2025-03-16 20:20:45,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3413 transitions. [2025-03-16 20:20:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:20:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:45,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:45,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:20:45,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 637021683, now seen corresponding path program 1 times [2025-03-16 20:20:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923700219] [2025-03-16 20:20:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:45,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:20:45,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:20:45,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:45,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923700219] [2025-03-16 20:20:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923700219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582075907] [2025-03-16 20:20:45,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:45,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:45,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:45,616 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-16 20:20:45,618 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-16 20:20:45,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:20:45,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:20:45,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:45,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:20:45,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:46,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582075907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:46,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:20:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089689524] [2025-03-16 20:20:46,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:46,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:20:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:46,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:20:46,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:20:46,649 INFO L87 Difference]: Start difference. First operand 1952 states and 3413 transitions. Second operand has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:47,751 INFO L93 Difference]: Finished difference Result 3258 states and 5200 transitions. [2025-03-16 20:20:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 20:20:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 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 55 [2025-03-16 20:20:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:47,756 INFO L225 Difference]: With dead ends: 3258 [2025-03-16 20:20:47,757 INFO L226 Difference]: Without dead ends: 2842 [2025-03-16 20:20:47,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=488, Invalid=1674, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:20:47,759 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 19931 mSDsluCounter, 6161 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19931 SdHoareTripleChecker+Valid, 7638 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:47,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19931 Valid, 7638 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:20:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2025-03-16 20:20:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2825. [2025-03-16 20:20:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.6202621324831739) internal successors, (4574), 2824 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4574 transitions. [2025-03-16 20:20:47,806 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4574 transitions. Word has length 55 [2025-03-16 20:20:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:47,807 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4574 transitions. [2025-03-16 20:20:47,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 24 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4574 transitions. [2025-03-16 20:20:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:20:47,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:47,808 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:20:47,829 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-16 20:20:48,012 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,SelfDestructingSolverStorable15 [2025-03-16 20:20:48,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 564417798, now seen corresponding path program 1 times [2025-03-16 20:20:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588781285] [2025-03-16 20:20:48,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:48,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:20:48,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:20:48,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588781285] [2025-03-16 20:20:48,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588781285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524600948] [2025-03-16 20:20:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:48,262 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-16 20:20:48,263 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-16 20:20:48,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:20:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:20:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:20:48,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:48,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524600948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:49,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:20:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279452430] [2025-03-16 20:20:49,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:49,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:20:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:20:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:20:49,037 INFO L87 Difference]: Start difference. First operand 2825 states and 4574 transitions. Second operand has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:49,431 INFO L93 Difference]: Finished difference Result 5567 states and 8276 transitions. [2025-03-16 20:20:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:20:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 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-16 20:20:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:49,438 INFO L225 Difference]: With dead ends: 5567 [2025-03-16 20:20:49,439 INFO L226 Difference]: Without dead ends: 4278 [2025-03-16 20:20:49,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:20:49,441 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 16558 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16558 SdHoareTripleChecker+Valid, 4649 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:49,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16558 Valid, 4649 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:20:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-03-16 20:20:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4220. [2025-03-16 20:20:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4218 states have (on average 1.513276434329066) internal successors, (6383), 4219 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6383 transitions. [2025-03-16 20:20:49,516 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6383 transitions. Word has length 56 [2025-03-16 20:20:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:49,516 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6383 transitions. [2025-03-16 20:20:49,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 22 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6383 transitions. [2025-03-16 20:20:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:20:49,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:49,517 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:20:49,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:20:49,718 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,SelfDestructingSolverStorable16 [2025-03-16 20:20:49,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1547711768, now seen corresponding path program 1 times [2025-03-16 20:20:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992930076] [2025-03-16 20:20:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:49,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:49,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:49,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:49,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:51,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992930076] [2025-03-16 20:20:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992930076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:51,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306735768] [2025-03-16 20:20:51,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:51,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:51,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:51,235 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-16 20:20:51,237 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-16 20:20:51,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:51,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:51,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:51,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:20:51,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:52,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306735768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:52,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 17] total 45 [2025-03-16 20:20:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316071993] [2025-03-16 20:20:52,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:52,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 20:20:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:52,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 20:20:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 20:20:52,713 INFO L87 Difference]: Start difference. First operand 4220 states and 6383 transitions. Second operand has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:01,194 INFO L93 Difference]: Finished difference Result 11451 states and 15854 transitions. [2025-03-16 20:21:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-16 20:21:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 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-16 20:21:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:01,207 INFO L225 Difference]: With dead ends: 11451 [2025-03-16 20:21:01,207 INFO L226 Difference]: Without dead ends: 10257 [2025-03-16 20:21:01,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13221 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7344, Invalid=24876, Unknown=0, NotChecked=0, Total=32220 [2025-03-16 20:21:01,214 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 20455 mSDsluCounter, 18873 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20455 SdHoareTripleChecker+Valid, 20387 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:01,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20455 Valid, 20387 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:21:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10257 states. [2025-03-16 20:21:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10257 to 4022. [2025-03-16 20:21:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4020 states have (on average 1.5196517412935324) internal successors, (6109), 4021 states have internal predecessors, (6109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6109 transitions. [2025-03-16 20:21:01,324 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 6109 transitions. Word has length 57 [2025-03-16 20:21:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:01,325 INFO L471 AbstractCegarLoop]: Abstraction has 4022 states and 6109 transitions. [2025-03-16 20:21:01,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.3333333333333335) internal successors, (150), 45 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 6109 transitions. [2025-03-16 20:21:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:21:01,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:01,326 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:01,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:21:01,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:21:01,527 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1121316136, now seen corresponding path program 1 times [2025-03-16 20:21:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186455754] [2025-03-16 20:21:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:01,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186455754] [2025-03-16 20:21:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186455754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714254468] [2025-03-16 20:21:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:02,132 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-16 20:21:02,139 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-16 20:21:02,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:02,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:02,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:02,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:02,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 20:21:02,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:04,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:05,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714254468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:05,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:05,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 19] total 44 [2025-03-16 20:21:05,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836501639] [2025-03-16 20:21:05,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:05,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 20:21:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:05,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 20:21:05,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:21:05,814 INFO L87 Difference]: Start difference. First operand 4022 states and 6109 transitions. Second operand has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:08,626 INFO L93 Difference]: Finished difference Result 5437 states and 7985 transitions. [2025-03-16 20:21:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-16 20:21:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 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-16 20:21:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:08,634 INFO L225 Difference]: With dead ends: 5437 [2025-03-16 20:21:08,634 INFO L226 Difference]: Without dead ends: 4235 [2025-03-16 20:21:08,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1479, Invalid=6003, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 20:21:08,637 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 20035 mSDsluCounter, 19480 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20035 SdHoareTripleChecker+Valid, 20986 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20035 Valid, 20986 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:21:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-03-16 20:21:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3632. [2025-03-16 20:21:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 3630 states have (on average 1.5424242424242425) internal successors, (5599), 3631 states have internal predecessors, (5599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5599 transitions. [2025-03-16 20:21:08,718 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5599 transitions. Word has length 57 [2025-03-16 20:21:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:08,718 INFO L471 AbstractCegarLoop]: Abstraction has 3632 states and 5599 transitions. [2025-03-16 20:21:08,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.477272727272727) internal successors, (153), 44 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5599 transitions. [2025-03-16 20:21:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:08,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:08,719 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:21:08,725 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-16 20:21:08,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:08,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:08,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1745447079, now seen corresponding path program 1 times [2025-03-16 20:21:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406883972] [2025-03-16 20:21:08,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:08,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406883972] [2025-03-16 20:21:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406883972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751769904] [2025-03-16 20:21:09,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:09,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:09,003 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-16 20:21:09,004 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-16 20:21:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:09,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:09,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 20:21:09,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:09,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751769904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:09,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-16 20:21:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789639080] [2025-03-16 20:21:09,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:21:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:21:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:21:09,283 INFO L87 Difference]: Start difference. First operand 3632 states and 5599 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:09,460 INFO L93 Difference]: Finished difference Result 7078 states and 9986 transitions. [2025-03-16 20:21:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:21:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 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-16 20:21:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:09,471 INFO L225 Difference]: With dead ends: 7078 [2025-03-16 20:21:09,472 INFO L226 Difference]: Without dead ends: 4982 [2025-03-16 20:21:09,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:21:09,474 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 4389 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4389 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:09,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4389 Valid, 4660 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2025-03-16 20:21:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4780. [2025-03-16 20:21:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 4778 states have (on average 1.438049393051486) internal successors, (6871), 4779 states have internal predecessors, (6871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 6871 transitions. [2025-03-16 20:21:09,598 INFO L78 Accepts]: Start accepts. Automaton has 4780 states and 6871 transitions. Word has length 58 [2025-03-16 20:21:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:09,598 INFO L471 AbstractCegarLoop]: Abstraction has 4780 states and 6871 transitions. [2025-03-16 20:21:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4780 states and 6871 transitions. [2025-03-16 20:21:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:09,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:09,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:09,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:09,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:09,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1540464325, now seen corresponding path program 1 times [2025-03-16 20:21:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266719686] [2025-03-16 20:21:09,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:09,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:09,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266719686] [2025-03-16 20:21:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266719686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210184698] [2025-03-16 20:21:10,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:10,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:10,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:10,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:10,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:21:10,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:10,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:10,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:10,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:10,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:21:10,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:12,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210184698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:14,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:14,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 16] total 53 [2025-03-16 20:21:14,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506232042] [2025-03-16 20:21:14,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:14,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:21:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:14,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:21:14,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:21:14,090 INFO L87 Difference]: Start difference. First operand 4780 states and 6871 transitions. Second operand has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:32,335 INFO L93 Difference]: Finished difference Result 13260 states and 17392 transitions. [2025-03-16 20:21:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-16 20:21:32,335 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 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-16 20:21:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:32,351 INFO L225 Difference]: With dead ends: 13260 [2025-03-16 20:21:32,351 INFO L226 Difference]: Without dead ends: 10920 [2025-03-16 20:21:32,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11265 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=6171, Invalid=24981, Unknown=0, NotChecked=0, Total=31152 [2025-03-16 20:21:32,357 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 27022 mSDsluCounter, 16504 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27022 SdHoareTripleChecker+Valid, 18037 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:32,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27022 Valid, 18037 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:21:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2025-03-16 20:21:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 6162. [2025-03-16 20:21:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6160 states have (on average 1.3866883116883117) internal successors, (8542), 6161 states have internal predecessors, (8542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 8542 transitions. [2025-03-16 20:21:32,698 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 8542 transitions. Word has length 58 [2025-03-16 20:21:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 6162 states and 8542 transitions. [2025-03-16 20:21:32,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8542 transitions. [2025-03-16 20:21:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:21:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:32,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:32,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:32,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:32,904 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1483340795, now seen corresponding path program 1 times [2025-03-16 20:21:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:32,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353963852] [2025-03-16 20:21:32,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:32,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:32,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:32,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:32,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353963852] [2025-03-16 20:21:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353963852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315375252] [2025-03-16 20:21:33,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:33,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:33,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:21:33,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:33,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:33,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:33,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:21:33,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:33,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315375252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:34,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-16 20:21:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961457309] [2025-03-16 20:21:34,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 20:21:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:34,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 20:21:34,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:21:34,650 INFO L87 Difference]: Start difference. First operand 6162 states and 8542 transitions. Second operand has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:35,911 INFO L93 Difference]: Finished difference Result 10023 states and 13412 transitions. [2025-03-16 20:21:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 20:21:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:21:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:35,922 INFO L225 Difference]: With dead ends: 10023 [2025-03-16 20:21:35,922 INFO L226 Difference]: Without dead ends: 7558 [2025-03-16 20:21:35,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 20:21:35,930 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 13991 mSDsluCounter, 16439 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13991 SdHoareTripleChecker+Valid, 17927 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:35,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13991 Valid, 17927 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:21:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2025-03-16 20:21:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 5606. [2025-03-16 20:21:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5604 states have (on average 1.404710920770878) internal successors, (7872), 5605 states have internal predecessors, (7872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 7872 transitions. [2025-03-16 20:21:36,241 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 7872 transitions. Word has length 59 [2025-03-16 20:21:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 7872 transitions. [2025-03-16 20:21:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 33 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 7872 transitions. [2025-03-16 20:21:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 20:21:36,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:36,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:36,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:21:36,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:36,450 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:36,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash -466095018, now seen corresponding path program 1 times [2025-03-16 20:21:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653001337] [2025-03-16 20:21:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:36,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 20:21:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 20:21:36,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653001337] [2025-03-16 20:21:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653001337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:36,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194524761] [2025-03-16 20:21:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:21:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:36,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:21:36,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:21:36,527 INFO L87 Difference]: Start difference. First operand 5606 states and 7872 transitions. Second operand has 4 states, 4 states have (on average 19.75) 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-16 20:21:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:40,124 INFO L93 Difference]: Finished difference Result 9371 states and 14878 transitions. [2025-03-16 20:21:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:40,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) 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-16 20:21:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:40,130 INFO L225 Difference]: With dead ends: 9371 [2025-03-16 20:21:40,130 INFO L226 Difference]: Without dead ends: 7867 [2025-03-16 20:21:40,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:40,132 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2428 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:40,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2428 Valid, 265 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 20:21:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2025-03-16 20:21:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 7859. [2025-03-16 20:21:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7859 states, 7857 states have (on average 1.414789359806542) internal successors, (11116), 7858 states have internal predecessors, (11116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 11116 transitions. [2025-03-16 20:21:40,552 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 11116 transitions. Word has length 79 [2025-03-16 20:21:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 7859 states and 11116 transitions. [2025-03-16 20:21:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) 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-16 20:21:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 11116 transitions. [2025-03-16 20:21:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:21:40,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:40,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:21:40,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:21:40,554 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash 804692853, now seen corresponding path program 1 times [2025-03-16 20:21:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:40,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910801758] [2025-03-16 20:21:40,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:40,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:21:40,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:21:40,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:40,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910801758] [2025-03-16 20:21:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910801758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706685622] [2025-03-16 20:21:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:41,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:41,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:41,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:21:41,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:21:41,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:21:41,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:41,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:41,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:21:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:43,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706685622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:45,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 17] total 59 [2025-03-16 20:21:45,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064301893] [2025-03-16 20:21:45,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:45,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-16 20:21:45,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:45,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-16 20:21:45,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 20:21:45,194 INFO L87 Difference]: Start difference. First operand 7859 states and 11116 transitions. Second operand has 59 states, 59 states have (on average 4.3559322033898304) internal successors, (257), 59 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)