./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad2a2d7efc66be7018560448e0fdde06e9f20074a5c17d4202d9a0c4a0be5de --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:30:48,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:30:48,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:30:48,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:30:48,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:30:48,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:30:48,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:30:48,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:30:48,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:30:48,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:30:48,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:30:48,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:30:48,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:30:48,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:30:48,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:48,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:30:48,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:30:48,200 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 -> 2ad2a2d7efc66be7018560448e0fdde06e9f20074a5c17d4202d9a0c4a0be5de [2025-03-16 20:30:48,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:30:48,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:30:48,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:30:48,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:30:48,505 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:30:48,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:30:49,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54627b75/7f3386716783483c9b30ea85ffa65365/FLAG856bf69b7 [2025-03-16 20:30:50,085 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:30:50,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:30:50,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54627b75/7f3386716783483c9b30ea85ffa65365/FLAG856bf69b7 [2025-03-16 20:30:50,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54627b75/7f3386716783483c9b30ea85ffa65365 [2025-03-16 20:30:50,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:30:50,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:30:50,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:50,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:30:50,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:30:50,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:50" (1/1) ... [2025-03-16 20:30:50,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43df82bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:50, skipping insertion in model container [2025-03-16 20:30:50,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:50" (1/1) ... [2025-03-16 20:30:50,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:30:50,465 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[15547,15560] [2025-03-16 20:30:50,512 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[23295,23308] [2025-03-16 20:30:50,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:50,918 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:30:50,946 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[15547,15560] [2025-03-16 20:30:50,952 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.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c[23295,23308] [2025-03-16 20:30:51,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:51,200 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:30:51,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51 WrapperNode [2025-03-16 20:30:51,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:51,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:51,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:30:51,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:30:51,208 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:30:51" (1/1) ... [2025-03-16 20:30:51,244 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:30:51" (1/1) ... [2025-03-16 20:30:51,493 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-03-16 20:30:51,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:51,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:30:51,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:30:51,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:30:51,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,678 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:30:51,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:30:51,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:30:51,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:30:51,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:30:51,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (1/1) ... [2025-03-16 20:30:51,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:51,890 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:30:51,892 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:30:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:30:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:30:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:30:51,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:30:52,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:30:52,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:30:55,504 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc calculate_output2_#t~ret42#1; [2025-03-16 20:30:55,505 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5177: havoc calculate_output3_#t~ret43#1; [2025-03-16 20:30:55,505 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc calculate_output_#t~ret41#1; [2025-03-16 20:30:55,645 INFO L? ?]: Removed 745 outVars from TransFormulas that were not future-live. [2025-03-16 20:30:55,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:30:55,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:30:55,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:30:55,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:55 BoogieIcfgContainer [2025-03-16 20:30:55,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:30:55,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:30:55,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:30:55,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:30:55,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:30:50" (1/3) ... [2025-03-16 20:30:55,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:55, skipping insertion in model container [2025-03-16 20:30:55,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:51" (2/3) ... [2025-03-16 20:30:55,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:55, skipping insertion in model container [2025-03-16 20:30:55,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:55" (3/3) ... [2025-03-16 20:30:55,684 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:30:55,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:30:55,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 851 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:30:55,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:30:55,777 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;@22f47b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:30:55,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:30:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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:30:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:55,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:55,790 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] [2025-03-16 20:30:55,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 382305243, now seen corresponding path program 1 times [2025-03-16 20:30:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017472949] [2025-03-16 20:30:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:55,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:55,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:56,024 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:30:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017472949] [2025-03-16 20:30:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017472949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:30:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674383119] [2025-03-16 20:30:56,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:56,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:30:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:56,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:30:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:30:56,051 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:30:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:56,127 INFO L93 Difference]: Finished difference Result 1658 states and 3256 transitions. [2025-03-16 20:30:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:30:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:30:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:56,146 INFO L225 Difference]: With dead ends: 1658 [2025-03-16 20:30:56,146 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:56,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:30:56,153 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:56,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states 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:30:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2025-03-16 20:30:56,236 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2025-03-16 20:30:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:56,237 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2025-03-16 20:30:56,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:30:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2025-03-16 20:30:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:56,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:56,239 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] [2025-03-16 20:30:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:30:56,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:56,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -462166628, now seen corresponding path program 1 times [2025-03-16 20:30:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221209010] [2025-03-16 20:30:56,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:56,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:56,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:56,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:56,460 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:30:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221209010] [2025-03-16 20:30:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221209010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:30:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302663519] [2025-03-16 20:30:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:56,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:30:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:56,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:30:56,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:56,463 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:30:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:56,560 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2025-03-16 20:30:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:30:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:30:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:56,564 INFO L225 Difference]: With dead ends: 899 [2025-03-16 20:30:56,564 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:56,565 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:30:56,565 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:56,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4759 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states 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:30:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2025-03-16 20:30:56,585 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2025-03-16 20:30:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2025-03-16 20:30:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:30:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2025-03-16 20:30:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:30:56,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:56,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:56,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:30:56,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:56,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:56,588 INFO L85 PathProgramCache]: Analyzing trace with hash -858517098, now seen corresponding path program 1 times [2025-03-16 20:30:56,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:56,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739134376] [2025-03-16 20:30:56,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:56,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:30:56,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:30:56,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:56,837 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:30:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739134376] [2025-03-16 20:30:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739134376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141994025] [2025-03-16 20:30:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:56,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:56,839 INFO L87 Difference]: Start difference. First operand 847 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:57,132 INFO L93 Difference]: Finished difference Result 1435 states and 2510 transitions. [2025-03-16 20:30:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:30:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:30:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:57,137 INFO L225 Difference]: With dead ends: 1435 [2025-03-16 20:30:57,138 INFO L226 Difference]: Without dead ends: 1386 [2025-03-16 20:30:57,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:30:57,139 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 9770 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9770 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:57,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9770 Valid, 3315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-16 20:30:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 894. [2025-03-16 20:30:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.836322869955157) internal successors, (1638), 893 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:30:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1638 transitions. [2025-03-16 20:30:57,162 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1638 transitions. Word has length 62 [2025-03-16 20:30:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:57,162 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1638 transitions. [2025-03-16 20:30:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1638 transitions. [2025-03-16 20:30:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:57,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:57,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:57,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:30:57,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:57,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -364028136, now seen corresponding path program 1 times [2025-03-16 20:30:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:57,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343978263] [2025-03-16 20:30:57,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:57,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:57,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:57,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:57,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:57,473 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:30:57,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343978263] [2025-03-16 20:30:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343978263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:57,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113188926] [2025-03-16 20:30:57,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:57,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:57,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:57,475 INFO L87 Difference]: Start difference. First operand 894 states and 1638 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:57,697 INFO L93 Difference]: Finished difference Result 992 states and 1794 transitions. [2025-03-16 20:30:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:57,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:30:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:57,703 INFO L225 Difference]: With dead ends: 992 [2025-03-16 20:30:57,703 INFO L226 Difference]: Without dead ends: 896 [2025-03-16 20:30:57,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:30:57,704 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 6012 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6012 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:57,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6012 Valid, 1932 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-16 20:30:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894. [2025-03-16 20:30:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.8352017937219731) internal successors, (1637), 893 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states 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:30:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1637 transitions. [2025-03-16 20:30:57,737 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1637 transitions. Word has length 64 [2025-03-16 20:30:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1637 transitions. [2025-03-16 20:30:57,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1637 transitions. [2025-03-16 20:30:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:57,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:57,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:30:57,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:57,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -365070821, now seen corresponding path program 1 times [2025-03-16 20:30:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395988062] [2025-03-16 20:30:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:57,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:57,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:57,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:57,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:57,859 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:30:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395988062] [2025-03-16 20:30:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395988062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879192800] [2025-03-16 20:30:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:57,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:57,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:57,860 INFO L87 Difference]: Start difference. First operand 894 states and 1637 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:57,896 INFO L93 Difference]: Finished difference Result 1075 states and 1926 transitions. [2025-03-16 20:30:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:30:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:57,900 INFO L225 Difference]: With dead ends: 1075 [2025-03-16 20:30:57,900 INFO L226 Difference]: Without dead ends: 979 [2025-03-16 20:30:57,900 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:30:57,903 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:57,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1630 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-16 20:30:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 975. [2025-03-16 20:30:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 973 states have (on average 1.8129496402877698) internal successors, (1764), 974 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:30:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1764 transitions. [2025-03-16 20:30:57,929 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1764 transitions. Word has length 64 [2025-03-16 20:30:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1764 transitions. [2025-03-16 20:30:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1764 transitions. [2025-03-16 20:30:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:30:57,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:57,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:30:57,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:57,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1601014732, now seen corresponding path program 1 times [2025-03-16 20:30:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78482700] [2025-03-16 20:30:57,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:30:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:30:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78482700] [2025-03-16 20:30:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78482700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:30:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752218152] [2025-03-16 20:30:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:58,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:30:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:58,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:30:58,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:58,188 INFO L87 Difference]: Start difference. First operand 975 states and 1764 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:58,232 INFO L93 Difference]: Finished difference Result 981 states and 1771 transitions. [2025-03-16 20:30:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:30:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 20:30:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:58,236 INFO L225 Difference]: With dead ends: 981 [2025-03-16 20:30:58,236 INFO L226 Difference]: Without dead ends: 979 [2025-03-16 20:30:58,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:58,237 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 6221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7779 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:58,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7779 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-16 20:30:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-03-16 20:30:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 977 states have (on average 1.8085977482088025) internal successors, (1767), 978 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states 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:30:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1767 transitions. [2025-03-16 20:30:58,256 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1767 transitions. Word has length 65 [2025-03-16 20:30:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:58,256 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1767 transitions. [2025-03-16 20:30:58,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1767 transitions. [2025-03-16 20:30:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:58,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:58,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:30:58,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:58,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1773976674, now seen corresponding path program 1 times [2025-03-16 20:30:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885643646] [2025-03-16 20:30:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:58,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:58,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:58,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:58,383 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:30:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885643646] [2025-03-16 20:30:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885643646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807324428] [2025-03-16 20:30:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:58,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:30:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:30:58,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:58,385 INFO L87 Difference]: Start difference. First operand 979 states and 1767 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:02,926 INFO L93 Difference]: Finished difference Result 3234 states and 6076 transitions. [2025-03-16 20:31:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:31:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:02,939 INFO L225 Difference]: With dead ends: 3234 [2025-03-16 20:31:02,939 INFO L226 Difference]: Without dead ends: 2481 [2025-03-16 20:31:02,940 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:31:02,941 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2426 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2426 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:02,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2426 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 20:31:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-16 20:31:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2025-03-16 20:31:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2479 states have (on average 1.5655506252521179) internal successors, (3881), 2480 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states 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:31:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3881 transitions. [2025-03-16 20:31:02,984 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3881 transitions. Word has length 66 [2025-03-16 20:31:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3881 transitions. [2025-03-16 20:31:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3881 transitions. [2025-03-16 20:31:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:02,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:02,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:31:02,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1938748038, now seen corresponding path program 1 times [2025-03-16 20:31:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672877528] [2025-03-16 20:31:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,055 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:31:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672877528] [2025-03-16 20:31:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672877528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447647130] [2025-03-16 20:31:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,057 INFO L87 Difference]: Start difference. First operand 2481 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,082 INFO L93 Difference]: Finished difference Result 2827 states and 4421 transitions. [2025-03-16 20:31:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:03,089 INFO L225 Difference]: With dead ends: 2827 [2025-03-16 20:31:03,090 INFO L226 Difference]: Without dead ends: 2646 [2025-03-16 20:31:03,092 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:31:03,093 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1505 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1702 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:31:03,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-16 20:31:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2025-03-16 20:31:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 1.5639666919000756) internal successors, (4132), 2643 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states 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:31:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 4132 transitions. [2025-03-16 20:31:03,136 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 4132 transitions. Word has length 66 [2025-03-16 20:31:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 4132 transitions. [2025-03-16 20:31:03,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 4132 transitions. [2025-03-16 20:31:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:03,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:31:03,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1095389062, now seen corresponding path program 1 times [2025-03-16 20:31:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069695511] [2025-03-16 20:31:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:03,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:03,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,184 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:31:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069695511] [2025-03-16 20:31:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069695511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568994806] [2025-03-16 20:31:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,186 INFO L87 Difference]: Start difference. First operand 2644 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,211 INFO L93 Difference]: Finished difference Result 3300 states and 5146 transitions. [2025-03-16 20:31:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:03,220 INFO L225 Difference]: With dead ends: 3300 [2025-03-16 20:31:03,220 INFO L226 Difference]: Without dead ends: 2956 [2025-03-16 20:31:03,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,224 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:31:03,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-16 20:31:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2954. [2025-03-16 20:31:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2952 states have (on average 1.5589430894308942) internal successors, (4602), 2953 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states 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:31:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4602 transitions. [2025-03-16 20:31:03,272 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4602 transitions. Word has length 66 [2025-03-16 20:31:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,272 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4602 transitions. [2025-03-16 20:31:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4602 transitions. [2025-03-16 20:31:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:03,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:31:03,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -338348422, now seen corresponding path program 1 times [2025-03-16 20:31:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525673150] [2025-03-16 20:31:03,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:03,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:03,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,324 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:31:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525673150] [2025-03-16 20:31:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525673150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673714114] [2025-03-16 20:31:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,326 INFO L87 Difference]: Start difference. First operand 2954 states and 4602 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,354 INFO L93 Difference]: Finished difference Result 4198 states and 6500 transitions. [2025-03-16 20:31:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:03,363 INFO L225 Difference]: With dead ends: 4198 [2025-03-16 20:31:03,364 INFO L226 Difference]: Without dead ends: 3544 [2025-03-16 20:31:03,365 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:31:03,366 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 1499 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1700 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:31:03,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1700 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-16 20:31:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3542. [2025-03-16 20:31:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3540 states have (on average 1.547457627118644) internal successors, (5478), 3541 states have internal predecessors, (5478), 0 states have call successors, (0), 0 states 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:31:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5478 transitions. [2025-03-16 20:31:03,423 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5478 transitions. Word has length 66 [2025-03-16 20:31:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,423 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5478 transitions. [2025-03-16 20:31:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5478 transitions. [2025-03-16 20:31:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:03,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:31:03,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash -888137350, now seen corresponding path program 1 times [2025-03-16 20:31:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902899889] [2025-03-16 20:31:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:03,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:03,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,466 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:31:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902899889] [2025-03-16 20:31:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902899889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77587109] [2025-03-16 20:31:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,468 INFO L87 Difference]: Start difference. First operand 3542 states and 5478 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,505 INFO L93 Difference]: Finished difference Result 5898 states and 9016 transitions. [2025-03-16 20:31:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:03,518 INFO L225 Difference]: With dead ends: 5898 [2025-03-16 20:31:03,518 INFO L226 Difference]: Without dead ends: 4656 [2025-03-16 20:31:03,521 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:31:03,521 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1497 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1702 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:31:03,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2025-03-16 20:31:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2025-03-16 20:31:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.5266552020636286) internal successors, (7102), 4653 states have internal predecessors, (7102), 0 states have call successors, (0), 0 states 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:31:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 7102 transitions. [2025-03-16 20:31:03,595 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 7102 transitions. Word has length 66 [2025-03-16 20:31:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,595 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 7102 transitions. [2025-03-16 20:31:03,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 7102 transitions. [2025-03-16 20:31:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:03,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:31:03,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -272166022, now seen corresponding path program 1 times [2025-03-16 20:31:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845403122] [2025-03-16 20:31:03,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:03,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,639 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:31:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845403122] [2025-03-16 20:31:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845403122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168940971] [2025-03-16 20:31:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,640 INFO L87 Difference]: Start difference. First operand 4654 states and 7102 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,696 INFO L93 Difference]: Finished difference Result 9106 states and 13664 transitions. [2025-03-16 20:31:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:31:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:03,714 INFO L225 Difference]: With dead ends: 9106 [2025-03-16 20:31:03,714 INFO L226 Difference]: Without dead ends: 6752 [2025-03-16 20:31:03,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,719 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1501 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1706 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:31:03,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1706 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-03-16 20:31:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6750. [2025-03-16 20:31:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6750 states, 6748 states have (on average 1.495850622406639) internal successors, (10094), 6749 states have internal predecessors, (10094), 0 states have call successors, (0), 0 states 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:31:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6750 states to 6750 states and 10094 transitions. [2025-03-16 20:31:03,849 INFO L78 Accepts]: Start accepts. Automaton has 6750 states and 10094 transitions. Word has length 66 [2025-03-16 20:31:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 6750 states and 10094 transitions. [2025-03-16 20:31:03,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6750 states and 10094 transitions. [2025-03-16 20:31:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:31:03,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:31:03,851 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1055373978, now seen corresponding path program 1 times [2025-03-16 20:31:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636826087] [2025-03-16 20:31:03,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:31:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:31:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,893 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:31:03,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636826087] [2025-03-16 20:31:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636826087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447371758] [2025-03-16 20:31:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,895 INFO L87 Difference]: Start difference. First operand 6750 states and 10094 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:03,996 INFO L93 Difference]: Finished difference Result 11365 states and 16948 transitions. [2025-03-16 20:31:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:03,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:31:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:04,011 INFO L225 Difference]: With dead ends: 11365 [2025-03-16 20:31:04,011 INFO L226 Difference]: Without dead ends: 8866 [2025-03-16 20:31:04,016 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:31:04,016 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1504 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1703 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:31:04,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2025-03-16 20:31:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8864. [2025-03-16 20:31:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8864 states, 8862 states have (on average 1.4822839088241933) internal successors, (13136), 8863 states have internal predecessors, (13136), 0 states have call successors, (0), 0 states 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:31:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8864 states to 8864 states and 13136 transitions. [2025-03-16 20:31:04,163 INFO L78 Accepts]: Start accepts. Automaton has 8864 states and 13136 transitions. Word has length 68 [2025-03-16 20:31:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:04,163 INFO L471 AbstractCegarLoop]: Abstraction has 8864 states and 13136 transitions. [2025-03-16 20:31:04,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8864 states and 13136 transitions. [2025-03-16 20:31:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:04,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:04,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:04,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:31:04,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:04,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1763107670, now seen corresponding path program 1 times [2025-03-16 20:31:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675247685] [2025-03-16 20:31:04,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:04,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:04,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:04,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:04,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:31:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:04,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675247685] [2025-03-16 20:31:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675247685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:04,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:04,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099056380] [2025-03-16 20:31:04,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:04,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:04,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:04,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:04,306 INFO L87 Difference]: Start difference. First operand 8864 states and 13136 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:31:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:04,827 INFO L93 Difference]: Finished difference Result 49582 states and 72247 transitions. [2025-03-16 20:31:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:31:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:04,899 INFO L225 Difference]: With dead ends: 49582 [2025-03-16 20:31:04,899 INFO L226 Difference]: Without dead ends: 43020 [2025-03-16 20:31:04,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:04,915 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8100 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8100 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:04,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8100 Valid, 3919 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43020 states. [2025-03-16 20:31:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43020 to 15424. [2025-03-16 20:31:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 15422 states have (on average 1.4638827648813384) internal successors, (22576), 15423 states have internal predecessors, (22576), 0 states have call successors, (0), 0 states 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:31:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 22576 transitions. [2025-03-16 20:31:05,435 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 22576 transitions. Word has length 86 [2025-03-16 20:31:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:05,436 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 22576 transitions. [2025-03-16 20:31:05,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:31:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 22576 transitions. [2025-03-16 20:31:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:05,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:05,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:05,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:31:05,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -919748694, now seen corresponding path program 1 times [2025-03-16 20:31:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7585991] [2025-03-16 20:31:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:05,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:05,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:31:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7585991] [2025-03-16 20:31:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7585991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:05,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225193613] [2025-03-16 20:31:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:05,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:05,623 INFO L87 Difference]: Start difference. First operand 15424 states and 22576 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:06,401 INFO L93 Difference]: Finished difference Result 56142 states and 81687 transitions. [2025-03-16 20:31:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:31:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:06,474 INFO L225 Difference]: With dead ends: 56142 [2025-03-16 20:31:06,475 INFO L226 Difference]: Without dead ends: 49580 [2025-03-16 20:31:06,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:06,489 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8140 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8140 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:06,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8140 Valid, 3839 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49580 states. [2025-03-16 20:31:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49580 to 25280. [2025-03-16 20:31:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25280 states, 25278 states have (on average 1.4501147242661603) internal successors, (36656), 25279 states have internal predecessors, (36656), 0 states have call successors, (0), 0 states 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:31:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25280 states to 25280 states and 36656 transitions. [2025-03-16 20:31:07,147 INFO L78 Accepts]: Start accepts. Automaton has 25280 states and 36656 transitions. Word has length 86 [2025-03-16 20:31:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,147 INFO L471 AbstractCegarLoop]: Abstraction has 25280 states and 36656 transitions. [2025-03-16 20:31:07,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25280 states and 36656 transitions. [2025-03-16 20:31:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:07,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:31:07,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash -162708054, now seen corresponding path program 1 times [2025-03-16 20:31:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246742024] [2025-03-16 20:31:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:07,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:31:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246742024] [2025-03-16 20:31:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246742024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:07,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290134579] [2025-03-16 20:31:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:07,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:07,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:07,288 INFO L87 Difference]: Start difference. First operand 25280 states and 36656 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:08,067 INFO L93 Difference]: Finished difference Result 62702 states and 91127 transitions. [2025-03-16 20:31:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:31:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:08,145 INFO L225 Difference]: With dead ends: 62702 [2025-03-16 20:31:08,145 INFO L226 Difference]: Without dead ends: 56140 [2025-03-16 20:31:08,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:08,164 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8211 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8211 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:08,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8211 Valid, 3850 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56140 states. [2025-03-16 20:31:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56140 to 31840. [2025-03-16 20:31:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31840 states, 31838 states have (on average 1.4478296375400466) internal successors, (46096), 31839 states have internal predecessors, (46096), 0 states have call successors, (0), 0 states 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:31:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31840 states to 31840 states and 46096 transitions. [2025-03-16 20:31:09,151 INFO L78 Accepts]: Start accepts. Automaton has 31840 states and 46096 transitions. Word has length 86 [2025-03-16 20:31:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:09,152 INFO L471 AbstractCegarLoop]: Abstraction has 31840 states and 46096 transitions. [2025-03-16 20:31:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31840 states and 46096 transitions. [2025-03-16 20:31:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:09,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:09,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:09,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:31:09,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:09,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash -712496982, now seen corresponding path program 1 times [2025-03-16 20:31:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:09,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128119151] [2025-03-16 20:31:09,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:09,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:31:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128119151] [2025-03-16 20:31:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128119151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:09,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:09,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019643863] [2025-03-16 20:31:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:09,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:09,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:09,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:09,318 INFO L87 Difference]: Start difference. First operand 31840 states and 46096 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:10,545 INFO L93 Difference]: Finished difference Result 69262 states and 100567 transitions. [2025-03-16 20:31:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:10,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:31:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:10,623 INFO L225 Difference]: With dead ends: 69262 [2025-03-16 20:31:10,623 INFO L226 Difference]: Without dead ends: 62700 [2025-03-16 20:31:10,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:10,638 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8130 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8130 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:10,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8130 Valid, 3856 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62700 states. [2025-03-16 20:31:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62700 to 38400. [2025-03-16 20:31:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38400 states, 38398 states have (on average 1.446325329444242) internal successors, (55536), 38399 states have internal predecessors, (55536), 0 states have call successors, (0), 0 states 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:31:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38400 states to 38400 states and 55536 transitions. [2025-03-16 20:31:11,633 INFO L78 Accepts]: Start accepts. Automaton has 38400 states and 55536 transitions. Word has length 86 [2025-03-16 20:31:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:11,633 INFO L471 AbstractCegarLoop]: Abstraction has 38400 states and 55536 transitions. [2025-03-16 20:31:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 38400 states and 55536 transitions. [2025-03-16 20:31:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:11,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:11,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:11,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:31:11,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash -96525654, now seen corresponding path program 1 times [2025-03-16 20:31:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:11,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151937138] [2025-03-16 20:31:11,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:11,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:11,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:11,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:31:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151937138] [2025-03-16 20:31:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151937138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377090105] [2025-03-16 20:31:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:11,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:11,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:11,755 INFO L87 Difference]: Start difference. First operand 38400 states and 55536 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:31:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:12,772 INFO L93 Difference]: Finished difference Result 75822 states and 110007 transitions. [2025-03-16 20:31:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 86 [2025-03-16 20:31:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:12,847 INFO L225 Difference]: With dead ends: 75822 [2025-03-16 20:31:12,847 INFO L226 Difference]: Without dead ends: 69260 [2025-03-16 20:31:12,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:12,864 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8042 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8042 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:12,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8042 Valid, 3975 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69260 states. [2025-03-16 20:31:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69260 to 44960. [2025-03-16 20:31:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44958 states have (on average 1.4452600204635437) internal successors, (64976), 44959 states have internal predecessors, (64976), 0 states have call successors, (0), 0 states 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:31:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 64976 transitions. [2025-03-16 20:31:13,809 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 64976 transitions. Word has length 86 [2025-03-16 20:31:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:13,809 INFO L471 AbstractCegarLoop]: Abstraction has 44960 states and 64976 transitions. [2025-03-16 20:31:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:31:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 64976 transitions. [2025-03-16 20:31:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:31:13,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:13,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:31:13,901 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2092174036, now seen corresponding path program 1 times [2025-03-16 20:31:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:13,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811467421] [2025-03-16 20:31:13,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:31:13,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:31:13,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:13,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811467421] [2025-03-16 20:31:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811467421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585084249] [2025-03-16 20:31:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:13,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:13,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:13,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:13,991 INFO L87 Difference]: Start difference. First operand 44960 states and 64976 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:31:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:14,726 INFO L93 Difference]: Finished difference Result 74937 states and 108680 transitions. [2025-03-16 20:31:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 20:31:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:14,767 INFO L225 Difference]: With dead ends: 74937 [2025-03-16 20:31:14,767 INFO L226 Difference]: Without dead ends: 32279 [2025-03-16 20:31:14,801 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:31:14,802 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 58 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3157 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:31:14,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2025-03-16 20:31:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 32277. [2025-03-16 20:31:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32277 states, 32275 states have (on average 1.4526723470178156) internal successors, (46885), 32276 states have internal predecessors, (46885), 0 states have call successors, (0), 0 states 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:31:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32277 states to 32277 states and 46885 transitions. [2025-03-16 20:31:15,897 INFO L78 Accepts]: Start accepts. Automaton has 32277 states and 46885 transitions. Word has length 88 [2025-03-16 20:31:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 32277 states and 46885 transitions. [2025-03-16 20:31:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:31:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32277 states and 46885 transitions. [2025-03-16 20:31:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:31:15,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:15,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:15,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:31:15,899 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:15,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:15,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1952924214, now seen corresponding path program 1 times [2025-03-16 20:31:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:15,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932177173] [2025-03-16 20:31:15,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:15,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:31:15,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:31:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:31:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932177173] [2025-03-16 20:31:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932177173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091061444] [2025-03-16 20:31:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:16,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:16,015 INFO L87 Difference]: Start difference. First operand 32277 states and 46885 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,035 INFO L93 Difference]: Finished difference Result 59939 states and 87212 transitions. [2025-03-16 20:31:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:17,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 20:31:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,094 INFO L225 Difference]: With dead ends: 59939 [2025-03-16 20:31:17,094 INFO L226 Difference]: Without dead ends: 55329 [2025-03-16 20:31:17,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:17,106 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8104 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8104 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:17,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8104 Valid, 4088 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55329 states. [2025-03-16 20:31:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55329 to 36885. [2025-03-16 20:31:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 36883 states have (on average 1.4516443890139088) internal successors, (53541), 36884 states have internal predecessors, (53541), 0 states have call successors, (0), 0 states 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:31:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 53541 transitions. [2025-03-16 20:31:17,875 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 53541 transitions. Word has length 88 [2025-03-16 20:31:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 53541 transitions. [2025-03-16 20:31:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 53541 transitions. [2025-03-16 20:31:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:31:17,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:31:17,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1726696622, now seen corresponding path program 1 times [2025-03-16 20:31:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106373527] [2025-03-16 20:31:17,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:31:17,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:31:17,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106373527] [2025-03-16 20:31:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106373527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524971893] [2025-03-16 20:31:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,936 INFO L87 Difference]: Start difference. First operand 36885 states and 53541 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:18,277 INFO L93 Difference]: Finished difference Result 54169 states and 78503 transitions. [2025-03-16 20:31:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 20:31:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:18,304 INFO L225 Difference]: With dead ends: 54169 [2025-03-16 20:31:18,304 INFO L226 Difference]: Without dead ends: 19607 [2025-03-16 20:31:18,328 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:31:18,329 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 53 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3142 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:31:18,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2025-03-16 20:31:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19605. [2025-03-16 20:31:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19605 states, 19603 states have (on average 1.4457480997806458) internal successors, (28341), 19604 states have internal predecessors, (28341), 0 states have call successors, (0), 0 states 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:31:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 28341 transitions. [2025-03-16 20:31:18,854 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 28341 transitions. Word has length 89 [2025-03-16 20:31:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:18,854 INFO L471 AbstractCegarLoop]: Abstraction has 19605 states and 28341 transitions. [2025-03-16 20:31:18,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 28341 transitions. [2025-03-16 20:31:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:31:18,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:18,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:18,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:31:18,856 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1478915573, now seen corresponding path program 1 times [2025-03-16 20:31:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388483663] [2025-03-16 20:31:18,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:18,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:31:18,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:31:18,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:18,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:18,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388483663] [2025-03-16 20:31:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388483663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:18,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867922661] [2025-03-16 20:31:18,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:18,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:18,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:18,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:18,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:18,921 INFO L87 Difference]: Start difference. First operand 19605 states and 28341 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:19,076 INFO L93 Difference]: Finished difference Result 28249 states and 40703 transitions. [2025-03-16 20:31:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:19,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 20:31:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:19,092 INFO L225 Difference]: With dead ends: 28249 [2025-03-16 20:31:19,093 INFO L226 Difference]: Without dead ends: 10967 [2025-03-16 20:31:19,106 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:31:19,107 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3127 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:31:19,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10967 states. [2025-03-16 20:31:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10967 to 10965. [2025-03-16 20:31:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10963 states have (on average 1.4467755176502781) internal successors, (15861), 10964 states have internal predecessors, (15861), 0 states have call successors, (0), 0 states 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:31:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 15861 transitions. [2025-03-16 20:31:19,303 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 15861 transitions. Word has length 91 [2025-03-16 20:31:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:19,303 INFO L471 AbstractCegarLoop]: Abstraction has 10965 states and 15861 transitions. [2025-03-16 20:31:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 15861 transitions. [2025-03-16 20:31:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:31:19,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:19,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:19,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:31:19,305 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 551699396, now seen corresponding path program 1 times [2025-03-16 20:31:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618720846] [2025-03-16 20:31:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:19,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:31:19,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:31:19,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618720846] [2025-03-16 20:31:19,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618720846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:19,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:19,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196708908] [2025-03-16 20:31:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:19,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:19,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:19,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:19,416 INFO L87 Difference]: Start difference. First operand 10965 states and 15861 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:19,549 INFO L93 Difference]: Finished difference Result 15289 states and 21983 transitions. [2025-03-16 20:31:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:19,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 20:31:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:19,559 INFO L225 Difference]: With dead ends: 15289 [2025-03-16 20:31:19,559 INFO L226 Difference]: Without dead ends: 6647 [2025-03-16 20:31:19,564 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:31:19,565 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 47 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3112 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:31:19,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3112 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2025-03-16 20:31:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6645. [2025-03-16 20:31:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6643 states have (on average 1.4573234984193888) internal successors, (9681), 6644 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states 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:31:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9681 transitions. [2025-03-16 20:31:19,738 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9681 transitions. Word has length 93 [2025-03-16 20:31:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:19,738 INFO L471 AbstractCegarLoop]: Abstraction has 6645 states and 9681 transitions. [2025-03-16 20:31:19,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9681 transitions. [2025-03-16 20:31:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:31:19,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:19,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:31:19,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2030858365, now seen corresponding path program 1 times [2025-03-16 20:31:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311750403] [2025-03-16 20:31:19,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:31:19,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:31:19,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:19,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311750403] [2025-03-16 20:31:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311750403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742826338] [2025-03-16 20:31:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:19,818 INFO L87 Difference]: Start difference. First operand 6645 states and 9681 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:19,895 INFO L93 Difference]: Finished difference Result 8809 states and 12713 transitions. [2025-03-16 20:31:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 20:31:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:19,902 INFO L225 Difference]: With dead ends: 8809 [2025-03-16 20:31:19,902 INFO L226 Difference]: Without dead ends: 4487 [2025-03-16 20:31:19,905 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:31:19,906 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 44 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3097 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:31:19,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3097 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2025-03-16 20:31:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2025-03-16 20:31:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4483 states have (on average 1.4769127816194512) internal successors, (6621), 4484 states have internal predecessors, (6621), 0 states have call successors, (0), 0 states 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:31:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6621 transitions. [2025-03-16 20:31:20,003 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6621 transitions. Word has length 95 [2025-03-16 20:31:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:20,003 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6621 transitions. [2025-03-16 20:31:20,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6621 transitions. [2025-03-16 20:31:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:31:20,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:20,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:20,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:31:20,005 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 308650038, now seen corresponding path program 1 times [2025-03-16 20:31:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712085951] [2025-03-16 20:31:20,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:20,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:31:20,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:31:20,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:20,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712085951] [2025-03-16 20:31:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712085951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:20,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725582446] [2025-03-16 20:31:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:20,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:20,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:20,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:20,081 INFO L87 Difference]: Start difference. First operand 4485 states and 6621 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:20,130 INFO L93 Difference]: Finished difference Result 5569 states and 8123 transitions. [2025-03-16 20:31:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 20:31:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:20,135 INFO L225 Difference]: With dead ends: 5569 [2025-03-16 20:31:20,135 INFO L226 Difference]: Without dead ends: 3407 [2025-03-16 20:31:20,136 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:31:20,136 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 41 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3082 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:31:20,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3082 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-03-16 20:31:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3405. [2025-03-16 20:31:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3403 states have (on average 1.5004407875404056) internal successors, (5106), 3404 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states 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:31:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5106 transitions. [2025-03-16 20:31:20,196 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5106 transitions. Word has length 97 [2025-03-16 20:31:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:20,196 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 5106 transitions. [2025-03-16 20:31:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5106 transitions. [2025-03-16 20:31:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 20:31:20,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:20,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:20,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:31:20,202 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:20,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 892035823, now seen corresponding path program 1 times [2025-03-16 20:31:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541353497] [2025-03-16 20:31:20,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:20,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:20,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:20,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:20,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541353497] [2025-03-16 20:31:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541353497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874442927] [2025-03-16 20:31:21,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:21,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:21,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:21,024 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:31:21,026 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:31:21,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:21,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:21,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:31:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:21,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874442927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:21,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:31:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076075133] [2025-03-16 20:31:21,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:21,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:31:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:21,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:31:21,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:31:21,857 INFO L87 Difference]: Start difference. First operand 3405 states and 5106 transitions. Second operand has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:31:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:25,952 INFO L93 Difference]: Finished difference Result 13399 states and 18602 transitions. [2025-03-16 20:31:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:31:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 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 99 [2025-03-16 20:31:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:25,964 INFO L225 Difference]: With dead ends: 13399 [2025-03-16 20:31:25,964 INFO L226 Difference]: Without dead ends: 12219 [2025-03-16 20:31:25,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:31:25,969 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 13809 mSDsluCounter, 8318 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13809 SdHoareTripleChecker+Valid, 9869 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:25,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13809 Valid, 9869 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 20:31:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12219 states. [2025-03-16 20:31:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12219 to 11549. [2025-03-16 20:31:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11549 states, 11547 states have (on average 1.3783666753269248) internal successors, (15916), 11548 states have internal predecessors, (15916), 0 states have call successors, (0), 0 states 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:31:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11549 states to 11549 states and 15916 transitions. [2025-03-16 20:31:26,222 INFO L78 Accepts]: Start accepts. Automaton has 11549 states and 15916 transitions. Word has length 99 [2025-03-16 20:31:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:26,222 INFO L471 AbstractCegarLoop]: Abstraction has 11549 states and 15916 transitions. [2025-03-16 20:31:26,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:31:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11549 states and 15916 transitions. [2025-03-16 20:31:26,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:26,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:26,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:26,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:31:26,423 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,SelfDestructingSolverStorable25 [2025-03-16 20:31:26,424 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1400023222, now seen corresponding path program 1 times [2025-03-16 20:31:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578496597] [2025-03-16 20:31:26,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:26,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:26,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:26,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578496597] [2025-03-16 20:31:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578496597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220971623] [2025-03-16 20:31:26,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:26,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:26,742 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:31:26,744 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:31:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:26,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:26,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:26,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:31:26,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:27,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220971623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:28,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-16 20:31:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397270940] [2025-03-16 20:31:28,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:28,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 20:31:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 20:31:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-16 20:31:28,062 INFO L87 Difference]: Start difference. First operand 11549 states and 15916 transitions. Second operand has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:31:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:29,332 INFO L93 Difference]: Finished difference Result 24623 states and 33327 transitions. [2025-03-16 20:31:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:31:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:31:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:29,350 INFO L225 Difference]: With dead ends: 24623 [2025-03-16 20:31:29,350 INFO L226 Difference]: Without dead ends: 15585 [2025-03-16 20:31:29,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 20:31:29,355 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 20330 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20330 SdHoareTripleChecker+Valid, 6578 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:29,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20330 Valid, 6578 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:31:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15585 states. [2025-03-16 20:31:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15585 to 14215. [2025-03-16 20:31:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14215 states, 14213 states have (on average 1.3483430662069935) internal successors, (19164), 14214 states have internal predecessors, (19164), 0 states have call successors, (0), 0 states 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:31:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14215 states to 14215 states and 19164 transitions. [2025-03-16 20:31:29,674 INFO L78 Accepts]: Start accepts. Automaton has 14215 states and 19164 transitions. Word has length 100 [2025-03-16 20:31:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:29,674 INFO L471 AbstractCegarLoop]: Abstraction has 14215 states and 19164 transitions. [2025-03-16 20:31:29,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:31:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 14215 states and 19164 transitions. [2025-03-16 20:31:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:29,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:29,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:29,712 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:31:29,876 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,SelfDestructingSolverStorable26 [2025-03-16 20:31:29,876 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:29,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1450460490, now seen corresponding path program 1 times [2025-03-16 20:31:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:29,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474787052] [2025-03-16 20:31:29,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:29,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:29,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:29,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:29,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474787052] [2025-03-16 20:31:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474787052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050501014] [2025-03-16 20:31:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:30,104 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:31:30,105 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:31:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:30,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:30,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:30,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:31:30,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:30,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050501014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:31,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:31:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090117251] [2025-03-16 20:31:31,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:31:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:31:31,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:31:31,007 INFO L87 Difference]: Start difference. First operand 14215 states and 19164 transitions. Second operand has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:32,798 INFO L93 Difference]: Finished difference Result 42273 states and 55862 transitions. [2025-03-16 20:31:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 20:31:32,799 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:31:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:32,828 INFO L225 Difference]: With dead ends: 42273 [2025-03-16 20:31:32,828 INFO L226 Difference]: Without dead ends: 30391 [2025-03-16 20:31:32,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2247, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:31:32,837 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 20425 mSDsluCounter, 7082 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20425 SdHoareTripleChecker+Valid, 8658 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:32,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20425 Valid, 8658 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:31:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30391 states. [2025-03-16 20:31:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30391 to 30251. [2025-03-16 20:31:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30251 states, 30249 states have (on average 1.315745975073556) internal successors, (39800), 30250 states have internal predecessors, (39800), 0 states have call successors, (0), 0 states 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:31:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30251 states to 30251 states and 39800 transitions. [2025-03-16 20:31:33,789 INFO L78 Accepts]: Start accepts. Automaton has 30251 states and 39800 transitions. Word has length 100 [2025-03-16 20:31:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:33,789 INFO L471 AbstractCegarLoop]: Abstraction has 30251 states and 39800 transitions. [2025-03-16 20:31:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30251 states and 39800 transitions. [2025-03-16 20:31:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:31:33,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:33,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:33,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:31:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:33,991 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:33,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1441796728, now seen corresponding path program 1 times [2025-03-16 20:31:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068868779] [2025-03-16 20:31:33,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:33,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:34,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:34,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:34,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068868779] [2025-03-16 20:31:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068868779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621044636] [2025-03-16 20:31:34,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:34,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:34,265 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:31:34,267 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:31:34,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:34,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:34,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:34,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:34,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:31:34,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:34,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621044636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:35,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-03-16 20:31:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737679947] [2025-03-16 20:31:35,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:35,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:31:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:35,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:31:35,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:31:35,687 INFO L87 Difference]: Start difference. First operand 30251 states and 39800 transitions. Second operand has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:31:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:39,872 INFO L93 Difference]: Finished difference Result 114709 states and 149561 transitions. [2025-03-16 20:31:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 20:31:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 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 102 [2025-03-16 20:31:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:39,963 INFO L225 Difference]: With dead ends: 114709 [2025-03-16 20:31:39,964 INFO L226 Difference]: Without dead ends: 86847 [2025-03-16 20:31:39,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=739, Invalid=3043, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:31:39,981 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 16201 mSDsluCounter, 6824 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16201 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:39,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16201 Valid, 8350 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:31:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86847 states. [2025-03-16 20:31:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86847 to 86527. [2025-03-16 20:31:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86527 states, 86525 states have (on average 1.2855359722623518) internal successors, (111231), 86526 states have internal predecessors, (111231), 0 states have call successors, (0), 0 states 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:31:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86527 states to 86527 states and 111231 transitions. [2025-03-16 20:31:43,479 INFO L78 Accepts]: Start accepts. Automaton has 86527 states and 111231 transitions. Word has length 102 [2025-03-16 20:31:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:43,479 INFO L471 AbstractCegarLoop]: Abstraction has 86527 states and 111231 transitions. [2025-03-16 20:31:43,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:31:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86527 states and 111231 transitions. [2025-03-16 20:31:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:43,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:43,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:43,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:31:43,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:31:43,684 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:43,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2050371838, now seen corresponding path program 1 times [2025-03-16 20:31:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759728272] [2025-03-16 20:31:43,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:43,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:43,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:43,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759728272] [2025-03-16 20:31:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759728272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421871140] [2025-03-16 20:31:44,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:44,330 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:31:44,332 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:31:44,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:44,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:31:44,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:45,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421871140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:45,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-16 20:31:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347987783] [2025-03-16 20:31:45,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:31:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:45,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:31:45,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:31:45,831 INFO L87 Difference]: Start difference. First operand 86527 states and 111231 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:31:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:51,824 INFO L93 Difference]: Finished difference Result 200228 states and 256976 transitions. [2025-03-16 20:31:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 20:31:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 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 104 [2025-03-16 20:31:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:52,051 INFO L225 Difference]: With dead ends: 200228 [2025-03-16 20:31:52,051 INFO L226 Difference]: Without dead ends: 179885 [2025-03-16 20:31:52,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:31:52,088 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 16592 mSDsluCounter, 12391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16592 SdHoareTripleChecker+Valid, 13940 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:52,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16592 Valid, 13940 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:31:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179885 states. [2025-03-16 20:31:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179885 to 86821. [2025-03-16 20:31:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86821 states, 86819 states have (on average 1.2851449567490987) internal successors, (111575), 86820 states have internal predecessors, (111575), 0 states have call successors, (0), 0 states 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:31:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86821 states to 86821 states and 111575 transitions. [2025-03-16 20:31:55,564 INFO L78 Accepts]: Start accepts. Automaton has 86821 states and 111575 transitions. Word has length 104 [2025-03-16 20:31:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:55,564 INFO L471 AbstractCegarLoop]: Abstraction has 86821 states and 111575 transitions. [2025-03-16 20:31:55,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:31:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 86821 states and 111575 transitions. [2025-03-16 20:31:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:55,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:55,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:55,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:31:55,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:55,766 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1005936834, now seen corresponding path program 1 times [2025-03-16 20:31:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603421698] [2025-03-16 20:31:55,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:55,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:55,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:55,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603421698] [2025-03-16 20:31:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603421698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375135353] [2025-03-16 20:31:56,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:56,258 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:31:56,260 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:31:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:56,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:56,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:56,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-16 20:31:56,395 INFO L279 TraceCheckSpWp]: Computing forward predicates...