./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f55f072ecdf3d78d3ca7f1962c5c3e686ff404baddd6e7cb2257667b7a57198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:29:05,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:29:05,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:29:05,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:29:05,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:29:05,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:29:05,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:29:05,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:29:05,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:29:05,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:29:05,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:29:05,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:29:05,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:29:05,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:29:05,212 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:29:05,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:29:05,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:29:05,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:29:05,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:29:05,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:29:05,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:29:05,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:29:05,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:29:05,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:29:05,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:29:05,215 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 -> 0f55f072ecdf3d78d3ca7f1962c5c3e686ff404baddd6e7cb2257667b7a57198 [2025-03-16 20:29:05,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:29:05,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:29:05,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:29:05,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:29:05,447 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:29:05,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:29:06,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2ae23a1/81eb0b0239024bd690362f2faa1cdbf4/FLAG93dc173e3 [2025-03-16 20:29:07,010 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:29:07,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:29:07,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2ae23a1/81eb0b0239024bd690362f2faa1cdbf4/FLAG93dc173e3 [2025-03-16 20:29:07,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2ae23a1/81eb0b0239024bd690362f2faa1cdbf4 [2025-03-16 20:29:07,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:29:07,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:29:07,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:29:07,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:29:07,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:29:07,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:29:07" (1/1) ... [2025-03-16 20:29:07,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce4d9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:07, skipping insertion in model container [2025-03-16 20:29:07,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:29:07" (1/1) ... [2025-03-16 20:29:07,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:29:07,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c[11668,11681] [2025-03-16 20:29:07,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c[12510,12523] [2025-03-16 20:29:07,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:29:07,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:29:07,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c[11668,11681] [2025-03-16 20:29:07,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c[12510,12523] [2025-03-16 20:29:08,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:29:08,086 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:29:08,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08 WrapperNode [2025-03-16 20:29:08,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:29:08,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:29:08,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:29:08,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:29:08,092 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:29:08" (1/1) ... [2025-03-16 20:29:08,139 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:29:08" (1/1) ... [2025-03-16 20:29:08,339 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-16 20:29:08,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:29:08,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:29:08,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:29:08,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:29:08,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,501 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:29:08,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:29:08,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:29:08,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:29:08,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:29:08,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (1/1) ... [2025-03-16 20:29:08,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:29:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:08,710 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:29:08,716 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:29:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:29:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:29:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:29:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:29:08,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:29:08,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:29:11,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-16 20:29:11,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-16 20:29:11,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-16 20:29:12,019 INFO L? ?]: Removed 740 outVars from TransFormulas that were not future-live. [2025-03-16 20:29:12,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:29:12,048 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:29:12,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:29:12,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:29:12 BoogieIcfgContainer [2025-03-16 20:29:12,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:29:12,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:29:12,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:29:12,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:29:12,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:29:07" (1/3) ... [2025-03-16 20:29:12,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc9cc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:29:12, skipping insertion in model container [2025-03-16 20:29:12,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:29:08" (2/3) ... [2025-03-16 20:29:12,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc9cc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:29:12, skipping insertion in model container [2025-03-16 20:29:12,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:29:12" (3/3) ... [2025-03-16 20:29:12,060 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:29:12,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:29:12,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 836 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:29:12,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:29:12,148 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;@46e4bdcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:29:12,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:29:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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:29:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 20:29:12,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:12,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 20:29:12,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1510630750, now seen corresponding path program 1 times [2025-03-16 20:29:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102673501] [2025-03-16 20:29:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:12,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 20:29:12,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 20:29:12,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:12,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:12,343 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:29:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102673501] [2025-03-16 20:29:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102673501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:29:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459151559] [2025-03-16 20:29:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:12,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:12,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:12,364 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:15,064 INFO L93 Difference]: Finished difference Result 2392 states and 4719 transitions. [2025-03-16 20:29:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-16 20:29:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:15,079 INFO L225 Difference]: With dead ends: 2392 [2025-03-16 20:29:15,079 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:29:15,083 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:29:15,085 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 948 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:15,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 220 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:29:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:29:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-03-16 20:29:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.8652751423149905) internal successors, (2949), 1582 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states 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:29:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2949 transitions. [2025-03-16 20:29:15,194 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2949 transitions. Word has length 6 [2025-03-16 20:29:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:15,195 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2949 transitions. [2025-03-16 20:29:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2949 transitions. [2025-03-16 20:29:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:29:15,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:15,197 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] [2025-03-16 20:29:15,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:29:15,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:15,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1088994121, now seen corresponding path program 1 times [2025-03-16 20:29:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619554952] [2025-03-16 20:29:15,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:15,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:29:15,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:29:15,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:15,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:15,351 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:29:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:15,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619554952] [2025-03-16 20:29:15,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619554952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:15,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:29:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187824215] [2025-03-16 20:29:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:15,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:29:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:15,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:29:15,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:29:15,355 INFO L87 Difference]: Start difference. First operand 1583 states and 2949 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:29:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:15,401 INFO L93 Difference]: Finished difference Result 1629 states and 3021 transitions. [2025-03-16 20:29:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:29:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 20:29:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:15,409 INFO L225 Difference]: With dead ends: 1629 [2025-03-16 20:29:15,409 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:29:15,410 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:29:15,411 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:15,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4684 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:29:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-03-16 20:29:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.8456672991777356) internal successors, (2918), 1582 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states 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:29:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2918 transitions. [2025-03-16 20:29:15,440 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2918 transitions. Word has length 21 [2025-03-16 20:29:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:15,441 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2918 transitions. [2025-03-16 20:29:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:29:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2918 transitions. [2025-03-16 20:29:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:29:15,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:15,442 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] [2025-03-16 20:29:15,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:29:15,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:15,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -586643669, now seen corresponding path program 1 times [2025-03-16 20:29:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241094839] [2025-03-16 20:29:15,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:29:15,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:29:15,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:15,641 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:29:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241094839] [2025-03-16 20:29:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241094839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800355573] [2025-03-16 20:29:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:15,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:15,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:15,644 INFO L87 Difference]: Start difference. First operand 1583 states and 2918 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:15,811 INFO L93 Difference]: Finished difference Result 2013 states and 3608 transitions. [2025-03-16 20:29:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:29:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 20:29:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:15,821 INFO L225 Difference]: With dead ends: 2013 [2025-03-16 20:29:15,821 INFO L226 Difference]: Without dead ends: 1970 [2025-03-16 20:29:15,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:29:15,824 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 8015 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8015 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:15,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8015 Valid, 2520 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-16 20:29:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1624. [2025-03-16 20:29:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.8397040690505548) internal successors, (2984), 1623 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states 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:29:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2984 transitions. [2025-03-16 20:29:15,854 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2984 transitions. Word has length 51 [2025-03-16 20:29:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:15,855 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2984 transitions. [2025-03-16 20:29:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2984 transitions. [2025-03-16 20:29:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:29:15,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:15,857 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] [2025-03-16 20:29:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:29:15,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1086667923, now seen corresponding path program 1 times [2025-03-16 20:29:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265296814] [2025-03-16 20:29:15,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:15,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:29:15,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:29:15,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:16,133 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:29:16,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265296814] [2025-03-16 20:29:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265296814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249970122] [2025-03-16 20:29:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:16,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:16,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:16,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:16,136 INFO L87 Difference]: Start difference. First operand 1624 states and 2984 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:16,316 INFO L93 Difference]: Finished difference Result 1710 states and 3120 transitions. [2025-03-16 20:29:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 20:29:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:16,322 INFO L225 Difference]: With dead ends: 1710 [2025-03-16 20:29:16,322 INFO L226 Difference]: Without dead ends: 1626 [2025-03-16 20:29:16,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:29:16,324 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 7454 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7454 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:16,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7454 Valid, 1797 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-03-16 20:29:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2025-03-16 20:29:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.839087546239211) internal successors, (2983), 1623 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states 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:29:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2983 transitions. [2025-03-16 20:29:16,357 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2983 transitions. Word has length 53 [2025-03-16 20:29:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:16,357 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2983 transitions. [2025-03-16 20:29:16,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2983 transitions. [2025-03-16 20:29:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:29:16,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:16,359 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] [2025-03-16 20:29:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:29:16,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1087710608, now seen corresponding path program 1 times [2025-03-16 20:29:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485257825] [2025-03-16 20:29:16,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:16,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:29:16,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:29:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:16,451 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:29:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485257825] [2025-03-16 20:29:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485257825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035794200] [2025-03-16 20:29:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:16,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:16,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:16,454 INFO L87 Difference]: Start difference. First operand 1624 states and 2983 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:16,489 INFO L93 Difference]: Finished difference Result 1781 states and 3232 transitions. [2025-03-16 20:29:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 20:29:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:16,496 INFO L225 Difference]: With dead ends: 1781 [2025-03-16 20:29:16,496 INFO L226 Difference]: Without dead ends: 1697 [2025-03-16 20:29:16,497 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:29:16,497 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1601 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:29:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-16 20:29:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1693. [2025-03-16 20:29:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.8273211117681845) internal successors, (3090), 1692 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states 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:29:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3090 transitions. [2025-03-16 20:29:16,532 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3090 transitions. Word has length 53 [2025-03-16 20:29:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 3090 transitions. [2025-03-16 20:29:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3090 transitions. [2025-03-16 20:29:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:29:16,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:16,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:29:16,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 674017815, now seen corresponding path program 1 times [2025-03-16 20:29:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219497453] [2025-03-16 20:29:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:29:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:29:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:16,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:16,746 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:29:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219497453] [2025-03-16 20:29:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219497453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:29:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539928048] [2025-03-16 20:29:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:16,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:29:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:16,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:29:16,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:29:16,750 INFO L87 Difference]: Start difference. First operand 1693 states and 3090 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:29:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:16,790 INFO L93 Difference]: Finished difference Result 1699 states and 3097 transitions. [2025-03-16 20:29:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:29:16,791 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 54 [2025-03-16 20:29:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:16,796 INFO L225 Difference]: With dead ends: 1699 [2025-03-16 20:29:16,796 INFO L226 Difference]: Without dead ends: 1697 [2025-03-16 20:29:16,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:29:16,797 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7684 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:16,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7684 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-16 20:29:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2025-03-16 20:29:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1695 states have (on average 1.8247787610619468) internal successors, (3093), 1696 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states 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:29:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 3093 transitions. [2025-03-16 20:29:16,824 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 3093 transitions. Word has length 54 [2025-03-16 20:29:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:16,825 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 3093 transitions. [2025-03-16 20:29:16,825 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:29:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 3093 transitions. [2025-03-16 20:29:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:29:16,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:16,826 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] [2025-03-16 20:29:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:29:16,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 232477583, now seen corresponding path program 1 times [2025-03-16 20:29:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157362960] [2025-03-16 20:29:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:16,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:29:16,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:29:16,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:16,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:16,888 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:29:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157362960] [2025-03-16 20:29:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157362960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584579372] [2025-03-16 20:29:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:16,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:16,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:16,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:16,889 INFO L87 Difference]: Start difference. First operand 1697 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:16,912 INFO L93 Difference]: Finished difference Result 1995 states and 3553 transitions. [2025-03-16 20:29:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:29:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:16,919 INFO L225 Difference]: With dead ends: 1995 [2025-03-16 20:29:16,919 INFO L226 Difference]: Without dead ends: 1838 [2025-03-16 20:29:16,920 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:29:16,920 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1495 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:16,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-16 20:29:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1836. [2025-03-16 20:29:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1834 states have (on average 1.8015267175572518) internal successors, (3304), 1835 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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:29:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 3304 transitions. [2025-03-16 20:29:16,950 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 3304 transitions. Word has length 55 [2025-03-16 20:29:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:16,950 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 3304 transitions. [2025-03-16 20:29:16,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 3304 transitions. [2025-03-16 20:29:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:29:16,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:16,951 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] [2025-03-16 20:29:16,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:29:16,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:16,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 989518223, now seen corresponding path program 1 times [2025-03-16 20:29:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037261937] [2025-03-16 20:29:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:16,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:29:16,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:29:16,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:16,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:17,000 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:29:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037261937] [2025-03-16 20:29:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037261937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817005957] [2025-03-16 20:29:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:17,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:17,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:17,003 INFO L87 Difference]: Start difference. First operand 1836 states and 3304 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:17,028 INFO L93 Difference]: Finished difference Result 2396 states and 4158 transitions. [2025-03-16 20:29:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:29:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:17,036 INFO L225 Difference]: With dead ends: 2396 [2025-03-16 20:29:17,036 INFO L226 Difference]: Without dead ends: 2100 [2025-03-16 20:29:17,037 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:29:17,038 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1491 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1659 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:29:17,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1659 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-16 20:29:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2025-03-16 20:29:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2096 states have (on average 1.7624045801526718) internal successors, (3694), 2097 states have internal predecessors, (3694), 0 states have call successors, (0), 0 states 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:29:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3694 transitions. [2025-03-16 20:29:17,109 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3694 transitions. Word has length 55 [2025-03-16 20:29:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:17,109 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3694 transitions. [2025-03-16 20:29:17,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3694 transitions. [2025-03-16 20:29:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:29:17,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:17,110 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] [2025-03-16 20:29:17,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:29:17,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 439729295, now seen corresponding path program 1 times [2025-03-16 20:29:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763229097] [2025-03-16 20:29:17,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:17,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:29:17,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:29:17,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:17,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:17,177 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:29:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763229097] [2025-03-16 20:29:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763229097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:17,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385117555] [2025-03-16 20:29:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:17,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:17,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:17,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:17,178 INFO L87 Difference]: Start difference. First operand 2098 states and 3694 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:17,215 INFO L93 Difference]: Finished difference Result 3150 states and 5272 transitions. [2025-03-16 20:29:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:29:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:17,224 INFO L225 Difference]: With dead ends: 3150 [2025-03-16 20:29:17,224 INFO L226 Difference]: Without dead ends: 2592 [2025-03-16 20:29:17,225 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:29:17,225 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 1489 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1661 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:29:17,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1661 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2025-03-16 20:29:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2025-03-16 20:29:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2588 states have (on average 1.704018547140649) internal successors, (4410), 2589 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states 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:29:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4410 transitions. [2025-03-16 20:29:17,325 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4410 transitions. Word has length 55 [2025-03-16 20:29:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:17,326 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4410 transitions. [2025-03-16 20:29:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4410 transitions. [2025-03-16 20:29:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:29:17,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:17,326 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] [2025-03-16 20:29:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:29:17,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:17,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1055700623, now seen corresponding path program 1 times [2025-03-16 20:29:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072221555] [2025-03-16 20:29:17,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:17,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:29:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:29:17,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:17,376 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:29:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072221555] [2025-03-16 20:29:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072221555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676125752] [2025-03-16 20:29:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:17,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:17,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:17,377 INFO L87 Difference]: Start difference. First operand 2590 states and 4410 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:17,422 INFO L93 Difference]: Finished difference Result 4562 states and 7308 transitions. [2025-03-16 20:29:17,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:17,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:29:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:17,438 INFO L225 Difference]: With dead ends: 4562 [2025-03-16 20:29:17,438 INFO L226 Difference]: Without dead ends: 3512 [2025-03-16 20:29:17,439 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:29:17,440 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1665 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:29:17,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1665 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2025-03-16 20:29:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2025-03-16 20:29:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3508 states have (on average 1.62884834663626) internal successors, (5714), 3509 states have internal predecessors, (5714), 0 states have call successors, (0), 0 states 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:29:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5714 transitions. [2025-03-16 20:29:17,497 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5714 transitions. Word has length 55 [2025-03-16 20:29:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:17,498 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5714 transitions. [2025-03-16 20:29:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:29:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5714 transitions. [2025-03-16 20:29:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:29:17,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:17,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:29:17,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash -441912209, now seen corresponding path program 1 times [2025-03-16 20:29:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676314843] [2025-03-16 20:29:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:17,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:29:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:29:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:17,533 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:29:17,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676314843] [2025-03-16 20:29:17,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676314843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:17,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:17,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355791516] [2025-03-16 20:29:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:17,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:17,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:17,535 INFO L87 Difference]: Start difference. First operand 3510 states and 5714 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:17,577 INFO L93 Difference]: Finished difference Result 5565 states and 8760 transitions. [2025-03-16 20:29:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:29:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:17,595 INFO L225 Difference]: With dead ends: 5565 [2025-03-16 20:29:17,596 INFO L226 Difference]: Without dead ends: 4442 [2025-03-16 20:29:17,600 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:29:17,600 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1494 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1664 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:29:17,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1664 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2025-03-16 20:29:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4440. [2025-03-16 20:29:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4438 states have (on average 1.587201442091032) internal successors, (7044), 4439 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states 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:29:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 7044 transitions. [2025-03-16 20:29:17,685 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 7044 transitions. Word has length 57 [2025-03-16 20:29:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:17,686 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 7044 transitions. [2025-03-16 20:29:17,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 7044 transitions. [2025-03-16 20:29:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:29:17,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:17,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:17,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:29:17,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:17,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash 289567166, now seen corresponding path program 1 times [2025-03-16 20:29:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953528850] [2025-03-16 20:29:17,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:17,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:29:17,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:29:17,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:17,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:29:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:17,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953528850] [2025-03-16 20:29:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953528850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:17,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686238007] [2025-03-16 20:29:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:17,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:17,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:17,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:17,818 INFO L87 Difference]: Start difference. First operand 4440 states and 7044 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:18,048 INFO L93 Difference]: Finished difference Result 19540 states and 28858 transitions. [2025-03-16 20:29:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:29:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:18,074 INFO L225 Difference]: With dead ends: 19540 [2025-03-16 20:29:18,075 INFO L226 Difference]: Without dead ends: 16642 [2025-03-16 20:29:18,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:29:18,082 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6364 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6364 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:18,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6364 Valid, 3554 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2025-03-16 20:29:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 7336. [2025-03-16 20:29:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7336 states, 7334 states have (on average 1.5254976820289066) internal successors, (11188), 7335 states have internal predecessors, (11188), 0 states have call successors, (0), 0 states 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:29:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 11188 transitions. [2025-03-16 20:29:18,282 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 11188 transitions. Word has length 73 [2025-03-16 20:29:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:18,282 INFO L471 AbstractCegarLoop]: Abstraction has 7336 states and 11188 transitions. [2025-03-16 20:29:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 11188 transitions. [2025-03-16 20:29:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:29:18,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:18,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:29:18,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:18,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1046607806, now seen corresponding path program 1 times [2025-03-16 20:29:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:18,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412207929] [2025-03-16 20:29:18,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:18,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:29:18,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:29:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:29:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412207929] [2025-03-16 20:29:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412207929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627062150] [2025-03-16 20:29:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:18,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:18,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:18,398 INFO L87 Difference]: Start difference. First operand 7336 states and 11188 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:29:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:18,722 INFO L93 Difference]: Finished difference Result 22436 states and 33002 transitions. [2025-03-16 20:29:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:18,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 73 [2025-03-16 20:29:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:18,776 INFO L225 Difference]: With dead ends: 22436 [2025-03-16 20:29:18,778 INFO L226 Difference]: Without dead ends: 19538 [2025-03-16 20:29:18,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:29:18,795 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 6414 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6414 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:18,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6414 Valid, 3507 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2025-03-16 20:29:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 11688. [2025-03-16 20:29:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.4858805408180729) internal successors, (17364), 11687 states have internal predecessors, (17364), 0 states have call successors, (0), 0 states 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:29:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17364 transitions. [2025-03-16 20:29:19,178 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17364 transitions. Word has length 73 [2025-03-16 20:29:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:19,178 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 17364 transitions. [2025-03-16 20:29:19,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:29:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17364 transitions. [2025-03-16 20:29:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:29:19,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:19,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:19,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:29:19,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:19,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 496818878, now seen corresponding path program 1 times [2025-03-16 20:29:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:19,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000963096] [2025-03-16 20:29:19,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:19,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:29:19,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:29:19,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:19,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:29:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000963096] [2025-03-16 20:29:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000963096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233306357] [2025-03-16 20:29:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:19,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:19,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:19,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:19,293 INFO L87 Difference]: Start difference. First operand 11688 states and 17364 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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:29:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:19,665 INFO L93 Difference]: Finished difference Result 25332 states and 37146 transitions. [2025-03-16 20:29:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 73 [2025-03-16 20:29:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:19,700 INFO L225 Difference]: With dead ends: 25332 [2025-03-16 20:29:19,700 INFO L226 Difference]: Without dead ends: 22434 [2025-03-16 20:29:19,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:29:19,708 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6369 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:19,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3541 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2025-03-16 20:29:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 14584. [2025-03-16 20:29:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14584 states, 14582 states have (on average 1.4749691400356604) internal successors, (21508), 14583 states have internal predecessors, (21508), 0 states have call successors, (0), 0 states 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:29:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 21508 transitions. [2025-03-16 20:29:20,114 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 21508 transitions. Word has length 73 [2025-03-16 20:29:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:20,114 INFO L471 AbstractCegarLoop]: Abstraction has 14584 states and 21508 transitions. [2025-03-16 20:29:20,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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:29:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 21508 transitions. [2025-03-16 20:29:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:29:20,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:20,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:29:20,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:20,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1112790206, now seen corresponding path program 1 times [2025-03-16 20:29:20,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:20,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186956595] [2025-03-16 20:29:20,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:29:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:29:20,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:29:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186956595] [2025-03-16 20:29:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186956595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962654146] [2025-03-16 20:29:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:20,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:20,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:20,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:20,264 INFO L87 Difference]: Start difference. First operand 14584 states and 21508 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:20,689 INFO L93 Difference]: Finished difference Result 28228 states and 41290 transitions. [2025-03-16 20:29:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:20,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:29:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:20,731 INFO L225 Difference]: With dead ends: 28228 [2025-03-16 20:29:20,731 INFO L226 Difference]: Without dead ends: 25330 [2025-03-16 20:29:20,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:29:20,740 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6321 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:20,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3586 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2025-03-16 20:29:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 17480. [2025-03-16 20:29:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17478 states have (on average 1.4676736468703513) internal successors, (25652), 17479 states have internal predecessors, (25652), 0 states have call successors, (0), 0 states 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:29:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 25652 transitions. [2025-03-16 20:29:21,064 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 25652 transitions. Word has length 73 [2025-03-16 20:29:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:21,064 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 25652 transitions. [2025-03-16 20:29:21,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 25652 transitions. [2025-03-16 20:29:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:29:21,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:21,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:21,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:29:21,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -861645504, now seen corresponding path program 1 times [2025-03-16 20:29:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207340174] [2025-03-16 20:29:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:21,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:29:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:29:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207340174] [2025-03-16 20:29:21,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207340174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:21,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405575745] [2025-03-16 20:29:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:21,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:21,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:21,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:21,138 INFO L87 Difference]: Start difference. First operand 17480 states and 25652 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:21,324 INFO L93 Difference]: Finished difference Result 28767 states and 42042 transitions. [2025-03-16 20:29:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 20:29:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:21,344 INFO L225 Difference]: With dead ends: 28767 [2025-03-16 20:29:21,344 INFO L226 Difference]: Without dead ends: 12829 [2025-03-16 20:29:21,357 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:29:21,357 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 50 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3111 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:29:21,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-03-16 20:29:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12827. [2025-03-16 20:29:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 12825 states have (on average 1.486393762183236) internal successors, (19063), 12826 states have internal predecessors, (19063), 0 states have call successors, (0), 0 states 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:29:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 19063 transitions. [2025-03-16 20:29:21,557 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 19063 transitions. Word has length 75 [2025-03-16 20:29:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:21,557 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 19063 transitions. [2025-03-16 20:29:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 19063 transitions. [2025-03-16 20:29:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:29:21,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:21,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:21,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:29:21,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1413397794, now seen corresponding path program 1 times [2025-03-16 20:29:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026678167] [2025-03-16 20:29:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:21,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:29:21,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:29:21,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:21,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:29:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026678167] [2025-03-16 20:29:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026678167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:21,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:29:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775225341] [2025-03-16 20:29:21,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:29:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:21,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:29:21,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:29:21,663 INFO L87 Difference]: Start difference. First operand 12827 states and 19063 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:21,988 INFO L93 Difference]: Finished difference Result 23079 states and 33949 transitions. [2025-03-16 20:29:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:29:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 20:29:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:22,011 INFO L225 Difference]: With dead ends: 23079 [2025-03-16 20:29:22,012 INFO L226 Difference]: Without dead ends: 21029 [2025-03-16 20:29:22,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:29:22,019 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6371 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:22,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 3622 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:29:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2025-03-16 20:29:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 14875. [2025-03-16 20:29:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 14873 states have (on average 1.4796611309083574) internal successors, (22007), 14874 states have internal predecessors, (22007), 0 states have call successors, (0), 0 states 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:29:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 22007 transitions. [2025-03-16 20:29:22,293 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 22007 transitions. Word has length 75 [2025-03-16 20:29:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 14875 states and 22007 transitions. [2025-03-16 20:29:22,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 22007 transitions. [2025-03-16 20:29:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:29:22,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:22,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:29:22,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 936423678, now seen corresponding path program 1 times [2025-03-16 20:29:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985581365] [2025-03-16 20:29:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:22,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:29:22,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:29:22,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985581365] [2025-03-16 20:29:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985581365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215027225] [2025-03-16 20:29:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:22,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:22,367 INFO L87 Difference]: Start difference. First operand 14875 states and 22007 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:22,511 INFO L93 Difference]: Finished difference Result 21535 states and 31577 transitions. [2025-03-16 20:29:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:22,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:29:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:22,524 INFO L225 Difference]: With dead ends: 21535 [2025-03-16 20:29:22,524 INFO L226 Difference]: Without dead ends: 8221 [2025-03-16 20:29:22,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:22,533 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 45 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3096 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:29:22,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3096 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2025-03-16 20:29:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8219. [2025-03-16 20:29:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.5011561397103566) internal successors, (12335), 8218 states have internal predecessors, (12335), 0 states have call successors, (0), 0 states 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:29:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 12335 transitions. [2025-03-16 20:29:22,736 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 12335 transitions. Word has length 76 [2025-03-16 20:29:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:22,737 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 12335 transitions. [2025-03-16 20:29:22,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 12335 transitions. [2025-03-16 20:29:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:29:22,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:22,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:22,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:29:22,738 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:22,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1884587529, now seen corresponding path program 1 times [2025-03-16 20:29:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241187740] [2025-03-16 20:29:22,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:22,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:29:22,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:29:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241187740] [2025-03-16 20:29:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241187740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88344720] [2025-03-16 20:29:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:22,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:22,823 INFO L87 Difference]: Start difference. First operand 8219 states and 12335 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:22,912 INFO L93 Difference]: Finished difference Result 11551 states and 17069 transitions. [2025-03-16 20:29:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:22,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:29:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:22,920 INFO L225 Difference]: With dead ends: 11551 [2025-03-16 20:29:22,921 INFO L226 Difference]: Without dead ends: 4893 [2025-03-16 20:29:22,926 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:29:22,926 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 42 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3081 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:29:22,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3081 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-16 20:29:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2025-03-16 20:29:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.5444876252812436) internal successors, (7551), 4890 states have internal predecessors, (7551), 0 states have call successors, (0), 0 states 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:29:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7551 transitions. [2025-03-16 20:29:23,039 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7551 transitions. Word has length 78 [2025-03-16 20:29:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:23,042 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7551 transitions. [2025-03-16 20:29:23,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7551 transitions. [2025-03-16 20:29:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 20:29:23,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:23,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:23,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:29:23,044 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1904802261, now seen corresponding path program 1 times [2025-03-16 20:29:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367461853] [2025-03-16 20:29:23,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:23,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 20:29:23,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 20:29:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367461853] [2025-03-16 20:29:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367461853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:23,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057595565] [2025-03-16 20:29:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:29:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:23,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:29:23,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:29:23,158 INFO L87 Difference]: Start difference. First operand 4891 states and 7551 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:26,724 INFO L93 Difference]: Finished difference Result 8656 states and 14557 transitions. [2025-03-16 20:29:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:29:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 20:29:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:26,733 INFO L225 Difference]: With dead ends: 8656 [2025-03-16 20:29:26,733 INFO L226 Difference]: Without dead ends: 7152 [2025-03-16 20:29:26,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:29:26,735 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 2504 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:26,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2504 Valid, 303 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 20:29:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7152 states. [2025-03-16 20:29:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7152 to 7144. [2025-03-16 20:29:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 7142 states have (on average 1.5114813777653318) internal successors, (10795), 7143 states have internal predecessors, (10795), 0 states have call successors, (0), 0 states 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:29:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 10795 transitions. [2025-03-16 20:29:26,824 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 10795 transitions. Word has length 79 [2025-03-16 20:29:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 10795 transitions. [2025-03-16 20:29:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 10795 transitions. [2025-03-16 20:29:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:29:26,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:26,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:26,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:29:26,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:26,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299760, now seen corresponding path program 1 times [2025-03-16 20:29:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:26,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908076033] [2025-03-16 20:29:26,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:29:26,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:29:26,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:26,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908076033] [2025-03-16 20:29:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908076033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527223740] [2025-03-16 20:29:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:26,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:26,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:26,890 INFO L87 Difference]: Start difference. First operand 7144 states and 10795 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:26,933 INFO L93 Difference]: Finished difference Result 8812 states and 13137 transitions. [2025-03-16 20:29:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 20:29:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:26,939 INFO L225 Difference]: With dead ends: 8812 [2025-03-16 20:29:26,939 INFO L226 Difference]: Without dead ends: 5482 [2025-03-16 20:29:26,942 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:29:26,943 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 39 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3066 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:29:26,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3066 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-16 20:29:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5480. [2025-03-16 20:29:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 5478 states have (on average 1.5387002555677254) internal successors, (8429), 5479 states have internal predecessors, (8429), 0 states have call successors, (0), 0 states 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:29:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8429 transitions. [2025-03-16 20:29:27,005 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8429 transitions. Word has length 80 [2025-03-16 20:29:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 5480 states and 8429 transitions. [2025-03-16 20:29:27,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8429 transitions. [2025-03-16 20:29:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:29:27,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:27,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:27,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:29:27,007 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:27,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -260930327, now seen corresponding path program 1 times [2025-03-16 20:29:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:27,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930592799] [2025-03-16 20:29:27,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:29:27,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:29:27,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930592799] [2025-03-16 20:29:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930592799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:29:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:29:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:29:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855868505] [2025-03-16 20:29:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:29:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:29:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:27,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:29:27,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:29:27,062 INFO L87 Difference]: Start difference. First operand 5480 states and 8429 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:27,093 INFO L93 Difference]: Finished difference Result 6316 states and 9588 transitions. [2025-03-16 20:29:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:29:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 20:29:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:27,100 INFO L225 Difference]: With dead ends: 6316 [2025-03-16 20:29:27,100 INFO L226 Difference]: Without dead ends: 4650 [2025-03-16 20:29:27,102 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:29:27,104 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 36 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3051 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:29:27,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3051 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:29:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2025-03-16 20:29:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4648. [2025-03-16 20:29:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4646 states have (on average 1.5624192854068015) internal successors, (7259), 4647 states have internal predecessors, (7259), 0 states have call successors, (0), 0 states 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:29:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 7259 transitions. [2025-03-16 20:29:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 7259 transitions. Word has length 82 [2025-03-16 20:29:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:27,153 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 7259 transitions. [2025-03-16 20:29:27,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 7259 transitions. [2025-03-16 20:29:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:29:27,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:27,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:27,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:29:27,155 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:27,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1013848350, now seen corresponding path program 1 times [2025-03-16 20:29:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565291973] [2025-03-16 20:29:27,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:27,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:29:27,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:29:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565291973] [2025-03-16 20:29:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565291973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927213583] [2025-03-16 20:29:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:27,941 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:29:27,942 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:29:28,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:29:28,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:29:28,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:28,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:28,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:29:28,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:28,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:28,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927213583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:28,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:29:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536772729] [2025-03-16 20:29:28,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:28,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:29:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:28,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:29:28,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:29:28,593 INFO L87 Difference]: Start difference. First operand 4648 states and 7259 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:31,561 INFO L93 Difference]: Finished difference Result 12518 states and 17892 transitions. [2025-03-16 20:29:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:29:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 20:29:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:31,575 INFO L225 Difference]: With dead ends: 12518 [2025-03-16 20:29:31,576 INFO L226 Difference]: Without dead ends: 11598 [2025-03-16 20:29:31,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1242, Invalid=6948, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:29:31,583 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 19678 mSDsluCounter, 8295 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19678 SdHoareTripleChecker+Valid, 9823 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:31,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19678 Valid, 9823 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 20:29:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11598 states. [2025-03-16 20:29:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 11040. [2025-03-16 20:29:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 11038 states have (on average 1.4248052183366553) internal successors, (15727), 11039 states have internal predecessors, (15727), 0 states have call successors, (0), 0 states 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:29:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 15727 transitions. [2025-03-16 20:29:31,804 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 15727 transitions. Word has length 84 [2025-03-16 20:29:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:31,805 INFO L471 AbstractCegarLoop]: Abstraction has 11040 states and 15727 transitions. [2025-03-16 20:29:31,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 15727 transitions. [2025-03-16 20:29:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:29:31,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:31,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:31,813 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:29:32,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 20:29:32,007 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1253413577, now seen corresponding path program 1 times [2025-03-16 20:29:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887001856] [2025-03-16 20:29:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:32,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:32,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:32,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:32,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887001856] [2025-03-16 20:29:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887001856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078973611] [2025-03-16 20:29:32,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:32,280 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:29:32,281 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:29:32,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:29:32,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:29:32,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:32,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:32,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:29:32,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:33,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078973611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:34,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:34,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 32 [2025-03-16 20:29:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049037919] [2025-03-16 20:29:34,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:34,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:29:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:34,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:29:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:29:34,403 INFO L87 Difference]: Start difference. First operand 11040 states and 15727 transitions. Second operand has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:29:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:38,188 INFO L93 Difference]: Finished difference Result 46472 states and 62864 transitions. [2025-03-16 20:29:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-16 20:29:38,189 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 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 85 [2025-03-16 20:29:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:38,231 INFO L225 Difference]: With dead ends: 46472 [2025-03-16 20:29:38,231 INFO L226 Difference]: Without dead ends: 39324 [2025-03-16 20:29:38,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1457, Invalid=5853, Unknown=0, NotChecked=0, Total=7310 [2025-03-16 20:29:38,242 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 22964 mSDsluCounter, 9689 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22964 SdHoareTripleChecker+Valid, 11191 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:38,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22964 Valid, 11191 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:29:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39324 states. [2025-03-16 20:29:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39324 to 39186. [2025-03-16 20:29:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39186 states, 39184 states have (on average 1.3319211923233973) internal successors, (52190), 39185 states have internal predecessors, (52190), 0 states have call successors, (0), 0 states 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:29:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39186 states to 39186 states and 52190 transitions. [2025-03-16 20:29:39,242 INFO L78 Accepts]: Start accepts. Automaton has 39186 states and 52190 transitions. Word has length 85 [2025-03-16 20:29:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 39186 states and 52190 transitions. [2025-03-16 20:29:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 32 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:29:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39186 states and 52190 transitions. [2025-03-16 20:29:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:29:39,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:39,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:39,252 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:29:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 20:29:39,445 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -867561235, now seen corresponding path program 1 times [2025-03-16 20:29:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432606172] [2025-03-16 20:29:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:29:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:29:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432606172] [2025-03-16 20:29:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432606172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108609866] [2025-03-16 20:29:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:40,116 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:29:40,119 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:29:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:29:40,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:29:40,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:40,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:40,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:29:40,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:40,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108609866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:40,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:29:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883564881] [2025-03-16 20:29:40,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:40,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:29:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:40,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:29:40,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:29:40,945 INFO L87 Difference]: Start difference. First operand 39186 states and 52190 transitions. Second operand has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:29:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:44,254 INFO L93 Difference]: Finished difference Result 122606 states and 160643 transitions. [2025-03-16 20:29:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 20:29:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:29:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:44,345 INFO L225 Difference]: With dead ends: 122606 [2025-03-16 20:29:44,345 INFO L226 Difference]: Without dead ends: 90790 [2025-03-16 20:29:44,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=3087, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:29:44,370 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 20818 mSDsluCounter, 9471 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20818 SdHoareTripleChecker+Valid, 10989 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:44,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20818 Valid, 10989 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:29:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90790 states. [2025-03-16 20:29:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90790 to 75946. [2025-03-16 20:29:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75946 states, 75944 states have (on average 1.3041451595912779) internal successors, (99042), 75945 states have internal predecessors, (99042), 0 states have call successors, (0), 0 states 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:29:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75946 states to 75946 states and 99042 transitions. [2025-03-16 20:29:46,633 INFO L78 Accepts]: Start accepts. Automaton has 75946 states and 99042 transitions. Word has length 86 [2025-03-16 20:29:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:46,634 INFO L471 AbstractCegarLoop]: Abstraction has 75946 states and 99042 transitions. [2025-03-16 20:29:46,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.214285714285714) internal successors, (230), 27 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:29:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 75946 states and 99042 transitions. [2025-03-16 20:29:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:29:46,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:46,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:29:46,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:29:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:46,836 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 403796273, now seen corresponding path program 1 times [2025-03-16 20:29:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572901451] [2025-03-16 20:29:46,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:29:46,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:29:46,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:46,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572901451] [2025-03-16 20:29:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572901451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527636768] [2025-03-16 20:29:47,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:47,143 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:29:47,145 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:29:47,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:29:47,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:29:47,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:47,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:47,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-16 20:29:47,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:55,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:30:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527636768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:30:00,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:30:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 23] total 53 [2025-03-16 20:30:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063295714] [2025-03-16 20:30:00,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:30:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:30:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:30:00,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2306, Unknown=1, NotChecked=0, Total=2756 [2025-03-16 20:30:00,154 INFO L87 Difference]: Start difference. First operand 75946 states and 99042 transitions. Second operand has 53 states, 53 states have (on average 4.60377358490566) internal successors, (244), 53 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:05,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:30:09,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:30:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:30:17,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:30:24,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]