./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb4732ffcc8aec7b756fbc1474109f3a44e8146c5a6c10619dc86e06d247c798 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:23:20,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:23:20,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:23:20,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:23:20,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:23:21,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:23:21,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:23:21,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:23:21,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:23:21,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:23:21,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:23:21,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:23:21,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:23:21,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:23:21,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:23:21,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:23:21,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:21,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:23:21,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:23:21,018 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 -> eb4732ffcc8aec7b756fbc1474109f3a44e8146c5a6c10619dc86e06d247c798 [2025-03-16 20:23:21,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:23:21,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:23:21,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:23:21,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:23:21,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:23:21,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:23:22,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32939b33/232e899855024090b306e4aebbf7c459/FLAG28a9a32fb [2025-03-16 20:23:22,800 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:23:22,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:23:22,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32939b33/232e899855024090b306e4aebbf7c459/FLAG28a9a32fb [2025-03-16 20:23:22,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32939b33/232e899855024090b306e4aebbf7c459 [2025-03-16 20:23:22,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:23:22,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:23:22,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:22,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:23:22,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:23:22,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:22" (1/1) ... [2025-03-16 20:23:22,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:22, skipping insertion in model container [2025-03-16 20:23:22,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:22" (1/1) ... [2025-03-16 20:23:22,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:23:23,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c[8749,8762] [2025-03-16 20:23:23,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15810,15823] [2025-03-16 20:23:23,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:23,580 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:23:23,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c[8749,8762] [2025-03-16 20:23:23,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15810,15823] [2025-03-16 20:23:23,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:23,863 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:23:23,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23 WrapperNode [2025-03-16 20:23:23,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:23,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:23,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:23:23,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:23:23,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:23,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,148 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5034 [2025-03-16 20:23:24,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:24,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:23:24,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:23:24,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:23:24,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:23:24,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:23:24,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:23:24,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:23:24,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:23:24,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (1/1) ... [2025-03-16 20:23:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:24,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:23:24,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:23:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:23:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:23:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:23:24,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:23:24,654 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:23:24,656 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:23:27,933 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3537: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:23:27,934 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5027: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:23:27,934 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc calculate_output_#t~ret33#1; [2025-03-16 20:23:28,079 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:23:28,079 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:23:28,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:23:28,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:23:28,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:28 BoogieIcfgContainer [2025-03-16 20:23:28,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:23:28,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:23:28,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:23:28,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:23:28,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:23:22" (1/3) ... [2025-03-16 20:23:28,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fe4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:28, skipping insertion in model container [2025-03-16 20:23:28,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:23" (2/3) ... [2025-03-16 20:23:28,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fe4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:28, skipping insertion in model container [2025-03-16 20:23:28,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:28" (3/3) ... [2025-03-16 20:23:28,110 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:23:28,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:23:28,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:23:28,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:23:28,190 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;@4cfe0df6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:23:28,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:23:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:28,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:28,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:28,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 640465911, now seen corresponding path program 1 times [2025-03-16 20:23:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489779114] [2025-03-16 20:23:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:28,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:28,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:28,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:28,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489779114] [2025-03-16 20:23:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489779114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:28,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:23:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860174268] [2025-03-16 20:23:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:23:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:28,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:23:28,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:23:28,411 INFO L87 Difference]: Start difference. First operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:28,478 INFO L93 Difference]: Finished difference Result 1617 states and 3182 transitions. [2025-03-16 20:23:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:23:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:23:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:28,495 INFO L225 Difference]: With dead ends: 1617 [2025-03-16 20:23:28,495 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:23:28,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:23:28,500 INFO L435 NwaCegarLoop]: 1552 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, 1552 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:28,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:23:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:23:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8970588235294117) internal successors, (1548), 817 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1548 transitions. [2025-03-16 20:23:28,554 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1548 transitions. Word has length 19 [2025-03-16 20:23:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1548 transitions. [2025-03-16 20:23:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1548 transitions. [2025-03-16 20:23:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:28,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:28,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:28,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:23:28,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2146949576, now seen corresponding path program 1 times [2025-03-16 20:23:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143293955] [2025-03-16 20:23:28,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:28,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:28,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:28,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143293955] [2025-03-16 20:23:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143293955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047212890] [2025-03-16 20:23:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:28,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:28,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:28,750 INFO L87 Difference]: Start difference. First operand 818 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:28,801 INFO L93 Difference]: Finished difference Result 858 states and 1610 transitions. [2025-03-16 20:23:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:28,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:23:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:28,805 INFO L225 Difference]: With dead ends: 858 [2025-03-16 20:23:28,805 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:23:28,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:28,806 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 0 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:28,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:23:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:23:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8688725490196079) internal successors, (1525), 817 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1525 transitions. [2025-03-16 20:23:28,833 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1525 transitions. Word has length 19 [2025-03-16 20:23:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:28,833 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1525 transitions. [2025-03-16 20:23:28,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1525 transitions. [2025-03-16 20:23:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:23:28,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:28,834 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] [2025-03-16 20:23:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:23:28,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1633251230, now seen corresponding path program 1 times [2025-03-16 20:23:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014061049] [2025-03-16 20:23:28,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:28,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:23:28,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:23:28,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014061049] [2025-03-16 20:23:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014061049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:28,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938905934] [2025-03-16 20:23:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:28,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:28,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:28,990 INFO L87 Difference]: Start difference. First operand 818 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,118 INFO L93 Difference]: Finished difference Result 1114 states and 1997 transitions. [2025-03-16 20:23:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:23:29,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:23:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,124 INFO L225 Difference]: With dead ends: 1114 [2025-03-16 20:23:29,124 INFO L226 Difference]: Without dead ends: 1077 [2025-03-16 20:23:29,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:23:29,126 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 6359 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 1993 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-16 20:23:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 853. [2025-03-16 20:23:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8578143360752057) internal successors, (1581), 852 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1581 transitions. [2025-03-16 20:23:29,149 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1581 transitions. Word has length 41 [2025-03-16 20:23:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:29,149 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1581 transitions. [2025-03-16 20:23:29,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1581 transitions. [2025-03-16 20:23:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:29,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:29,150 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] [2025-03-16 20:23:29,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:23:29,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:29,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1854186780, now seen corresponding path program 1 times [2025-03-16 20:23:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:29,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168321486] [2025-03-16 20:23:29,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:29,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:29,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:29,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168321486] [2025-03-16 20:23:29,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168321486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:29,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:29,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730825624] [2025-03-16 20:23:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:29,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:29,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:29,343 INFO L87 Difference]: Start difference. First operand 853 states and 1581 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,445 INFO L93 Difference]: Finished difference Result 927 states and 1697 transitions. [2025-03-16 20:23:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:29,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:23:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,449 INFO L225 Difference]: With dead ends: 927 [2025-03-16 20:23:29,450 INFO L226 Difference]: Without dead ends: 855 [2025-03-16 20:23:29,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:23:29,452 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 5928 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5928 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5928 Valid, 1684 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-16 20:23:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2025-03-16 20:23:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8566392479435958) internal successors, (1580), 852 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1580 transitions. [2025-03-16 20:23:29,472 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1580 transitions. Word has length 43 [2025-03-16 20:23:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1580 transitions. [2025-03-16 20:23:29,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1580 transitions. [2025-03-16 20:23:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:29,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:29,473 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] [2025-03-16 20:23:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:23:29,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1855229465, now seen corresponding path program 1 times [2025-03-16 20:23:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588970381] [2025-03-16 20:23:29,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:29,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588970381] [2025-03-16 20:23:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588970381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:29,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:29,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228612113] [2025-03-16 20:23:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:29,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:29,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,532 INFO L87 Difference]: Start difference. First operand 853 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,557 INFO L93 Difference]: Finished difference Result 986 states and 1789 transitions. [2025-03-16 20:23:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:23:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,561 INFO L225 Difference]: With dead ends: 986 [2025-03-16 20:23:29,561 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:23:29,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,562 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:23:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2025-03-16 20:23:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-16 20:23:29,578 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 43 [2025-03-16 20:23:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:29,578 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-16 20:23:29,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-16 20:23:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:23:29,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:29,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:29,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:23:29,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:29,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1644230272, now seen corresponding path program 1 times [2025-03-16 20:23:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932689616] [2025-03-16 20:23:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:29,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:23:29,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:23:29,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:29,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932689616] [2025-03-16 20:23:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932689616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934925916] [2025-03-16 20:23:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:29,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:29,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:29,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:29,756 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,782 INFO L93 Difference]: Finished difference Result 916 states and 1674 transitions. [2025-03-16 20:23:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 20:23:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,789 INFO L225 Difference]: With dead ends: 916 [2025-03-16 20:23:29,789 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:23:29,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:29,791 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:23:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2025-03-16 20:23:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 912 states have (on average 1.831140350877193) internal successors, (1670), 913 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1670 transitions. [2025-03-16 20:23:29,808 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1670 transitions. Word has length 44 [2025-03-16 20:23:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:29,809 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1670 transitions. [2025-03-16 20:23:29,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1670 transitions. [2025-03-16 20:23:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:29,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:29,809 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] [2025-03-16 20:23:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:23:29,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2138271558, now seen corresponding path program 1 times [2025-03-16 20:23:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547703204] [2025-03-16 20:23:29,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:29,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:29,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:29,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547703204] [2025-03-16 20:23:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547703204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11571395] [2025-03-16 20:23:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:29,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:29,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:29,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,859 INFO L87 Difference]: Start difference. First operand 914 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,878 INFO L93 Difference]: Finished difference Result 1164 states and 2050 transitions. [2025-03-16 20:23:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,882 INFO L225 Difference]: With dead ends: 1164 [2025-03-16 20:23:29,882 INFO L226 Difference]: Without dead ends: 1031 [2025-03-16 20:23:29,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,883 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1483 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-03-16 20:23:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1029. [2025-03-16 20:23:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1027 states have (on average 1.7925998052580332) internal successors, (1841), 1028 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1841 transitions. [2025-03-16 20:23:29,900 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1841 transitions. Word has length 45 [2025-03-16 20:23:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:29,900 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1841 transitions. [2025-03-16 20:23:29,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1841 transitions. [2025-03-16 20:23:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:29,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:29,900 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] [2025-03-16 20:23:29,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:23:29,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:29,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1588482630, now seen corresponding path program 1 times [2025-03-16 20:23:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308586436] [2025-03-16 20:23:29,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:29,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:29,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:29,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:29,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308586436] [2025-03-16 20:23:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308586436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529130463] [2025-03-16 20:23:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:29,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:29,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:29,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,957 INFO L87 Difference]: Start difference. First operand 1029 states and 1841 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:29,978 INFO L93 Difference]: Finished difference Result 1493 states and 2535 transitions. [2025-03-16 20:23:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:29,983 INFO L225 Difference]: With dead ends: 1493 [2025-03-16 20:23:29,983 INFO L226 Difference]: Without dead ends: 1245 [2025-03-16 20:23:29,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:29,984 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1481 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:29,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1621 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-03-16 20:23:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1243. [2025-03-16 20:23:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1241 states have (on average 1.7332796132151491) internal successors, (2151), 1242 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2151 transitions. [2025-03-16 20:23:30,006 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2151 transitions. Word has length 45 [2025-03-16 20:23:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:30,007 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2151 transitions. [2025-03-16 20:23:30,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2151 transitions. [2025-03-16 20:23:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:30,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:30,007 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] [2025-03-16 20:23:30,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:23:30,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2090513338, now seen corresponding path program 1 times [2025-03-16 20:23:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465529614] [2025-03-16 20:23:30,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:30,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:30,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:30,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:30,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465529614] [2025-03-16 20:23:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465529614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406493094] [2025-03-16 20:23:30,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:30,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:30,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:30,047 INFO L87 Difference]: Start difference. First operand 1243 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:30,073 INFO L93 Difference]: Finished difference Result 2103 states and 3409 transitions. [2025-03-16 20:23:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:30,078 INFO L225 Difference]: With dead ends: 2103 [2025-03-16 20:23:30,079 INFO L226 Difference]: Without dead ends: 1641 [2025-03-16 20:23:30,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:30,080 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1485 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:30,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-16 20:23:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1639. [2025-03-16 20:23:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1637 states have (on average 1.653634697617593) internal successors, (2707), 1638 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2707 transitions. [2025-03-16 20:23:30,112 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2707 transitions. Word has length 45 [2025-03-16 20:23:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:30,113 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2707 transitions. [2025-03-16 20:23:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2707 transitions. [2025-03-16 20:23:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:23:30,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:30,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:23:30,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1194131558, now seen corresponding path program 1 times [2025-03-16 20:23:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794004630] [2025-03-16 20:23:30,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:30,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:23:30,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:23:30,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:30,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:30,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:30,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794004630] [2025-03-16 20:23:30,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794004630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:30,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817357078] [2025-03-16 20:23:30,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:30,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:30,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:30,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:30,151 INFO L87 Difference]: Start difference. First operand 1639 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:30,178 INFO L93 Difference]: Finished difference Result 2542 states and 4041 transitions. [2025-03-16 20:23:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 20:23:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:30,184 INFO L225 Difference]: With dead ends: 2542 [2025-03-16 20:23:30,185 INFO L226 Difference]: Without dead ends: 2043 [2025-03-16 20:23:30,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:30,186 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1484 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:30,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-16 20:23:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2025-03-16 20:23:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2039 states have (on average 1.6071603727317312) internal successors, (3277), 2040 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3277 transitions. [2025-03-16 20:23:30,224 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3277 transitions. Word has length 47 [2025-03-16 20:23:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 2041 states and 3277 transitions. [2025-03-16 20:23:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3277 transitions. [2025-03-16 20:23:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:23:30,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:30,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:23:30,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -190681336, now seen corresponding path program 1 times [2025-03-16 20:23:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968089930] [2025-03-16 20:23:30,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:23:30,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:23:30,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:30,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:30,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:30,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968089930] [2025-03-16 20:23:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968089930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:30,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:23:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536676295] [2025-03-16 20:23:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:30,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:30,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:30,291 INFO L87 Difference]: Start difference. First operand 2041 states and 3277 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:32,800 INFO L93 Difference]: Finished difference Result 3545 states and 6150 transitions. [2025-03-16 20:23:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 20:23:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:32,811 INFO L225 Difference]: With dead ends: 3545 [2025-03-16 20:23:32,811 INFO L226 Difference]: Without dead ends: 2792 [2025-03-16 20:23:32,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:32,813 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 827 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:32,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 561 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:23:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2025-03-16 20:23:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2792. [2025-03-16 20:23:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2790 states have (on average 1.5254480286738352) internal successors, (4256), 2791 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4256 transitions. [2025-03-16 20:23:32,859 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4256 transitions. Word has length 60 [2025-03-16 20:23:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4256 transitions. [2025-03-16 20:23:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4256 transitions. [2025-03-16 20:23:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:32,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:32,862 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] [2025-03-16 20:23:32,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:23:32,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 96347508, now seen corresponding path program 1 times [2025-03-16 20:23:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078167447] [2025-03-16 20:23:32,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:32,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:32,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:32,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:23:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078167447] [2025-03-16 20:23:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078167447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201080206] [2025-03-16 20:23:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:32,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:32,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:32,957 INFO L87 Difference]: Start difference. First operand 2792 states and 4256 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:33,073 INFO L93 Difference]: Finished difference Result 8098 states and 11869 transitions. [2025-03-16 20:23:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:33,092 INFO L225 Difference]: With dead ends: 8098 [2025-03-16 20:23:33,092 INFO L226 Difference]: Without dead ends: 6840 [2025-03-16 20:23:33,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:33,096 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 4689 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4689 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:33,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4689 Valid, 3303 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2025-03-16 20:23:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4048. [2025-03-16 20:23:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4046 states have (on average 1.4928324270884825) internal successors, (6040), 4047 states have internal predecessors, (6040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 6040 transitions. [2025-03-16 20:23:33,211 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 6040 transitions. Word has length 61 [2025-03-16 20:23:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:33,211 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 6040 transitions. [2025-03-16 20:23:33,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 6040 transitions. [2025-03-16 20:23:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:33,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:33,212 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] [2025-03-16 20:23:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:23:33,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:33,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -453441420, now seen corresponding path program 1 times [2025-03-16 20:23:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626003377] [2025-03-16 20:23:33,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:33,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:33,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:23:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626003377] [2025-03-16 20:23:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626003377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:33,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:33,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425643252] [2025-03-16 20:23:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:33,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:33,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:33,300 INFO L87 Difference]: Start difference. First operand 4048 states and 6040 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:33,419 INFO L93 Difference]: Finished difference Result 9354 states and 13653 transitions. [2025-03-16 20:23:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:33,443 INFO L225 Difference]: With dead ends: 9354 [2025-03-16 20:23:33,443 INFO L226 Difference]: Without dead ends: 8096 [2025-03-16 20:23:33,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:33,448 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4687 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:33,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 3297 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2025-03-16 20:23:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 5936. [2025-03-16 20:23:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5934 states have (on average 1.4654533198517021) internal successors, (8696), 5935 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 8696 transitions. [2025-03-16 20:23:33,572 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 8696 transitions. Word has length 61 [2025-03-16 20:23:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:33,572 INFO L471 AbstractCegarLoop]: Abstraction has 5936 states and 8696 transitions. [2025-03-16 20:23:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 8696 transitions. [2025-03-16 20:23:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:33,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:33,573 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] [2025-03-16 20:23:33,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:23:33,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:33,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 162529908, now seen corresponding path program 1 times [2025-03-16 20:23:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497808445] [2025-03-16 20:23:33,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:33,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:23:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497808445] [2025-03-16 20:23:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497808445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143979296] [2025-03-16 20:23:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:33,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:33,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:33,668 INFO L87 Difference]: Start difference. First operand 5936 states and 8696 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:33,802 INFO L93 Difference]: Finished difference Result 10610 states and 15437 transitions. [2025-03-16 20:23:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:33,817 INFO L225 Difference]: With dead ends: 10610 [2025-03-16 20:23:33,818 INFO L226 Difference]: Without dead ends: 9352 [2025-03-16 20:23:33,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:33,822 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4655 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:33,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 3338 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2025-03-16 20:23:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 7192. [2025-03-16 20:23:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7192 states, 7190 states have (on average 1.4575799721835883) internal successors, (10480), 7191 states have internal predecessors, (10480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7192 states to 7192 states and 10480 transitions. [2025-03-16 20:23:34,008 INFO L78 Accepts]: Start accepts. Automaton has 7192 states and 10480 transitions. Word has length 61 [2025-03-16 20:23:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 7192 states and 10480 transitions. [2025-03-16 20:23:34,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7192 states and 10480 transitions. [2025-03-16 20:23:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:23:34,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:34,012 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] [2025-03-16 20:23:34,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:23:34,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1862143114, now seen corresponding path program 1 times [2025-03-16 20:23:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:34,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796130708] [2025-03-16 20:23:34,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:34,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:23:34,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:23:34,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:34,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796130708] [2025-03-16 20:23:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796130708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664838989] [2025-03-16 20:23:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:34,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:34,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:34,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,081 INFO L87 Difference]: Start difference. First operand 7192 states and 10480 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:34,134 INFO L93 Difference]: Finished difference Result 11245 states and 16332 transitions. [2025-03-16 20:23:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 20:23:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:34,145 INFO L225 Difference]: With dead ends: 11245 [2025-03-16 20:23:34,145 INFO L226 Difference]: Without dead ends: 5587 [2025-03-16 20:23:34,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,151 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:34,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3067 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2025-03-16 20:23:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5585. [2025-03-16 20:23:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5583 states have (on average 1.4732222819272793) internal successors, (8225), 5584 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8225 transitions. [2025-03-16 20:23:34,227 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8225 transitions. Word has length 63 [2025-03-16 20:23:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:34,227 INFO L471 AbstractCegarLoop]: Abstraction has 5585 states and 8225 transitions. [2025-03-16 20:23:34,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8225 transitions. [2025-03-16 20:23:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:23:34,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:34,228 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] [2025-03-16 20:23:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:23:34,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1705173780, now seen corresponding path program 1 times [2025-03-16 20:23:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037579647] [2025-03-16 20:23:34,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:34,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:23:34,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:23:34,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:34,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:23:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037579647] [2025-03-16 20:23:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037579647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:34,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018562210] [2025-03-16 20:23:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:34,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:34,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:34,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:34,309 INFO L87 Difference]: Start difference. First operand 5585 states and 8225 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:34,423 INFO L93 Difference]: Finished difference Result 9179 states and 13414 transitions. [2025-03-16 20:23:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:23:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:34,438 INFO L225 Difference]: With dead ends: 9179 [2025-03-16 20:23:34,438 INFO L226 Difference]: Without dead ends: 8281 [2025-03-16 20:23:34,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:34,443 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4657 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4657 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:34,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4657 Valid, 3311 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2025-03-16 20:23:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 6481. [2025-03-16 20:23:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 6479 states have (on average 1.4670473838555333) internal successors, (9505), 6480 states have internal predecessors, (9505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 9505 transitions. [2025-03-16 20:23:34,541 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 9505 transitions. Word has length 63 [2025-03-16 20:23:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:34,541 INFO L471 AbstractCegarLoop]: Abstraction has 6481 states and 9505 transitions. [2025-03-16 20:23:34,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 9505 transitions. [2025-03-16 20:23:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:23:34,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:34,542 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] [2025-03-16 20:23:34,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:23:34,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1410201656, now seen corresponding path program 1 times [2025-03-16 20:23:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441274507] [2025-03-16 20:23:34,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:34,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:23:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:23:34,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441274507] [2025-03-16 20:23:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441274507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056823696] [2025-03-16 20:23:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:34,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:34,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:34,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,634 INFO L87 Difference]: Start difference. First operand 6481 states and 9505 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:34,695 INFO L93 Difference]: Finished difference Result 8949 states and 13027 transitions. [2025-03-16 20:23:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:23:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:34,701 INFO L225 Difference]: With dead ends: 8949 [2025-03-16 20:23:34,702 INFO L226 Difference]: Without dead ends: 4019 [2025-03-16 20:23:34,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,707 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 37 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:34,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3052 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-03-16 20:23:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4017. [2025-03-16 20:23:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 4015 states have (on average 1.4797011207970112) internal successors, (5941), 4016 states have internal predecessors, (5941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5941 transitions. [2025-03-16 20:23:34,784 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5941 transitions. Word has length 64 [2025-03-16 20:23:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:34,785 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5941 transitions. [2025-03-16 20:23:34,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5941 transitions. [2025-03-16 20:23:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:23:34,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:34,786 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] [2025-03-16 20:23:34,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:23:34,786 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2134590337, now seen corresponding path program 1 times [2025-03-16 20:23:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310540145] [2025-03-16 20:23:34,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:34,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:23:34,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:23:34,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:34,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:34,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310540145] [2025-03-16 20:23:34,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310540145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:34,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092829194] [2025-03-16 20:23:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:34,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:34,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,868 INFO L87 Difference]: Start difference. First operand 4017 states and 5941 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:34,906 INFO L93 Difference]: Finished difference Result 5253 states and 7681 transitions. [2025-03-16 20:23:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:23:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:34,911 INFO L225 Difference]: With dead ends: 5253 [2025-03-16 20:23:34,912 INFO L226 Difference]: Without dead ends: 2787 [2025-03-16 20:23:34,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:34,914 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 34 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:34,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3037 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-03-16 20:23:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2785. [2025-03-16 20:23:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.5023356090549767) internal successors, (4181), 2784 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4181 transitions. [2025-03-16 20:23:34,962 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4181 transitions. Word has length 66 [2025-03-16 20:23:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:34,962 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4181 transitions. [2025-03-16 20:23:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4181 transitions. [2025-03-16 20:23:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:23:34,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:34,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:23:34,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1210827322, now seen corresponding path program 1 times [2025-03-16 20:23:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:34,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215683519] [2025-03-16 20:23:34,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:23:34,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:23:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215683519] [2025-03-16 20:23:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215683519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:35,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965498998] [2025-03-16 20:23:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:35,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:35,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:35,027 INFO L87 Difference]: Start difference. First operand 2785 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:35,047 INFO L93 Difference]: Finished difference Result 3405 states and 5041 transitions. [2025-03-16 20:23:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:35,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:23:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:35,051 INFO L225 Difference]: With dead ends: 3405 [2025-03-16 20:23:35,051 INFO L226 Difference]: Without dead ends: 2171 [2025-03-16 20:23:35,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:35,053 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:35,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-16 20:23:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2025-03-16 20:23:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.5283802491924319) internal successors, (3312), 2168 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3312 transitions. [2025-03-16 20:23:35,075 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3312 transitions. Word has length 68 [2025-03-16 20:23:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3312 transitions. [2025-03-16 20:23:35,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3312 transitions. [2025-03-16 20:23:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:23:35,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:35,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:23:35,078 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 301011955, now seen corresponding path program 1 times [2025-03-16 20:23:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546435820] [2025-03-16 20:23:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:35,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:23:35,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:23:35,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546435820] [2025-03-16 20:23:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546435820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906143359] [2025-03-16 20:23:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:35,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:23:35,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:23:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:23:35,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:23:35,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:35,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:35,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:23:35,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:35,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906143359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:35,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:35,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-03-16 20:23:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235779734] [2025-03-16 20:23:35,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:35,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:23:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:35,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:23:35,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:23:35,967 INFO L87 Difference]: Start difference. First operand 2169 states and 3312 transitions. Second operand has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:38,356 INFO L93 Difference]: Finished difference Result 7163 states and 9996 transitions. [2025-03-16 20:23:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-16 20:23:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 20:23:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:38,367 INFO L225 Difference]: With dead ends: 7163 [2025-03-16 20:23:38,367 INFO L226 Difference]: Without dead ends: 6471 [2025-03-16 20:23:38,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=831, Invalid=3201, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 20:23:38,373 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 11324 mSDsluCounter, 6607 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11324 SdHoareTripleChecker+Valid, 8137 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11324 Valid, 8137 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:23:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2025-03-16 20:23:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 6017. [2025-03-16 20:23:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6017 states, 6015 states have (on average 1.3876974231088943) internal successors, (8347), 6016 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6017 states to 6017 states and 8347 transitions. [2025-03-16 20:23:38,485 INFO L78 Accepts]: Start accepts. Automaton has 6017 states and 8347 transitions. Word has length 70 [2025-03-16 20:23:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:38,485 INFO L471 AbstractCegarLoop]: Abstraction has 6017 states and 8347 transitions. [2025-03-16 20:23:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6017 states and 8347 transitions. [2025-03-16 20:23:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:23:38,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:38,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:38,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:23:38,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:38,687 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:38,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1576910278, now seen corresponding path program 1 times [2025-03-16 20:23:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249606909] [2025-03-16 20:23:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:23:38,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:23:38,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:38,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249606909] [2025-03-16 20:23:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249606909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52437882] [2025-03-16 20:23:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:38,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:23:38,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:23:39,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:23:39,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:23:39,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:23:39,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:39,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52437882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:40,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-16 20:23:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691003834] [2025-03-16 20:23:40,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:23:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:40,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:23:40,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:23:40,417 INFO L87 Difference]: Start difference. First operand 6017 states and 8347 transitions. Second operand has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:42,942 INFO L93 Difference]: Finished difference Result 28868 states and 38313 transitions. [2025-03-16 20:23:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 20:23:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 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 71 [2025-03-16 20:23:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:42,976 INFO L225 Difference]: With dead ends: 28868 [2025-03-16 20:23:42,976 INFO L226 Difference]: Without dead ends: 24418 [2025-03-16 20:23:42,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2025-03-16 20:23:42,985 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 17016 mSDsluCounter, 13980 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17016 SdHoareTripleChecker+Valid, 15483 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:42,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17016 Valid, 15483 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:23:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24418 states. [2025-03-16 20:23:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24418 to 11615. [2025-03-16 20:23:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11615 states, 11613 states have (on average 1.3335916645139068) internal successors, (15487), 11614 states have internal predecessors, (15487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11615 states to 11615 states and 15487 transitions. [2025-03-16 20:23:43,379 INFO L78 Accepts]: Start accepts. Automaton has 11615 states and 15487 transitions. Word has length 71 [2025-03-16 20:23:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:43,380 INFO L471 AbstractCegarLoop]: Abstraction has 11615 states and 15487 transitions. [2025-03-16 20:23:43,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11615 states and 15487 transitions. [2025-03-16 20:23:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:23:43,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:43,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:43,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:23:43,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 20:23:43,581 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1873793026, now seen corresponding path program 1 times [2025-03-16 20:23:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670071427] [2025-03-16 20:23:43,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:43,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:23:43,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:23:43,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:43,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:43,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670071427] [2025-03-16 20:23:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670071427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656050749] [2025-03-16 20:23:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:43,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:23:43,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:23:43,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:23:43,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:23:43,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:43,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 20:23:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:46,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656050749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:48,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 17] total 43 [2025-03-16 20:23:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933417045] [2025-03-16 20:23:48,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 20:23:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 20:23:48,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 20:23:48,157 INFO L87 Difference]: Start difference. First operand 11615 states and 15487 transitions. Second operand has 43 states, 43 states have (on average 4.627906976744186) internal successors, (199), 43 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:24:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:22,299 INFO L93 Difference]: Finished difference Result 73398 states and 95556 transitions. [2025-03-16 20:24:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-03-16 20:24:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.627906976744186) internal successors, (199), 43 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 20:24:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:22,397 INFO L225 Difference]: With dead ends: 73398 [2025-03-16 20:24:22,397 INFO L226 Difference]: Without dead ends: 63855 [2025-03-16 20:24:22,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25279 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=9915, Invalid=50847, Unknown=0, NotChecked=0, Total=60762 [2025-03-16 20:24:22,427 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 25296 mSDsluCounter, 17216 mSDsCounter, 0 mSdLazyCounter, 3513 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25296 SdHoareTripleChecker+Valid, 18755 SdHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 3513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:22,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25296 Valid, 18755 Invalid, 3683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 3513 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:24:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63855 states. [2025-03-16 20:24:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63855 to 33195. [2025-03-16 20:24:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33195 states, 33193 states have (on average 1.284668454192149) internal successors, (42642), 33194 states have internal predecessors, (42642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:24:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33195 states to 33195 states and 42642 transitions. [2025-03-16 20:24:23,827 INFO L78 Accepts]: Start accepts. Automaton has 33195 states and 42642 transitions. Word has length 72 [2025-03-16 20:24:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 33195 states and 42642 transitions. [2025-03-16 20:24:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.627906976744186) internal successors, (199), 43 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:24:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 33195 states and 42642 transitions. [2025-03-16 20:24:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:24:23,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:23,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:24:23,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:24:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:24,033 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1800882624, now seen corresponding path program 1 times [2025-03-16 20:24:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379034738] [2025-03-16 20:24:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:24:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:24:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:25,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379034738] [2025-03-16 20:24:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379034738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:24:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486296513] [2025-03-16 20:24:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:24:25,965 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:24:25,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:24:26,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:24:26,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:24:26,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:26,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:24:26,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:24:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:28,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:24:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486296513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:24:30,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:24:30,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 17] total 56 [2025-03-16 20:24:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969897245] [2025-03-16 20:24:30,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:24:30,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-16 20:24:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:30,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-16 20:24:30,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2818, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 20:24:30,428 INFO L87 Difference]: Start difference. First operand 33195 states and 42642 transitions. Second operand has 56 states, 56 states have (on average 3.5714285714285716) internal successors, (200), 56 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)