./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.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 f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:21:08,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:21:08,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:21:08,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:21:08,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:21:08,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:21:08,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:21:08,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:21:08,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:21:08,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:21:08,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:21:08,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:21:08,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:21:08,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:21:08,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:21:08,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:21:08,387 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 -> f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 [2025-03-16 20:21:08,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:21:08,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:21:08,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:21:08,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:21:08,624 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:21:08,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:21:09,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db845bbab/1898f9b3554044bfa5f133ecedd927e3/FLAG85ebf219d [2025-03-16 20:21:10,228 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:21:10,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:21:10,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db845bbab/1898f9b3554044bfa5f133ecedd927e3/FLAG85ebf219d [2025-03-16 20:21:10,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db845bbab/1898f9b3554044bfa5f133ecedd927e3 [2025-03-16 20:21:10,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:21:10,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:21:10,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:21:10,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:21:10,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:21:10,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:21:10" (1/1) ... [2025-03-16 20:21:10,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad97406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:10, skipping insertion in model container [2025-03-16 20:21:10,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:21:10" (1/1) ... [2025-03-16 20:21:10,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:21:10,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2025-03-16 20:21:10,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2025-03-16 20:21:11,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:21:11,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:21:11,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2025-03-16 20:21:11,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2025-03-16 20:21:11,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:21:11,392 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:21:11,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11 WrapperNode [2025-03-16 20:21:11,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:21:11,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:21:11,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:21:11,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:21:11,399 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:21:11" (1/1) ... [2025-03-16 20:21:11,442 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:21:11" (1/1) ... [2025-03-16 20:21:11,648 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-03-16 20:21:11,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:21:11,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:21:11,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:21:11,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:21:11,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:11,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:11,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:11,869 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:21:11,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:11,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:21:12,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:21:12,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:21:12,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:21:12,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (1/1) ... [2025-03-16 20:21:12,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:21:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:12,117 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:21:12,121 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:21:12,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:21:12,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:21:12,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:21:12,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:21:12,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:21:12,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:21:15,441 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-03-16 20:21:15,441 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-03-16 20:21:15,441 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-03-16 20:21:15,544 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-03-16 20:21:15,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:21:15,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:21:15,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:21:15,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:21:15 BoogieIcfgContainer [2025-03-16 20:21:15,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:21:15,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:21:15,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:21:15,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:21:15,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:21:10" (1/3) ... [2025-03-16 20:21:15,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c2795e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:21:15, skipping insertion in model container [2025-03-16 20:21:15,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:11" (2/3) ... [2025-03-16 20:21:15,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c2795e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:21:15, skipping insertion in model container [2025-03-16 20:21:15,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:21:15" (3/3) ... [2025-03-16 20:21:15,582 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:21:15,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:21:15,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 809 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:21:15,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:21:15,671 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;@2eb292f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:21:15,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:21:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:21:15,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:15,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:15,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 25766248, now seen corresponding path program 1 times [2025-03-16 20:21:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756620727] [2025-03-16 20:21:15,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:15,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:21:15,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:21:15,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:15,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:15,874 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:21:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756620727] [2025-03-16 20:21:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756620727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:15,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:21:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439404211] [2025-03-16 20:21:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:15,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:21:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:15,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:21:15,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:21:15,899 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:15,960 INFO L93 Difference]: Finished difference Result 1598 states and 3148 transitions. [2025-03-16 20:21:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:21:15,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 20:21:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:15,973 INFO L225 Difference]: With dead ends: 1598 [2025-03-16 20:21:15,973 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:21:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:21:15,980 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:15,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:21:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:21:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2025-03-16 20:21:16,034 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2025-03-16 20:21:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:16,035 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2025-03-16 20:21:16,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2025-03-16 20:21:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:21:16,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:16,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:21:16,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -267636759, now seen corresponding path program 1 times [2025-03-16 20:21:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682202363] [2025-03-16 20:21:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:16,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:21:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:21:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:16,207 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:21:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682202363] [2025-03-16 20:21:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682202363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:21:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836182432] [2025-03-16 20:21:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:21:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:16,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:21:16,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:21:16,209 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:16,264 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2025-03-16 20:21:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:21:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 20:21:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:16,268 INFO L225 Difference]: With dead ends: 839 [2025-03-16 20:21:16,268 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:21:16,268 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:21:16,269 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:16,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4549 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:21:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:21:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2025-03-16 20:21:16,286 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2025-03-16 20:21:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2025-03-16 20:21:16,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2025-03-16 20:21:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:21:16,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:16,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:16,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:21:16,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2091397431, now seen corresponding path program 1 times [2025-03-16 20:21:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237485229] [2025-03-16 20:21:16,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:16,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:21:16,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:21:16,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:16,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:16,396 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:21:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237485229] [2025-03-16 20:21:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237485229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:16,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176211438] [2025-03-16 20:21:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:16,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:16,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:16,399 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:16,493 INFO L93 Difference]: Finished difference Result 991 states and 1802 transitions. [2025-03-16 20:21:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:21:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 20:21:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:16,499 INFO L225 Difference]: With dead ends: 991 [2025-03-16 20:21:16,499 INFO L226 Difference]: Without dead ends: 960 [2025-03-16 20:21:16,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:21:16,501 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 4632 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:16,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 1780 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-16 20:21:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 834. [2025-03-16 20:21:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8677884615384615) internal successors, (1554), 833 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1554 transitions. [2025-03-16 20:21:16,518 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1554 transitions. Word has length 32 [2025-03-16 20:21:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:16,518 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1554 transitions. [2025-03-16 20:21:16,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1554 transitions. [2025-03-16 20:21:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:21:16,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:16,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:21:16,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 248945547, now seen corresponding path program 1 times [2025-03-16 20:21:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505972091] [2025-03-16 20:21:16,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:21:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:21:16,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:16,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:16,674 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:21:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505972091] [2025-03-16 20:21:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505972091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739334222] [2025-03-16 20:21:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:16,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:16,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:16,676 INFO L87 Difference]: Start difference. First operand 834 states and 1554 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:16,734 INFO L93 Difference]: Finished difference Result 896 states and 1650 transitions. [2025-03-16 20:21:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 20:21:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:16,738 INFO L225 Difference]: With dead ends: 896 [2025-03-16 20:21:16,738 INFO L226 Difference]: Without dead ends: 836 [2025-03-16 20:21:16,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:21:16,740 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 4420 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:16,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 1593 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-16 20:21:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 834. [2025-03-16 20:21:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8665865384615385) internal successors, (1553), 833 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1553 transitions. [2025-03-16 20:21:16,764 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1553 transitions. Word has length 34 [2025-03-16 20:21:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:16,765 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1553 transitions. [2025-03-16 20:21:16,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1553 transitions. [2025-03-16 20:21:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:21:16,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:16,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:21:16,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:16,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash 247902862, now seen corresponding path program 1 times [2025-03-16 20:21:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:16,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745359354] [2025-03-16 20:21:16,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:16,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:21:16,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:21:16,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:16,905 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:21:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745359354] [2025-03-16 20:21:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745359354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373486212] [2025-03-16 20:21:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:16,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:16,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:16,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:16,908 INFO L87 Difference]: Start difference. First operand 834 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:16,934 INFO L93 Difference]: Finished difference Result 943 states and 1722 transitions. [2025-03-16 20:21:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 20:21:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:16,937 INFO L225 Difference]: With dead ends: 943 [2025-03-16 20:21:16,937 INFO L226 Difference]: Without dead ends: 883 [2025-03-16 20:21:16,938 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:21:16,939 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1546 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:21:16,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1546 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-16 20:21:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2025-03-16 20:21:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-03-16 20:21:16,958 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 34 [2025-03-16 20:21:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:16,959 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-03-16 20:21:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-03-16 20:21:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:21:16,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:16,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:16,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:21:16,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -871637575, now seen corresponding path program 1 times [2025-03-16 20:21:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:16,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773076347] [2025-03-16 20:21:16,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:16,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:21:16,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:21:16,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,174 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:21:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773076347] [2025-03-16 20:21:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773076347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:21:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33895337] [2025-03-16 20:21:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:21:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:21:17,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:21:17,176 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:17,223 INFO L93 Difference]: Finished difference Result 885 states and 1627 transitions. [2025-03-16 20:21:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:21:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 20:21:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:17,228 INFO L225 Difference]: With dead ends: 885 [2025-03-16 20:21:17,228 INFO L226 Difference]: Without dead ends: 883 [2025-03-16 20:21:17,228 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:21:17,229 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 6005 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7509 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:21:17,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7509 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-16 20:21:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-16 20:21:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8422247446083995) internal successors, (1623), 882 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1623 transitions. [2025-03-16 20:21:17,249 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1623 transitions. Word has length 35 [2025-03-16 20:21:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:17,250 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1623 transitions. [2025-03-16 20:21:17,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1623 transitions. [2025-03-16 20:21:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:21:17,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:17,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:17,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:21:17,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:17,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 318841389, now seen corresponding path program 1 times [2025-03-16 20:21:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591091766] [2025-03-16 20:21:17,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:17,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:21:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:21:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,296 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:21:17,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591091766] [2025-03-16 20:21:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591091766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427863549] [2025-03-16 20:21:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:17,297 INFO L87 Difference]: Start difference. First operand 883 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:17,319 INFO L93 Difference]: Finished difference Result 1085 states and 1923 transitions. [2025-03-16 20:21:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:17,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 20:21:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:17,323 INFO L225 Difference]: With dead ends: 1085 [2025-03-16 20:21:17,323 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 20:21:17,323 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:21:17,324 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 1475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1588 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:21:17,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 20:21:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2025-03-16 20:21:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 972 states have (on average 1.8045267489711934) internal successors, (1754), 973 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1754 transitions. [2025-03-16 20:21:17,349 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1754 transitions. Word has length 36 [2025-03-16 20:21:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:17,349 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1754 transitions. [2025-03-16 20:21:17,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1754 transitions. [2025-03-16 20:21:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:21:17,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:17,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:17,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:21:17,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:17,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -230947539, now seen corresponding path program 1 times [2025-03-16 20:21:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605188080] [2025-03-16 20:21:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:17,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:21:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:21:17,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,392 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:21:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605188080] [2025-03-16 20:21:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605188080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933130428] [2025-03-16 20:21:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:17,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:17,394 INFO L87 Difference]: Start difference. First operand 974 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:17,417 INFO L93 Difference]: Finished difference Result 1342 states and 2288 transitions. [2025-03-16 20:21:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 20:21:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:17,421 INFO L225 Difference]: With dead ends: 1342 [2025-03-16 20:21:17,422 INFO L226 Difference]: Without dead ends: 1142 [2025-03-16 20:21:17,422 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:21:17,423 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 1473 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1590 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:21:17,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1590 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-16 20:21:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2025-03-16 20:21:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1138 states have (on average 1.7434094903339192) internal successors, (1984), 1139 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1984 transitions. [2025-03-16 20:21:17,449 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1984 transitions. Word has length 36 [2025-03-16 20:21:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1984 transitions. [2025-03-16 20:21:17,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1984 transitions. [2025-03-16 20:21:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 20:21:17,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:17,450 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] [2025-03-16 20:21:17,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:21:17,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2049598067, now seen corresponding path program 1 times [2025-03-16 20:21:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493872929] [2025-03-16 20:21:17,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 20:21:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 20:21:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,498 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:21:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493872929] [2025-03-16 20:21:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493872929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068272537] [2025-03-16 20:21:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:17,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:17,499 INFO L87 Difference]: Start difference. First operand 1140 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:17,519 INFO L93 Difference]: Finished difference Result 1531 states and 2558 transitions. [2025-03-16 20:21:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:17,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-16 20:21:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:17,523 INFO L225 Difference]: With dead ends: 1531 [2025-03-16 20:21:17,523 INFO L226 Difference]: Without dead ends: 1312 [2025-03-16 20:21:17,523 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:21:17,524 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1474 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1589 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:21:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1589 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-16 20:21:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2025-03-16 20:21:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1308 states have (on average 1.698776758409786) internal successors, (2222), 1309 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2222 transitions. [2025-03-16 20:21:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2222 transitions. Word has length 38 [2025-03-16 20:21:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2222 transitions. [2025-03-16 20:21:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2222 transitions. [2025-03-16 20:21:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:17,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:17,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:17,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:21:17,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 981101146, now seen corresponding path program 1 times [2025-03-16 20:21:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850332148] [2025-03-16 20:21:17,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:17,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:17,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:17,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:21:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850332148] [2025-03-16 20:21:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850332148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520128111] [2025-03-16 20:21:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:17,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:17,635 INFO L87 Difference]: Start difference. First operand 1310 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:17,708 INFO L93 Difference]: Finished difference Result 3034 states and 4670 transitions. [2025-03-16 20:21:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 20:21:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:17,715 INFO L225 Difference]: With dead ends: 3034 [2025-03-16 20:21:17,716 INFO L226 Difference]: Without dead ends: 2500 [2025-03-16 20:21:17,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:17,717 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3044 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:17,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 3162 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-03-16 20:21:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1842. [2025-03-16 20:21:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1840 states have (on average 1.6141304347826086) internal successors, (2970), 1841 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2970 transitions. [2025-03-16 20:21:17,754 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2970 transitions. Word has length 50 [2025-03-16 20:21:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2970 transitions. [2025-03-16 20:21:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2970 transitions. [2025-03-16 20:21:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:17,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:17,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:21:17,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 431312218, now seen corresponding path program 1 times [2025-03-16 20:21:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795784233] [2025-03-16 20:21:17,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:17,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:17,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:21:17,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795784233] [2025-03-16 20:21:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795784233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713726209] [2025-03-16 20:21:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:17,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:17,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:17,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:17,903 INFO L87 Difference]: Start difference. First operand 1842 states and 2970 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:18,017 INFO L93 Difference]: Finished difference Result 3566 states and 5418 transitions. [2025-03-16 20:21:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 20:21:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:18,035 INFO L225 Difference]: With dead ends: 3566 [2025-03-16 20:21:18,049 INFO L226 Difference]: Without dead ends: 3032 [2025-03-16 20:21:18,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:18,051 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3053 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:18,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 3139 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2025-03-16 20:21:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2642. [2025-03-16 20:21:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2640 states have (on average 1.5462121212121211) internal successors, (4082), 2641 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 4082 transitions. [2025-03-16 20:21:18,163 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 4082 transitions. Word has length 50 [2025-03-16 20:21:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:18,163 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 4082 transitions. [2025-03-16 20:21:18,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 4082 transitions. [2025-03-16 20:21:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:18,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:18,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:21:18,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2017421604, now seen corresponding path program 1 times [2025-03-16 20:21:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413634440] [2025-03-16 20:21:18,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:18,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413634440] [2025-03-16 20:21:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413634440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:18,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132994187] [2025-03-16 20:21:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:18,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:18,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:18,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:18,235 INFO L87 Difference]: Start difference. First operand 2642 states and 4082 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:18,267 INFO L93 Difference]: Finished difference Result 4005 states and 6032 transitions. [2025-03-16 20:21:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 20:21:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:18,273 INFO L225 Difference]: With dead ends: 4005 [2025-03-16 20:21:18,273 INFO L226 Difference]: Without dead ends: 2139 [2025-03-16 20:21:18,275 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:21:18,276 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 34 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3025 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:21:18,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-16 20:21:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2025-03-16 20:21:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2135 states have (on average 1.5836065573770493) internal successors, (3381), 2136 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3381 transitions. [2025-03-16 20:21:18,313 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3381 transitions. Word has length 52 [2025-03-16 20:21:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:18,314 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3381 transitions. [2025-03-16 20:21:18,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3381 transitions. [2025-03-16 20:21:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:18,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:18,314 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] [2025-03-16 20:21:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:21:18,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1273131398, now seen corresponding path program 1 times [2025-03-16 20:21:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647996967] [2025-03-16 20:21:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:18,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:18,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:18,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:18,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:18,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647996967] [2025-03-16 20:21:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647996967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766908917] [2025-03-16 20:21:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:18,378 INFO L87 Difference]: Start difference. First operand 2137 states and 3381 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:21:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:18,445 INFO L93 Difference]: Finished difference Result 3297 states and 5041 transitions. [2025-03-16 20:21:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:18,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 52 [2025-03-16 20:21:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:18,453 INFO L225 Difference]: With dead ends: 3297 [2025-03-16 20:21:18,454 INFO L226 Difference]: Without dead ends: 2911 [2025-03-16 20:21:18,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:21:18,455 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3045 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:18,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3164 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-03-16 20:21:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2521. [2025-03-16 20:21:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2519 states have (on average 1.5581579992060341) internal successors, (3925), 2520 states have internal predecessors, (3925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3925 transitions. [2025-03-16 20:21:18,500 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3925 transitions. Word has length 52 [2025-03-16 20:21:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:18,500 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3925 transitions. [2025-03-16 20:21:18,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:21:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3925 transitions. [2025-03-16 20:21:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:21:18,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:18,501 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] [2025-03-16 20:21:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:21:18,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 974834018, now seen corresponding path program 1 times [2025-03-16 20:21:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329470621] [2025-03-16 20:21:18,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:21:18,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:21:18,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:18,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:18,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329470621] [2025-03-16 20:21:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329470621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427463349] [2025-03-16 20:21:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:18,592 INFO L87 Difference]: Start difference. First operand 2521 states and 3925 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:21:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:18,626 INFO L93 Difference]: Finished difference Result 3389 states and 5151 transitions. [2025-03-16 20:21:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:18,626 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:21:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:18,631 INFO L225 Difference]: With dead ends: 3389 [2025-03-16 20:21:18,631 INFO L226 Difference]: Without dead ends: 1659 [2025-03-16 20:21:18,632 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:21:18,632 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 29 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3010 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:21:18,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-16 20:21:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2025-03-16 20:21:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 1.6211480362537765) internal successors, (2683), 1656 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2683 transitions. [2025-03-16 20:21:18,660 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2683 transitions. Word has length 53 [2025-03-16 20:21:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:18,660 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2683 transitions. [2025-03-16 20:21:18,660 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:21:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2683 transitions. [2025-03-16 20:21:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:21:18,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:18,661 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] [2025-03-16 20:21:18,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:21:18,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -918465573, now seen corresponding path program 1 times [2025-03-16 20:21:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263068021] [2025-03-16 20:21:18,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:18,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:21:18,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:21:18,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:18,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263068021] [2025-03-16 20:21:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263068021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:18,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567251657] [2025-03-16 20:21:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:18,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:18,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:18,716 INFO L87 Difference]: Start difference. First operand 1657 states and 2683 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:21:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:18,734 INFO L93 Difference]: Finished difference Result 2093 states and 3288 transitions. [2025-03-16 20:21:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:18,734 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:21:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:18,738 INFO L225 Difference]: With dead ends: 2093 [2025-03-16 20:21:18,738 INFO L226 Difference]: Without dead ends: 1227 [2025-03-16 20:21:18,739 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:21:18,739 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 26 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2995 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:21:18,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2995 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-16 20:21:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1225. [2025-03-16 20:21:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1223 states have (on average 1.6933769419460343) internal successors, (2071), 1224 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2071 transitions. [2025-03-16 20:21:18,757 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2071 transitions. Word has length 55 [2025-03-16 20:21:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:18,757 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 2071 transitions. [2025-03-16 20:21:18,757 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:21:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2071 transitions. [2025-03-16 20:21:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:21:18,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:18,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:21:18,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1545027244, now seen corresponding path program 1 times [2025-03-16 20:21:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209860582] [2025-03-16 20:21:18,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:18,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:18,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:18,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:19,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209860582] [2025-03-16 20:21:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209860582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398634256] [2025-03-16 20:21:19,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:19,572 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:21:19,577 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:21:19,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:19,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:19,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:19,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 20:21:19,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:19,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:21:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398634256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:20,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 20:21:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643635312] [2025-03-16 20:21:20,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:20,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:21:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:20,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:21:20,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:21:20,024 INFO L87 Difference]: Start difference. First operand 1225 states and 2071 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:21,371 INFO L93 Difference]: Finished difference Result 3490 states and 5109 transitions. [2025-03-16 20:21:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 20:21:21,372 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 20:21:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:21,380 INFO L225 Difference]: With dead ends: 3490 [2025-03-16 20:21:21,381 INFO L226 Difference]: Without dead ends: 3056 [2025-03-16 20:21:21,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=538, Invalid=2324, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:21:21,382 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 14438 mSDsluCounter, 6190 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14438 SdHoareTripleChecker+Valid, 7685 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:21,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14438 Valid, 7685 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:21:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2025-03-16 20:21:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 3022. [2025-03-16 20:21:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 3020 states have (on average 1.429139072847682) internal successors, (4316), 3021 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4316 transitions. [2025-03-16 20:21:21,440 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4316 transitions. Word has length 57 [2025-03-16 20:21:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:21,440 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4316 transitions. [2025-03-16 20:21:21,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4316 transitions. [2025-03-16 20:21:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:21,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:21,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:21,449 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:21:21,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:21:21,643 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1981655035, now seen corresponding path program 1 times [2025-03-16 20:21:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893576318] [2025-03-16 20:21:21,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:21,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:21,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893576318] [2025-03-16 20:21:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893576318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027308520] [2025-03-16 20:21:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:21,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:21,890 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:21:21,892 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:21:21,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:21,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:21,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:21:21,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:22,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027308520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:22,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:21:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92156645] [2025-03-16 20:21:22,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:22,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:21:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:22,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:21:22,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:21:22,828 INFO L87 Difference]: Start difference. First operand 3022 states and 4316 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:23,133 INFO L93 Difference]: Finished difference Result 5042 states and 6896 transitions. [2025-03-16 20:21:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:21:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:23,141 INFO L225 Difference]: With dead ends: 5042 [2025-03-16 20:21:23,142 INFO L226 Difference]: Without dead ends: 3128 [2025-03-16 20:21:23,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:21:23,145 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 18090 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18090 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:23,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18090 Valid, 4557 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-03-16 20:21:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2820. [2025-03-16 20:21:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2818 states have (on average 1.4308019872249822) internal successors, (4032), 2819 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4032 transitions. [2025-03-16 20:21:23,205 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4032 transitions. Word has length 58 [2025-03-16 20:21:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:23,206 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4032 transitions. [2025-03-16 20:21:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4032 transitions. [2025-03-16 20:21:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:23,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:23,207 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:23,233 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:21:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 20:21:23,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:23,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1640377797, now seen corresponding path program 1 times [2025-03-16 20:21:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071204764] [2025-03-16 20:21:23,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:23,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:23,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071204764] [2025-03-16 20:21:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071204764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142561682] [2025-03-16 20:21:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:23,628 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:21:23,630 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:21:23,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:23,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:23,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:23,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:23,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:21:23,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:24,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142561682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:24,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2025-03-16 20:21:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071815944] [2025-03-16 20:21:24,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:24,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:21:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:24,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:21:24,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:21:24,617 INFO L87 Difference]: Start difference. First operand 2820 states and 4032 transitions. Second operand has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:25,052 INFO L93 Difference]: Finished difference Result 6519 states and 8739 transitions. [2025-03-16 20:21:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 20:21:25,052 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:25,059 INFO L225 Difference]: With dead ends: 6519 [2025-03-16 20:21:25,059 INFO L226 Difference]: Without dead ends: 4850 [2025-03-16 20:21:25,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=362, Invalid=1198, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 20:21:25,061 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 12053 mSDsluCounter, 7669 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12053 SdHoareTripleChecker+Valid, 9161 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:25,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12053 Valid, 9161 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:21:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2025-03-16 20:21:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4784. [2025-03-16 20:21:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4782 states have (on average 1.3467168548724384) internal successors, (6440), 4783 states have internal predecessors, (6440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6440 transitions. [2025-03-16 20:21:25,138 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6440 transitions. Word has length 58 [2025-03-16 20:21:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 6440 transitions. [2025-03-16 20:21:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6440 transitions. [2025-03-16 20:21:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:25,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:25,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:25,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:21:25,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:21:25,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:25,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1084050555, now seen corresponding path program 1 times [2025-03-16 20:21:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285450174] [2025-03-16 20:21:25,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285450174] [2025-03-16 20:21:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285450174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241817848] [2025-03-16 20:21:25,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:25,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:25,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:21:25,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:25,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:25,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:21:25,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:25,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241817848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:26,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:21:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109302823] [2025-03-16 20:21:26,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:26,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:21:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:26,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:21:26,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:21:26,452 INFO L87 Difference]: Start difference. First operand 4784 states and 6440 transitions. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:26,873 INFO L93 Difference]: Finished difference Result 11627 states and 14956 transitions. [2025-03-16 20:21:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:21:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:26,885 INFO L225 Difference]: With dead ends: 11627 [2025-03-16 20:21:26,885 INFO L226 Difference]: Without dead ends: 8217 [2025-03-16 20:21:26,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:21:26,888 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 13476 mSDsluCounter, 4708 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13476 SdHoareTripleChecker+Valid, 6202 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:26,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13476 Valid, 6202 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2025-03-16 20:21:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8213. [2025-03-16 20:21:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8213 states, 8211 states have (on average 1.2952137376689807) internal successors, (10635), 8212 states have internal predecessors, (10635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8213 states to 8213 states and 10635 transitions. [2025-03-16 20:21:27,048 INFO L78 Accepts]: Start accepts. Automaton has 8213 states and 10635 transitions. Word has length 58 [2025-03-16 20:21:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:27,048 INFO L471 AbstractCegarLoop]: Abstraction has 8213 states and 10635 transitions. [2025-03-16 20:21:27,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8213 states and 10635 transitions. [2025-03-16 20:21:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:21:27,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:27,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:27,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:27,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:27,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:27,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash -114590151, now seen corresponding path program 1 times [2025-03-16 20:21:27,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119022289] [2025-03-16 20:21:27,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:27,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:27,364 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:21:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119022289] [2025-03-16 20:21:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119022289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260579466] [2025-03-16 20:21:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:27,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:21:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:27,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:21:27,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:21:27,366 INFO L87 Difference]: Start difference. First operand 8213 states and 10635 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:31,714 INFO L93 Difference]: Finished difference Result 10468 states and 14944 transitions. [2025-03-16 20:21:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:21:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:21:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:31,727 INFO L225 Difference]: With dead ends: 10468 [2025-03-16 20:21:31,727 INFO L226 Difference]: Without dead ends: 9715 [2025-03-16 20:21:31,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:31,729 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2320 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:31,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 780 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 20:21:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9715 states. [2025-03-16 20:21:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9715 to 9715. [2025-03-16 20:21:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9715 states, 9713 states have (on average 1.313806239061052) internal successors, (12761), 9714 states have internal predecessors, (12761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9715 states to 9715 states and 12761 transitions. [2025-03-16 20:21:32,008 INFO L78 Accepts]: Start accepts. Automaton has 9715 states and 12761 transitions. Word has length 59 [2025-03-16 20:21:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:32,008 INFO L471 AbstractCegarLoop]: Abstraction has 9715 states and 12761 transitions. [2025-03-16 20:21:32,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9715 states and 12761 transitions. [2025-03-16 20:21:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:21:32,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:32,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:32,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:21:32,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 542733369, now seen corresponding path program 1 times [2025-03-16 20:21:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103847247] [2025-03-16 20:21:32,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:32,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103847247] [2025-03-16 20:21:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103847247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234877160] [2025-03-16 20:21:32,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:32,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:32,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:32,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:21:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:21:32,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:21:32,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:32,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:32,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 20:21:32,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:33,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:33,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234877160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:33,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:33,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2025-03-16 20:21:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042088214] [2025-03-16 20:21:33,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:21:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:33,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:21:33,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:21:33,803 INFO L87 Difference]: Start difference. First operand 9715 states and 12761 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:36,835 INFO L93 Difference]: Finished difference Result 14841 states and 19180 transitions. [2025-03-16 20:21:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-16 20:21:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:21:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:36,850 INFO L225 Difference]: With dead ends: 14841 [2025-03-16 20:21:36,850 INFO L226 Difference]: Without dead ends: 10073 [2025-03-16 20:21:36,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1533, Invalid=6123, Unknown=0, NotChecked=0, Total=7656 [2025-03-16 20:21:36,857 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 10126 mSDsluCounter, 19947 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10126 SdHoareTripleChecker+Valid, 21462 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:36,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10126 Valid, 21462 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:21:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10073 states. [2025-03-16 20:21:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10073 to 7113. [2025-03-16 20:21:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7111 states have (on average 1.3407396990577978) internal successors, (9534), 7112 states have internal predecessors, (9534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9534 transitions. [2025-03-16 20:21:37,049 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9534 transitions. Word has length 59 [2025-03-16 20:21:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:37,049 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 9534 transitions. [2025-03-16 20:21:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9534 transitions. [2025-03-16 20:21:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:21:37,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:37,050 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] [2025-03-16 20:21:37,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:21:37,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:37,251 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 450905028, now seen corresponding path program 1 times [2025-03-16 20:21:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868564440] [2025-03-16 20:21:37,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:37,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:21:37,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:21:37,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868564440] [2025-03-16 20:21:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868564440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141237970] [2025-03-16 20:21:38,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:38,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:38,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:38,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:38,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:21:38,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:21:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:21:38,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:38,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:21:38,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:39,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141237970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:41,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:41,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 52 [2025-03-16 20:21:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993271453] [2025-03-16 20:21:41,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:41,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 20:21:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:41,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 20:21:41,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2378, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 20:21:41,305 INFO L87 Difference]: Start difference. First operand 7113 states and 9534 transitions. Second operand has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:51,998 INFO L93 Difference]: Finished difference Result 15982 states and 20532 transitions. [2025-03-16 20:21:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-16 20:21:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 20:21:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:52,014 INFO L225 Difference]: With dead ends: 15982 [2025-03-16 20:21:52,014 INFO L226 Difference]: Without dead ends: 13406 [2025-03-16 20:21:52,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3318, Invalid=14772, Unknown=0, NotChecked=0, Total=18090 [2025-03-16 20:21:52,023 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 23367 mSDsluCounter, 28808 mSDsCounter, 0 mSdLazyCounter, 3498 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23367 SdHoareTripleChecker+Valid, 30361 SdHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:52,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23367 Valid, 30361 Invalid, 3622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3498 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 20:21:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13406 states. [2025-03-16 20:21:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13406 to 7705. [2025-03-16 20:21:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7705 states, 7703 states have (on average 1.3367519148383746) internal successors, (10297), 7704 states have internal predecessors, (10297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7705 states to 7705 states and 10297 transitions. [2025-03-16 20:21:52,268 INFO L78 Accepts]: Start accepts. Automaton has 7705 states and 10297 transitions. Word has length 60 [2025-03-16 20:21:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 7705 states and 10297 transitions. [2025-03-16 20:21:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7705 states and 10297 transitions. [2025-03-16 20:21:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:21:52,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:52,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:52,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:21:52,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:52,470 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -639024222, now seen corresponding path program 1 times [2025-03-16 20:21:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096794268] [2025-03-16 20:21:52,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:21:52,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:21:52,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:52,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096794268] [2025-03-16 20:21:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096794268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786935142] [2025-03-16 20:21:52,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:52,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:21:53,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:21:53,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:21:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:21:53,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:21:53,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:54,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786935142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:57,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 22] total 57 [2025-03-16 20:21:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752347836] [2025-03-16 20:21:57,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 20:21:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:57,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 20:21:57,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2861, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:21:57,483 INFO L87 Difference]: Start difference. First operand 7705 states and 10297 transitions. Second operand has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:08,014 INFO L93 Difference]: Finished difference Result 15825 states and 20452 transitions. [2025-03-16 20:22:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-16 20:22:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 20:22:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:08,027 INFO L225 Difference]: With dead ends: 15825 [2025-03-16 20:22:08,027 INFO L226 Difference]: Without dead ends: 12929 [2025-03-16 20:22:08,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7895 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=4305, Invalid=21455, Unknown=0, NotChecked=0, Total=25760 [2025-03-16 20:22:08,036 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 29217 mSDsluCounter, 22810 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29217 SdHoareTripleChecker+Valid, 24355 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:08,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29217 Valid, 24355 Invalid, 3247 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:22:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2025-03-16 20:22:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 11458. [2025-03-16 20:22:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11458 states, 11456 states have (on average 1.302199720670391) internal successors, (14918), 11457 states have internal predecessors, (14918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11458 states to 11458 states and 14918 transitions. [2025-03-16 20:22:08,498 INFO L78 Accepts]: Start accepts. Automaton has 11458 states and 14918 transitions. Word has length 97 [2025-03-16 20:22:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 11458 states and 14918 transitions. [2025-03-16 20:22:08,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11458 states and 14918 transitions. [2025-03-16 20:22:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:22:08,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,500 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 20:22:08,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:22:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:08,704 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2117211932, now seen corresponding path program 1 times [2025-03-16 20:22:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206932098] [2025-03-16 20:22:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:22:08,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:22:08,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206932098] [2025-03-16 20:22:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206932098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118794637] [2025-03-16 20:22:09,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:09,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:09,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:22:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:22:09,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:22:09,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 20:22:09,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:13,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118794637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:19,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:19,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 73 [2025-03-16 20:22:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765790083] [2025-03-16 20:22:19,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-16 20:22:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:19,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-16 20:22:19,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=4828, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:22:19,467 INFO L87 Difference]: Start difference. First operand 11458 states and 14918 transitions. Second operand has 73 states, 73 states have (on average 3.835616438356164) internal successors, (280), 73 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)