./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6_overflow.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 1f09cf4061335b08cd7ee9f93500cd77e7903e9c969f65687bcdb447c560ab48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:14:33,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:14:33,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:14:33,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:14:33,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:14:33,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:14:33,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:14:33,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:14:33,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:14:33,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:14:33,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:14:33,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:14:33,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:14:33,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:14:33,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:14:33,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:14:33,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:14:33,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:14:33,680 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 -> 1f09cf4061335b08cd7ee9f93500cd77e7903e9c969f65687bcdb447c560ab48 [2025-03-03 16:14:33,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:14:33,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:14:33,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:14:33,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:14:33,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:14:33,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:14:35,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a9821f0/43c9d8940f2245c4bb8f2ea01dc8c72d/FLAG60cae5296 [2025-03-03 16:14:35,558 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:14:35,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:14:35,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a9821f0/43c9d8940f2245c4bb8f2ea01dc8c72d/FLAG60cae5296 [2025-03-03 16:14:35,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a9821f0/43c9d8940f2245c4bb8f2ea01dc8c72d [2025-03-03 16:14:35,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:14:35,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:14:35,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:14:35,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:14:35,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:14:35,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:14:35" (1/1) ... [2025-03-03 16:14:35,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5ba7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:35, skipping insertion in model container [2025-03-03 16:14:35,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:14:35" (1/1) ... [2025-03-03 16:14:35,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:14:35,949 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[15584,15597] [2025-03-03 16:14:36,002 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[23332,23345] [2025-03-03 16:14:36,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:14:36,391 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:14:36,412 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[15584,15597] [2025-03-03 16:14:36,420 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[23332,23345] [2025-03-03 16:14:36,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:14:36,686 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:14:36,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36 WrapperNode [2025-03-03 16:14:36,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:14:36,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:14:36,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:14:36,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:14:36,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:36,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:36,993 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2025-03-03 16:14:36,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:14:36,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:14:36,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:14:36,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:14:37,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:14:37,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:14:37,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:14:37,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:14:37,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:14:37,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (1/1) ... [2025-03-03 16:14:37,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:14:37,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:37,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:14:37,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:14:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:14:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:14:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:14:37,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:14:37,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:14:37,512 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:14:40,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3684: havoc calculate_output2_#t~ret42#1; [2025-03-03 16:14:40,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5174: havoc calculate_output3_#t~ret43#1; [2025-03-03 16:14:40,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2205: havoc calculate_output_#t~ret41#1; [2025-03-03 16:14:41,088 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-03 16:14:41,089 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:14:41,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:14:41,122 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:14:41,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:14:41 BoogieIcfgContainer [2025-03-03 16:14:41,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:14:41,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:14:41,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:14:41,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:14:41,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:14:35" (1/3) ... [2025-03-03 16:14:41,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166ef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:14:41, skipping insertion in model container [2025-03-03 16:14:41,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:14:36" (2/3) ... [2025-03-03 16:14:41,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166ef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:14:41, skipping insertion in model container [2025-03-03 16:14:41,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:14:41" (3/3) ... [2025-03-03 16:14:41,133 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:14:41,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:14:41,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:14:41,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:14:41,228 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;@349d39d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:14:41,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:14:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:14:41,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:41,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, 1, 1, 1] [2025-03-03 16:14:41,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1801860080, now seen corresponding path program 1 times [2025-03-03 16:14:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466676359] [2025-03-03 16:14:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:41,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:14:41,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:14:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:41,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466676359] [2025-03-03 16:14:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466676359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:41,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:41,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:14:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550867535] [2025-03-03 16:14:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:14:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:41,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:14:41,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:14:41,462 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:41,550 INFO L93 Difference]: Finished difference Result 1779 states and 3375 transitions. [2025-03-03 16:14:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:14:41,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:14:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:41,570 INFO L225 Difference]: With dead ends: 1779 [2025-03-03 16:14:41,570 INFO L226 Difference]: Without dead ends: 848 [2025-03-03 16:14:41,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:14:41,575 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:41,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-03 16:14:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-03-03 16:14:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.8936170212765957) internal successors, (1602), 847 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-03 16:14:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1602 transitions. [2025-03-03 16:14:41,630 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1602 transitions. Word has length 26 [2025-03-03 16:14:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:41,630 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1602 transitions. [2025-03-03 16:14:41,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1602 transitions. [2025-03-03 16:14:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:14:41,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:41,631 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] [2025-03-03 16:14:41,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:14:41,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1393035855, now seen corresponding path program 1 times [2025-03-03 16:14:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531984749] [2025-03-03 16:14:41,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:41,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:14:41,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:14:41,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:41,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531984749] [2025-03-03 16:14:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531984749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:41,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:14:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020000313] [2025-03-03 16:14:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:41,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:14:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:41,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:14:41,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:14:41,848 INFO L87 Difference]: Start difference. First operand 848 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:41,942 INFO L93 Difference]: Finished difference Result 900 states and 1683 transitions. [2025-03-03 16:14:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:14:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:14:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:41,946 INFO L225 Difference]: With dead ends: 900 [2025-03-03 16:14:41,946 INFO L226 Difference]: Without dead ends: 848 [2025-03-03 16:14:41,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:14:41,947 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:41,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-03 16:14:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-03-03 16:14:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.846335697399527) internal successors, (1562), 847 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-03 16:14:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1562 transitions. [2025-03-03 16:14:41,965 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1562 transitions. Word has length 26 [2025-03-03 16:14:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:41,965 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1562 transitions. [2025-03-03 16:14:41,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1562 transitions. [2025-03-03 16:14:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:14:41,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:41,967 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-03 16:14:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:14:41,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:41,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 720868248, now seen corresponding path program 1 times [2025-03-03 16:14:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796949987] [2025-03-03 16:14:41,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:41,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:14:41,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:14:41,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:41,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796949987] [2025-03-03 16:14:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796949987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:42,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540353396] [2025-03-03 16:14:42,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:42,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:42,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:42,164 INFO L87 Difference]: Start difference. First operand 848 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 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-03 16:14:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:42,450 INFO L93 Difference]: Finished difference Result 1424 states and 2486 transitions. [2025-03-03 16:14:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:14:42,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 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-03 16:14:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:42,460 INFO L225 Difference]: With dead ends: 1424 [2025-03-03 16:14:42,460 INFO L226 Difference]: Without dead ends: 1376 [2025-03-03 16:14:42,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:14:42,463 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9635 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9635 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:42,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9635 Valid, 3990 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-03 16:14:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 894. [2025-03-03 16:14:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.8340807174887892) internal successors, (1636), 893 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1636 transitions. [2025-03-03 16:14:42,488 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1636 transitions. Word has length 65 [2025-03-03 16:14:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:42,489 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1636 transitions. [2025-03-03 16:14:42,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 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-03 16:14:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1636 transitions. [2025-03-03 16:14:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:14:42,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:42,493 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] [2025-03-03 16:14:42,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:14:42,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:42,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1909962381, now seen corresponding path program 1 times [2025-03-03 16:14:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598889471] [2025-03-03 16:14:42,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:42,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:14:42,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:14:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598889471] [2025-03-03 16:14:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598889471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855784990] [2025-03-03 16:14:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:42,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:42,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:42,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:42,608 INFO L87 Difference]: Start difference. First operand 894 states and 1636 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:42,639 INFO L93 Difference]: Finished difference Result 1071 states and 1919 transitions. [2025-03-03 16:14:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:14:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:42,643 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 16:14:42,644 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 16:14:42,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:42,647 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:42,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 16:14:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-03-03 16:14:42,673 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-03 16:14:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1764 transitions. [2025-03-03 16:14:42,676 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1764 transitions. Word has length 67 [2025-03-03 16:14:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:42,678 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1764 transitions. [2025-03-03 16:14:42,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1764 transitions. [2025-03-03 16:14:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:14:42,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:42,680 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] [2025-03-03 16:14:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:14:42,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1877639146, now seen corresponding path program 1 times [2025-03-03 16:14:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014047672] [2025-03-03 16:14:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:42,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:14:42,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:14:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014047672] [2025-03-03 16:14:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014047672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937556518] [2025-03-03 16:14:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:42,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:42,989 INFO L87 Difference]: Start difference. First operand 975 states and 1764 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:43,184 INFO L93 Difference]: Finished difference Result 1152 states and 2044 transitions. [2025-03-03 16:14:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:14:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:43,188 INFO L225 Difference]: With dead ends: 1152 [2025-03-03 16:14:43,188 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 16:14:43,189 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-03 16:14:43,189 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 8992 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8992 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:43,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8992 Valid, 1922 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 16:14:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 975. [2025-03-03 16:14:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 973 states have (on average 1.8108941418293936) internal successors, (1762), 974 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1762 transitions. [2025-03-03 16:14:43,206 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1762 transitions. Word has length 67 [2025-03-03 16:14:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:43,207 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1762 transitions. [2025-03-03 16:14:43,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1762 transitions. [2025-03-03 16:14:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:14:43,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:43,208 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] [2025-03-03 16:14:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:14:43,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:43,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 71177356, now seen corresponding path program 1 times [2025-03-03 16:14:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980908769] [2025-03-03 16:14:43,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:43,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:14:43,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:14:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980908769] [2025-03-03 16:14:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980908769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069452514] [2025-03-03 16:14:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:14:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:43,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:14:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:14:43,354 INFO L87 Difference]: Start difference. First operand 975 states and 1762 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:47,937 INFO L93 Difference]: Finished difference Result 3230 states and 6071 transitions. [2025-03-03 16:14:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:14:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:14:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:47,945 INFO L225 Difference]: With dead ends: 3230 [2025-03-03 16:14:47,945 INFO L226 Difference]: Without dead ends: 2477 [2025-03-03 16:14:47,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:14:47,946 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2425 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2425 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:47,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2425 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 16:14:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-03 16:14:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2025-03-03 16:14:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.5660606060606062) internal successors, (3876), 2476 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3876 transitions. [2025-03-03 16:14:47,981 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3876 transitions. Word has length 67 [2025-03-03 16:14:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3876 transitions. [2025-03-03 16:14:47,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3876 transitions. [2025-03-03 16:14:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:14:47,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:47,983 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-03 16:14:47,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:14:47,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1953266352, now seen corresponding path program 1 times [2025-03-03 16:14:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151706808] [2025-03-03 16:14:47,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:47,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:14:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:14:48,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151706808] [2025-03-03 16:14:48,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151706808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122777747] [2025-03-03 16:14:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:48,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:48,202 INFO L87 Difference]: Start difference. First operand 2477 states and 3876 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,250 INFO L93 Difference]: Finished difference Result 2485 states and 3885 transitions. [2025-03-03 16:14:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:48,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 16:14:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,257 INFO L225 Difference]: With dead ends: 2485 [2025-03-03 16:14:48,258 INFO L226 Difference]: Without dead ends: 2483 [2025-03-03 16:14:48,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:48,259 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 0 mSDsluCounter, 9323 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10879 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:48,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10879 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-03-03 16:14:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2025-03-03 16:14:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5642885933091495) internal successors, (3881), 2482 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-03 16:14:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3881 transitions. [2025-03-03 16:14:48,300 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3881 transitions. Word has length 68 [2025-03-03 16:14:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:48,300 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3881 transitions. [2025-03-03 16:14:48,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3881 transitions. [2025-03-03 16:14:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:48,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:48,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:14:48,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash -38470604, now seen corresponding path program 1 times [2025-03-03 16:14:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481481288] [2025-03-03 16:14:48,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:48,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:48,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:48,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481481288] [2025-03-03 16:14:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481481288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868328965] [2025-03-03 16:14:48,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:48,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,357 INFO L87 Difference]: Start difference. First operand 2483 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,376 INFO L93 Difference]: Finished difference Result 2677 states and 4182 transitions. [2025-03-03 16:14:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,383 INFO L225 Difference]: With dead ends: 2677 [2025-03-03 16:14:48,384 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 16:14:48,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,385 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 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-03 16:14:48,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 16:14:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2575. [2025-03-03 16:14:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2573 states have (on average 1.5631558492032647) internal successors, (4022), 2574 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4022 transitions. [2025-03-03 16:14:48,424 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4022 transitions. Word has length 69 [2025-03-03 16:14:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:48,426 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 4022 transitions. [2025-03-03 16:14:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4022 transitions. [2025-03-03 16:14:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:48,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:48,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:48,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:14:48,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash -192839436, now seen corresponding path program 1 times [2025-03-03 16:14:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:48,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773494993] [2025-03-03 16:14:48,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773494993] [2025-03-03 16:14:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773494993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790161473] [2025-03-03 16:14:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:48,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,473 INFO L87 Difference]: Start difference. First operand 2575 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,499 INFO L93 Difference]: Finished difference Result 3093 states and 4822 transitions. [2025-03-03 16:14:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,506 INFO L225 Difference]: With dead ends: 3093 [2025-03-03 16:14:48,506 INFO L226 Difference]: Without dead ends: 2822 [2025-03-03 16:14:48,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,508 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:48,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2025-03-03 16:14:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2820. [2025-03-03 16:14:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2818 states have (on average 1.5592618878637332) internal successors, (4394), 2819 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4394 transitions. [2025-03-03 16:14:48,551 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4394 transitions. Word has length 69 [2025-03-03 16:14:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4394 transitions. [2025-03-03 16:14:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4394 transitions. [2025-03-03 16:14:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:48,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:48,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:48,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:14:48,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1171769932, now seen corresponding path program 1 times [2025-03-03 16:14:48,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:48,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807722325] [2025-03-03 16:14:48,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:48,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:48,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807722325] [2025-03-03 16:14:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807722325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194121240] [2025-03-03 16:14:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:48,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,592 INFO L87 Difference]: Start difference. First operand 2820 states and 4394 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,618 INFO L93 Difference]: Finished difference Result 3804 states and 5896 transitions. [2025-03-03 16:14:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,627 INFO L225 Difference]: With dead ends: 3804 [2025-03-03 16:14:48,627 INFO L226 Difference]: Without dead ends: 3288 [2025-03-03 16:14:48,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,628 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:48,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-03-03 16:14:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3286. [2025-03-03 16:14:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 3284 states have (on average 1.5499390986601704) internal successors, (5090), 3285 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 5090 transitions. [2025-03-03 16:14:48,683 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 5090 transitions. Word has length 69 [2025-03-03 16:14:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:48,683 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 5090 transitions. [2025-03-03 16:14:48,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 5090 transitions. [2025-03-03 16:14:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:48,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:48,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:48,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:14:48,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1619715468, now seen corresponding path program 1 times [2025-03-03 16:14:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592692385] [2025-03-03 16:14:48,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:48,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:48,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:48,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592692385] [2025-03-03 16:14:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592692385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263046857] [2025-03-03 16:14:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:48,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,727 INFO L87 Difference]: Start difference. First operand 3286 states and 5090 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,758 INFO L93 Difference]: Finished difference Result 5154 states and 7900 transitions. [2025-03-03 16:14:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,769 INFO L225 Difference]: With dead ends: 5154 [2025-03-03 16:14:48,769 INFO L226 Difference]: Without dead ends: 4172 [2025-03-03 16:14:48,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,771 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:48,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-03-03 16:14:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4170. [2025-03-03 16:14:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4168 states have (on average 1.5321497120921306) internal successors, (6386), 4169 states have internal predecessors, (6386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6386 transitions. [2025-03-03 16:14:48,892 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6386 transitions. Word has length 69 [2025-03-03 16:14:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 4170 states and 6386 transitions. [2025-03-03 16:14:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6386 transitions. [2025-03-03 16:14:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:48,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:48,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:14:48,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1204539596, now seen corresponding path program 1 times [2025-03-03 16:14:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454578834] [2025-03-03 16:14:48,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:48,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:48,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:48,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454578834] [2025-03-03 16:14:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454578834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:48,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:48,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62199180] [2025-03-03 16:14:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:48,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:48,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:48,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,932 INFO L87 Difference]: Start difference. First operand 4170 states and 6386 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:48,977 INFO L93 Difference]: Finished difference Result 7710 states and 11620 transitions. [2025-03-03 16:14:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:48,988 INFO L225 Difference]: With dead ends: 7710 [2025-03-03 16:14:48,989 INFO L226 Difference]: Without dead ends: 5844 [2025-03-03 16:14:48,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:48,993 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:48,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2025-03-03 16:14:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5842. [2025-03-03 16:14:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5842 states, 5840 states have (on average 1.5044520547945206) internal successors, (8786), 5841 states have internal predecessors, (8786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 8786 transitions. [2025-03-03 16:14:49,094 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 8786 transitions. Word has length 69 [2025-03-03 16:14:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:49,095 INFO L471 AbstractCegarLoop]: Abstraction has 5842 states and 8786 transitions. [2025-03-03 16:14:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 8786 transitions. [2025-03-03 16:14:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:14:49,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:49,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:49,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:14:49,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1691257868, now seen corresponding path program 1 times [2025-03-03 16:14:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008272636] [2025-03-03 16:14:49,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:49,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:14:49,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:14:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:49,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008272636] [2025-03-03 16:14:49,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008272636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:49,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:49,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749100776] [2025-03-03 16:14:49,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:49,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:49,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:49,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:49,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:49,133 INFO L87 Difference]: Start difference. First operand 5842 states and 8786 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:49,204 INFO L93 Difference]: Finished difference Result 12534 states and 18484 transitions. [2025-03-03 16:14:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:49,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:14:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:49,220 INFO L225 Difference]: With dead ends: 12534 [2025-03-03 16:14:49,220 INFO L226 Difference]: Without dead ends: 8996 [2025-03-03 16:14:49,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:49,227 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:49,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1716 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2025-03-03 16:14:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8994. [2025-03-03 16:14:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8994 states, 8992 states have (on average 1.468193950177936) internal successors, (13202), 8993 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8994 states to 8994 states and 13202 transitions. [2025-03-03 16:14:49,384 INFO L78 Accepts]: Start accepts. Automaton has 8994 states and 13202 transitions. Word has length 69 [2025-03-03 16:14:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 8994 states and 13202 transitions. [2025-03-03 16:14:49,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 8994 states and 13202 transitions. [2025-03-03 16:14:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:49,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:49,388 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, 1] [2025-03-03 16:14:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:14:49,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 704030, now seen corresponding path program 1 times [2025-03-03 16:14:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197549858] [2025-03-03 16:14:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:49,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:49,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:14:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197549858] [2025-03-03 16:14:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197549858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133971246] [2025-03-03 16:14:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:49,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:49,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:49,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:49,517 INFO L87 Difference]: Start difference. First operand 8994 states and 13202 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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-03 16:14:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:50,129 INFO L93 Difference]: Finished difference Result 48592 states and 69977 transitions. [2025-03-03 16:14:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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 90 [2025-03-03 16:14:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:50,205 INFO L225 Difference]: With dead ends: 48592 [2025-03-03 16:14:50,206 INFO L226 Difference]: Without dead ends: 43854 [2025-03-03 16:14:50,225 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-03 16:14:50,226 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8020 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8020 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:50,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8020 Valid, 4180 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43854 states. [2025-03-03 16:14:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43854 to 14722. [2025-03-03 16:14:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14722 states, 14720 states have (on average 1.4490489130434783) internal successors, (21330), 14721 states have internal predecessors, (21330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 21330 transitions. [2025-03-03 16:14:50,691 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 21330 transitions. Word has length 90 [2025-03-03 16:14:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:50,692 INFO L471 AbstractCegarLoop]: Abstraction has 14722 states and 21330 transitions. [2025-03-03 16:14:50,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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-03 16:14:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 21330 transitions. [2025-03-03 16:14:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:50,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:50,696 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, 1] [2025-03-03 16:14:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:14:50,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:50,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash -153664802, now seen corresponding path program 1 times [2025-03-03 16:14:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783576692] [2025-03-03 16:14:50,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:50,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:50,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:50,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:14:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783576692] [2025-03-03 16:14:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783576692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881407369] [2025-03-03 16:14:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:50,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:50,833 INFO L87 Difference]: Start difference. First operand 14722 states and 21330 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-03 16:14:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:51,467 INFO L93 Difference]: Finished difference Result 55280 states and 79513 transitions. [2025-03-03 16:14:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:51,467 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 90 [2025-03-03 16:14:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:51,537 INFO L225 Difference]: With dead ends: 55280 [2025-03-03 16:14:51,537 INFO L226 Difference]: Without dead ends: 48590 [2025-03-03 16:14:51,555 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-03 16:14:51,556 INFO L435 NwaCegarLoop]: 1637 mSDtfsCounter, 8024 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8024 SdHoareTripleChecker+Valid, 4116 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-03 16:14:51,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8024 Valid, 4116 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48590 states. [2025-03-03 16:14:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48590 to 23778. [2025-03-03 16:14:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23778 states, 23776 states have (on average 1.4368270524899058) internal successors, (34162), 23777 states have internal predecessors, (34162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23778 states to 23778 states and 34162 transitions. [2025-03-03 16:14:52,130 INFO L78 Accepts]: Start accepts. Automaton has 23778 states and 34162 transitions. Word has length 90 [2025-03-03 16:14:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 23778 states and 34162 transitions. [2025-03-03 16:14:52,131 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-03 16:14:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23778 states and 34162 transitions. [2025-03-03 16:14:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:52,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:52,134 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, 1] [2025-03-03 16:14:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:14:52,134 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1132595298, now seen corresponding path program 1 times [2025-03-03 16:14:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14089273] [2025-03-03 16:14:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:52,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:52,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:14:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:52,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14089273] [2025-03-03 16:14:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14089273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14404313] [2025-03-03 16:14:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:52,277 INFO L87 Difference]: Start difference. First operand 23778 states and 34162 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:53,486 INFO L93 Difference]: Finished difference Result 61968 states and 89017 transitions. [2025-03-03 16:14:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:14:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:53,563 INFO L225 Difference]: With dead ends: 61968 [2025-03-03 16:14:53,563 INFO L226 Difference]: Without dead ends: 55278 [2025-03-03 16:14:53,585 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-03 16:14:53,586 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8044 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8044 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:53,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8044 Valid, 4090 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55278 states. [2025-03-03 16:14:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55278 to 30466. [2025-03-03 16:14:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30466 states, 30464 states have (on average 1.4333639705882353) internal successors, (43666), 30465 states have internal predecessors, (43666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30466 states to 30466 states and 43666 transitions. [2025-03-03 16:14:54,354 INFO L78 Accepts]: Start accepts. Automaton has 30466 states and 43666 transitions. Word has length 90 [2025-03-03 16:14:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:54,355 INFO L471 AbstractCegarLoop]: Abstraction has 30466 states and 43666 transitions. [2025-03-03 16:14:54,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30466 states and 43666 transitions. [2025-03-03 16:14:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:54,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:54,359 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, 1] [2025-03-03 16:14:54,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:14:54,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1580540834, now seen corresponding path program 1 times [2025-03-03 16:14:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500131158] [2025-03-03 16:14:54,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:54,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:54,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:14:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500131158] [2025-03-03 16:14:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500131158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168731474] [2025-03-03 16:14:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:54,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:54,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:54,493 INFO L87 Difference]: Start difference. First operand 30466 states and 43666 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-03 16:14:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:55,390 INFO L93 Difference]: Finished difference Result 68656 states and 98521 transitions. [2025-03-03 16:14:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:55,390 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 90 [2025-03-03 16:14:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:55,459 INFO L225 Difference]: With dead ends: 68656 [2025-03-03 16:14:55,459 INFO L226 Difference]: Without dead ends: 61966 [2025-03-03 16:14:55,480 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-03 16:14:55,481 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8082 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8082 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:55,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8082 Valid, 4055 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61966 states. [2025-03-03 16:14:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61966 to 37154. [2025-03-03 16:14:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37154 states, 37152 states have (on average 1.4311477174849268) internal successors, (53170), 37153 states have internal predecessors, (53170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37154 states to 37154 states and 53170 transitions. [2025-03-03 16:14:56,390 INFO L78 Accepts]: Start accepts. Automaton has 37154 states and 53170 transitions. Word has length 90 [2025-03-03 16:14:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:56,390 INFO L471 AbstractCegarLoop]: Abstraction has 37154 states and 53170 transitions. [2025-03-03 16:14:56,391 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-03 16:14:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37154 states and 53170 transitions. [2025-03-03 16:14:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:56,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:56,394 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, 1] [2025-03-03 16:14:56,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:14:56,395 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1165364962, now seen corresponding path program 1 times [2025-03-03 16:14:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422467056] [2025-03-03 16:14:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:56,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:56,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:56,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:56,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:14:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422467056] [2025-03-03 16:14:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422467056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807009509] [2025-03-03 16:14:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:56,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:56,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:56,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:56,519 INFO L87 Difference]: Start difference. First operand 37154 states and 53170 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-03 16:14:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:57,935 INFO L93 Difference]: Finished difference Result 75344 states and 108025 transitions. [2025-03-03 16:14:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:57,935 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 90 [2025-03-03 16:14:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:58,014 INFO L225 Difference]: With dead ends: 75344 [2025-03-03 16:14:58,014 INFO L226 Difference]: Without dead ends: 68654 [2025-03-03 16:14:58,035 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-03 16:14:58,035 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8129 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8129 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:58,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8129 Valid, 4063 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68654 states. [2025-03-03 16:14:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68654 to 43842. [2025-03-03 16:14:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43842 states, 43840 states have (on average 1.4296076642335767) internal successors, (62674), 43841 states have internal predecessors, (62674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:14:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43842 states to 43842 states and 62674 transitions. [2025-03-03 16:14:59,391 INFO L78 Accepts]: Start accepts. Automaton has 43842 states and 62674 transitions. Word has length 90 [2025-03-03 16:14:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:59,392 INFO L471 AbstractCegarLoop]: Abstraction has 43842 states and 62674 transitions. [2025-03-03 16:14:59,392 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-03 16:14:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43842 states and 62674 transitions. [2025-03-03 16:14:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:14:59,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:59,395 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, 1] [2025-03-03 16:14:59,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:14:59,396 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:59,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1652083234, now seen corresponding path program 1 times [2025-03-03 16:14:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602982545] [2025-03-03 16:14:59,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:14:59,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:14:59,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:59,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:14:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602982545] [2025-03-03 16:14:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602982545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731745464] [2025-03-03 16:14:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:59,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:59,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:59,505 INFO L87 Difference]: Start difference. First operand 43842 states and 62674 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-03 16:15:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:00,827 INFO L93 Difference]: Finished difference Result 82032 states and 117529 transitions. [2025-03-03 16:15:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:15:00,827 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 90 [2025-03-03 16:15:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:00,911 INFO L225 Difference]: With dead ends: 82032 [2025-03-03 16:15:00,911 INFO L226 Difference]: Without dead ends: 75342 [2025-03-03 16:15:00,931 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-03 16:15:00,932 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8048 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8048 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:00,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8048 Valid, 4128 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:15:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75342 states. [2025-03-03 16:15:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75342 to 50530. [2025-03-03 16:15:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.428475300823306) internal successors, (72178), 50529 states have internal predecessors, (72178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 72178 transitions. [2025-03-03 16:15:02,265 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 72178 transitions. Word has length 90 [2025-03-03 16:15:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:02,266 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 72178 transitions. [2025-03-03 16:15:02,266 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-03 16:15:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 72178 transitions. [2025-03-03 16:15:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 16:15:02,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:02,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:15:02,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:15:02,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:02,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 112504176, now seen corresponding path program 1 times [2025-03-03 16:15:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43675776] [2025-03-03 16:15:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:02,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 16:15:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 16:15:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43675776] [2025-03-03 16:15:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43675776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212291463] [2025-03-03 16:15:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:02,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:02,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:02,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:02,368 INFO L87 Difference]: Start difference. First operand 50530 states and 72178 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-03 16:15:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:03,445 INFO L93 Difference]: Finished difference Result 98758 states and 140756 transitions. [2025-03-03 16:15:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:03,446 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-03 16:15:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:03,505 INFO L225 Difference]: With dead ends: 98758 [2025-03-03 16:15:03,506 INFO L226 Difference]: Without dead ends: 50532 [2025-03-03 16:15:03,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:03,534 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:03,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50532 states. [2025-03-03 16:15:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50532 to 50530. [2025-03-03 16:15:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.414859088030399) internal successors, (71490), 50529 states have internal predecessors, (71490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 71490 transitions. [2025-03-03 16:15:04,984 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 71490 transitions. Word has length 91 [2025-03-03 16:15:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:04,984 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 71490 transitions. [2025-03-03 16:15:04,984 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-03 16:15:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 71490 transitions. [2025-03-03 16:15:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:15:04,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:04,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:15:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:15:04,987 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash -490310180, now seen corresponding path program 1 times [2025-03-03 16:15:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275949521] [2025-03-03 16:15:04,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:04,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:15:05,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:15:05,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:05,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275949521] [2025-03-03 16:15:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275949521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750575319] [2025-03-03 16:15:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:05,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:05,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:05,055 INFO L87 Difference]: Start difference. First operand 50530 states and 71490 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:05,381 INFO L93 Difference]: Finished difference Result 68315 states and 96714 transitions. [2025-03-03 16:15:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 16:15:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:05,405 INFO L225 Difference]: With dead ends: 68315 [2025-03-03 16:15:05,405 INFO L226 Difference]: Without dead ends: 20089 [2025-03-03 16:15:05,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:05,436 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:05,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20089 states. [2025-03-03 16:15:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20089 to 20081. [2025-03-03 16:15:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20081 states, 20079 states have (on average 1.423228248418746) internal successors, (28577), 20080 states have internal predecessors, (28577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 28577 transitions. [2025-03-03 16:15:05,813 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 28577 transitions. Word has length 92 [2025-03-03 16:15:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 20081 states and 28577 transitions. [2025-03-03 16:15:05,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 28577 transitions. [2025-03-03 16:15:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:15:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:05,814 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, 1, 1, 1, 1] [2025-03-03 16:15:05,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:15:05,815 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:05,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash -818182665, now seen corresponding path program 1 times [2025-03-03 16:15:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:05,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218126100] [2025-03-03 16:15:05,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:05,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:15:05,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:15:05,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:05,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:05,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:05,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218126100] [2025-03-03 16:15:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218126100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:05,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768050104] [2025-03-03 16:15:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:05,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:05,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:05,869 INFO L87 Difference]: Start difference. First operand 20081 states and 28577 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-03 16:15:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:06,063 INFO L93 Difference]: Finished difference Result 28965 states and 41059 transitions. [2025-03-03 16:15:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:06,063 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-03 16:15:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:06,075 INFO L225 Difference]: With dead ends: 28965 [2025-03-03 16:15:06,075 INFO L226 Difference]: Without dead ends: 11203 [2025-03-03 16:15:06,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:06,088 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:06,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2025-03-03 16:15:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 11201. [2025-03-03 16:15:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11199 states have (on average 1.426645236181802) internal successors, (15977), 11200 states have internal predecessors, (15977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 15977 transitions. [2025-03-03 16:15:06,379 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 15977 transitions. Word has length 93 [2025-03-03 16:15:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:06,379 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 15977 transitions. [2025-03-03 16:15:06,379 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-03 16:15:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 15977 transitions. [2025-03-03 16:15:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:15:06,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:06,381 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, 1, 1, 1, 1] [2025-03-03 16:15:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:15:06,381 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:06,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash -85389410, now seen corresponding path program 1 times [2025-03-03 16:15:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423791749] [2025-03-03 16:15:06,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:06,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:15:06,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:15:06,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:06,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423791749] [2025-03-03 16:15:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423791749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808277676] [2025-03-03 16:15:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:06,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:06,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:06,456 INFO L87 Difference]: Start difference. First operand 11201 states and 15977 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-03 16:15:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:06,587 INFO L93 Difference]: Finished difference Result 15645 states and 22159 transitions. [2025-03-03 16:15:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:06,588 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-03 16:15:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:06,596 INFO L225 Difference]: With dead ends: 15645 [2025-03-03 16:15:06,596 INFO L226 Difference]: Without dead ends: 6763 [2025-03-03 16:15:06,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:06,602 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:06,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-03 16:15:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-03-03 16:15:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6759 states have (on average 1.4405977215564432) internal successors, (9737), 6760 states have internal predecessors, (9737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9737 transitions. [2025-03-03 16:15:06,760 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9737 transitions. Word has length 95 [2025-03-03 16:15:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:06,760 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9737 transitions. [2025-03-03 16:15:06,760 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-03 16:15:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9737 transitions. [2025-03-03 16:15:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:15:06,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:06,761 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, 1, 1, 1, 1] [2025-03-03 16:15:06,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:15:06,762 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:06,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1915372955, now seen corresponding path program 1 times [2025-03-03 16:15:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490798998] [2025-03-03 16:15:06,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:06,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:15:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:15:06,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:06,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490798998] [2025-03-03 16:15:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490798998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067385462] [2025-03-03 16:15:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:06,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:06,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:06,835 INFO L87 Difference]: Start difference. First operand 6761 states and 9737 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-03 16:15:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:06,911 INFO L93 Difference]: Finished difference Result 8985 states and 12799 transitions. [2025-03-03 16:15:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:06,911 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-03 16:15:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:06,918 INFO L225 Difference]: With dead ends: 8985 [2025-03-03 16:15:06,918 INFO L226 Difference]: Without dead ends: 4543 [2025-03-03 16:15:06,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:06,921 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-03-03 16:15:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4541. [2025-03-03 16:15:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 4539 states have (on average 1.4644194756554307) internal successors, (6647), 4540 states have internal predecessors, (6647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 6647 transitions. [2025-03-03 16:15:07,018 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 6647 transitions. Word has length 97 [2025-03-03 16:15:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 4541 states and 6647 transitions. [2025-03-03 16:15:07,018 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-03 16:15:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 6647 transitions. [2025-03-03 16:15:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:15:07,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:07,019 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, 1, 1, 1, 1] [2025-03-03 16:15:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:15:07,019 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1704200628, now seen corresponding path program 1 times [2025-03-03 16:15:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201272325] [2025-03-03 16:15:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:15:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:15:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201272325] [2025-03-03 16:15:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201272325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:15:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:15:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:15:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442506467] [2025-03-03 16:15:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:15:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:15:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:15:07,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:07,109 INFO L87 Difference]: Start difference. First operand 4541 states and 6647 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:07,158 INFO L93 Difference]: Finished difference Result 5655 states and 8164 transitions. [2025-03-03 16:15:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:15:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-03 16:15:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:07,164 INFO L225 Difference]: With dead ends: 5655 [2025-03-03 16:15:07,164 INFO L226 Difference]: Without dead ends: 3433 [2025-03-03 16:15:07,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:15:07,166 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:07,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:15:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-03-03 16:15:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3431. [2025-03-03 16:15:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 3429 states have (on average 1.4922717993584136) internal successors, (5117), 3430 states have internal predecessors, (5117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5117 transitions. [2025-03-03 16:15:07,230 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5117 transitions. Word has length 99 [2025-03-03 16:15:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:07,230 INFO L471 AbstractCegarLoop]: Abstraction has 3431 states and 5117 transitions. [2025-03-03 16:15:07,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5117 transitions. [2025-03-03 16:15:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:15:07,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:07,231 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, 1, 1, 1, 1] [2025-03-03 16:15:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:15:07,231 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:07,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash -932695213, now seen corresponding path program 1 times [2025-03-03 16:15:07,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:07,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409046282] [2025-03-03 16:15:07,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:07,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:15:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:15:07,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409046282] [2025-03-03 16:15:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409046282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728676276] [2025-03-03 16:15:07,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:07,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:15:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:15:08,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:15:08,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:15:08,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:08,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:08,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:15:08,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:15:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:08,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:15:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728676276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:15:08,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:15:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:15:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542931278] [2025-03-03 16:15:08,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:15:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:15:08,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:08,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:15:08,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:15:08,695 INFO L87 Difference]: Start difference. First operand 3431 states and 5117 transitions. Second operand has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:12,083 INFO L93 Difference]: Finished difference Result 12912 states and 17636 transitions. [2025-03-03 16:15:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-03 16:15:12,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 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 101 [2025-03-03 16:15:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:12,095 INFO L225 Difference]: With dead ends: 12912 [2025-03-03 16:15:12,096 INFO L226 Difference]: Without dead ends: 11702 [2025-03-03 16:15:12,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1292, Invalid=7080, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 16:15:12,101 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 19050 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19050 SdHoareTripleChecker+Valid, 11300 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:12,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19050 Valid, 11300 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:15:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11702 states. [2025-03-03 16:15:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11702 to 10846. [2025-03-03 16:15:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10846 states, 10844 states have (on average 1.3613980081150867) internal successors, (14763), 10845 states have internal predecessors, (14763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 14763 transitions. [2025-03-03 16:15:12,305 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 14763 transitions. Word has length 101 [2025-03-03 16:15:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:12,305 INFO L471 AbstractCegarLoop]: Abstraction has 10846 states and 14763 transitions. [2025-03-03 16:15:12,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 14763 transitions. [2025-03-03 16:15:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 16:15:12,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:12,306 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, 1, 1, 1] [2025-03-03 16:15:12,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:15:12,506 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-03 16:15:12,507 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1284037986, now seen corresponding path program 1 times [2025-03-03 16:15:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292089857] [2025-03-03 16:15:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:12,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:15:12,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:15:12,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:12,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292089857] [2025-03-03 16:15:12,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292089857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:12,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106503365] [2025-03-03 16:15:12,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:12,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:15:12,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:15:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:15:12,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:15:12,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:12,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:12,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:15:12,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:15:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:13,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:15:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106503365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:15:15,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:15:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2025-03-03 16:15:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319605483] [2025-03-03 16:15:15,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:15:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 16:15:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:15,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 16:15:15,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:15:15,042 INFO L87 Difference]: Start difference. First operand 10846 states and 14763 transitions. Second operand has 33 states, 33 states have (on average 8.484848484848484) internal successors, (280), 33 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:18,896 INFO L93 Difference]: Finished difference Result 36050 states and 47774 transitions. [2025-03-03 16:15:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-03 16:15:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.484848484848484) internal successors, (280), 33 states have internal predecessors, (280), 0 states have call successors, (0), 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-03 16:15:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:18,926 INFO L225 Difference]: With dead ends: 36050 [2025-03-03 16:15:18,926 INFO L226 Difference]: Without dead ends: 27628 [2025-03-03 16:15:18,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1873, Invalid=8027, Unknown=0, NotChecked=0, Total=9900 [2025-03-03 16:15:18,939 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 21160 mSDsluCounter, 12771 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21160 SdHoareTripleChecker+Valid, 14280 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:18,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21160 Valid, 14280 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:15:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27628 states. [2025-03-03 16:15:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27628 to 26090. [2025-03-03 16:15:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26090 states, 26088 states have (on average 1.3128641521005826) internal successors, (34250), 26089 states have internal predecessors, (34250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26090 states to 26090 states and 34250 transitions. [2025-03-03 16:15:19,738 INFO L78 Accepts]: Start accepts. Automaton has 26090 states and 34250 transitions. Word has length 102 [2025-03-03 16:15:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:19,742 INFO L471 AbstractCegarLoop]: Abstraction has 26090 states and 34250 transitions. [2025-03-03 16:15:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.484848484848484) internal successors, (280), 33 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26090 states and 34250 transitions. [2025-03-03 16:15:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 16:15:19,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:19,743 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, 1, 1, 1] [2025-03-03 16:15:19,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:15:19,943 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-03 16:15:19,944 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1826586462, now seen corresponding path program 1 times [2025-03-03 16:15:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805191944] [2025-03-03 16:15:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:19,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:15:19,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:15:19,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:19,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805191944] [2025-03-03 16:15:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805191944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770587743] [2025-03-03 16:15:20,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:20,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:20,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:15:20,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:15:20,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:15:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:15:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:15:20,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:15:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:20,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:15:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770587743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:15:21,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:15:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:15:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698946563] [2025-03-03 16:15:21,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:15:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:15:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:15:21,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:15:21,196 INFO L87 Difference]: Start difference. First operand 26090 states and 34250 transitions. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:24,622 INFO L93 Difference]: Finished difference Result 123694 states and 160643 transitions. [2025-03-03 16:15:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 16:15:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 0 states have call successors, (0), 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-03 16:15:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:24,745 INFO L225 Difference]: With dead ends: 123694 [2025-03-03 16:15:24,745 INFO L226 Difference]: Without dead ends: 99976 [2025-03-03 16:15:24,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=600, Invalid=2262, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 16:15:24,770 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 18795 mSDsluCounter, 5562 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18795 SdHoareTripleChecker+Valid, 7116 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:24,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18795 Valid, 7116 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:15:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99976 states. [2025-03-03 16:15:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99976 to 98884. [2025-03-03 16:15:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98884 states, 98882 states have (on average 1.2771181812665602) internal successors, (126284), 98883 states have internal predecessors, (126284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98884 states to 98884 states and 126284 transitions. [2025-03-03 16:15:27,975 INFO L78 Accepts]: Start accepts. Automaton has 98884 states and 126284 transitions. Word has length 102 [2025-03-03 16:15:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 98884 states and 126284 transitions. [2025-03-03 16:15:27,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 98884 states and 126284 transitions. [2025-03-03 16:15:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:15:27,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:27,978 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, 1, 1, 1, 1, 1] [2025-03-03 16:15:27,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:15:28,179 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-03 16:15:28,179 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:28,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:28,179 INFO L85 PathProgramCache]: Analyzing trace with hash -433011101, now seen corresponding path program 1 times [2025-03-03 16:15:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702250261] [2025-03-03 16:15:28,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:28,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:15:28,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:15:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702250261] [2025-03-03 16:15:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702250261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281587208] [2025-03-03 16:15:28,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:28,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:15:28,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:15:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:15:28,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:15:28,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:28,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:15:28,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:15:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:29,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:15:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281587208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:15:29,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:15:29,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-03-03 16:15:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58837963] [2025-03-03 16:15:29,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:15:29,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 16:15:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:29,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 16:15:29,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:15:29,929 INFO L87 Difference]: Start difference. First operand 98884 states and 126284 transitions. Second operand has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:15:35,537 INFO L93 Difference]: Finished difference Result 298458 states and 381359 transitions. [2025-03-03 16:15:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 16:15:35,538 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 0 states have call successors, (0), 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-03 16:15:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:15:35,827 INFO L225 Difference]: With dead ends: 298458 [2025-03-03 16:15:35,828 INFO L226 Difference]: Without dead ends: 202176 [2025-03-03 16:15:35,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 16:15:35,883 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 13965 mSDsluCounter, 6604 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13965 SdHoareTripleChecker+Valid, 8147 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:15:35,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13965 Valid, 8147 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:15:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202176 states. [2025-03-03 16:15:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202176 to 199852. [2025-03-03 16:15:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199852 states, 199850 states have (on average 1.2612659494620966) internal successors, (252064), 199851 states have internal predecessors, (252064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199852 states to 199852 states and 252064 transitions. [2025-03-03 16:15:42,766 INFO L78 Accepts]: Start accepts. Automaton has 199852 states and 252064 transitions. Word has length 104 [2025-03-03 16:15:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:15:42,766 INFO L471 AbstractCegarLoop]: Abstraction has 199852 states and 252064 transitions. [2025-03-03 16:15:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.133333333333333) internal successors, (274), 30 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:15:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 199852 states and 252064 transitions. [2025-03-03 16:15:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:15:42,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:15:42,770 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, 1, 1, 1, 1, 1, 1] [2025-03-03 16:15:42,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:15:42,971 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-03 16:15:42,971 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:15:42,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:15:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -908124249, now seen corresponding path program 1 times [2025-03-03 16:15:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:15:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896126677] [2025-03-03 16:15:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:15:42,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:15:42,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:15:42,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:42,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:15:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896126677] [2025-03-03 16:15:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896126677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:15:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044648616] [2025-03-03 16:15:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:15:43,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:15:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:15:43,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:15:43,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:15:43,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:15:43,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:15:43,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:15:43,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:15:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:15:43,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:15:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:43,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:15:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:15:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044648616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:15:44,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:15:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:15:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131327534] [2025-03-03 16:15:44,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:15:44,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:15:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:15:44,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:15:44,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:15:44,504 INFO L87 Difference]: Start difference. First operand 199852 states and 252064 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 20 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)