./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f5d324be5cda3ace002cd56bcc40157f7761355257d743a63929a31342660554 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:38:33,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:38:33,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:38:33,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:38:33,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:38:33,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:38:33,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:38:33,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:38:33,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:38:33,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:38:33,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:38:33,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:38:33,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:38:33,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:38:33,221 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:38:33,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:38:33,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:38:33,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:38:33,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:38:33,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:38:33,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:38:33,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:38:33,224 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-jdk21/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 -> f5d324be5cda3ace002cd56bcc40157f7761355257d743a63929a31342660554 [2025-02-05 17:38:33,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:38:33,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:38:33,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:38:33,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:38:33,439 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:38:33,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-02-05 17:38:34,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e4b644/02fe7cb61e0c4ee18231cb6467178ea6/FLAGff5be2b4b [2025-02-05 17:38:34,987 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:38:34,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-02-05 17:38:35,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e4b644/02fe7cb61e0c4ee18231cb6467178ea6/FLAGff5be2b4b [2025-02-05 17:38:35,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4e4b644/02fe7cb61e0c4ee18231cb6467178ea6 [2025-02-05 17:38:35,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:38:35,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:38:35,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:38:35,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:38:35,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:38:35,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:38:35" (1/1) ... [2025-02-05 17:38:35,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf55e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:35, skipping insertion in model container [2025-02-05 17:38:35,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:38:35" (1/1) ... [2025-02-05 17:38:35,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:38:35,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c[8712,8725] [2025-02-05 17:38:35,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c[11529,11542] [2025-02-05 17:38:35,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:38:35,736 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:38:35,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c[8712,8725] [2025-02-05 17:38:35,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c[11529,11542] [2025-02-05 17:38:36,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:38:36,032 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:38:36,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36 WrapperNode [2025-02-05 17:38:36,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:38:36,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:38:36,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:38:36,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:38:36,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,309 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-02-05 17:38:36,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:38:36,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:38:36,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:38:36,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:38:36,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,463 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-02-05 17:38:36,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:38:36,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:38:36,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:38:36,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:38:36,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (1/1) ... [2025-02-05 17:38:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:38:36,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:38:36,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:38:36,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:38:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:38:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:38:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:38:36,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:38:36,865 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:38:36,867 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:38:40,133 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-02-05 17:38:40,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-02-05 17:38:40,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-02-05 17:38:40,269 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-02-05 17:38:40,269 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:38:40,304 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:38:40,304 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:38:40,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:38:40 BoogieIcfgContainer [2025-02-05 17:38:40,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:38:40,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:38:40,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:38:40,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:38:40,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:38:35" (1/3) ... [2025-02-05 17:38:40,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bdfd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:38:40, skipping insertion in model container [2025-02-05 17:38:40,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:38:36" (2/3) ... [2025-02-05 17:38:40,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bdfd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:38:40, skipping insertion in model container [2025-02-05 17:38:40,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:38:40" (3/3) ... [2025-02-05 17:38:40,313 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-02-05 17:38:40,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:38:40,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:38:40,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:38:40,404 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;@303fcca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:38:40,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:38:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:38:40,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:40,418 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] [2025-02-05 17:38:40,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1330764623, now seen corresponding path program 1 times [2025-02-05 17:38:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519754604] [2025-02-05 17:38:40,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:40,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 17:38:40,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:38:40,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:40,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:40,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519754604] [2025-02-05 17:38:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519754604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:38:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998156880] [2025-02-05 17:38:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:40,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:38:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:40,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:38:40,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:38:40,630 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:40,700 INFO L93 Difference]: Finished difference Result 1742 states and 3307 transitions. [2025-02-05 17:38:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:38:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-05 17:38:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:40,720 INFO L225 Difference]: With dead ends: 1742 [2025-02-05 17:38:40,720 INFO L226 Difference]: Without dead ends: 821 [2025-02-05 17:38:40,724 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-02-05 17:38:40,727 INFO L435 NwaCegarLoop]: 1615 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, 1615 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-02-05 17:38:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-05 17:38:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-02-05 17:38:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8937728937728937) internal successors, (1551), 820 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1551 transitions. [2025-02-05 17:38:40,804 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1551 transitions. Word has length 22 [2025-02-05 17:38:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:40,804 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1551 transitions. [2025-02-05 17:38:40,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1551 transitions. [2025-02-05 17:38:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:38:40,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:40,805 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] [2025-02-05 17:38:40,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:38:40,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:40,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-02-05 17:38:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202926679] [2025-02-05 17:38:40,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:40,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 17:38:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:38:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202926679] [2025-02-05 17:38:40,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202926679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:40,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:38:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951285616] [2025-02-05 17:38:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:40,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:38:40,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:40,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:38:40,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:38:40,982 INFO L87 Difference]: Start difference. First operand 821 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:41,061 INFO L93 Difference]: Finished difference Result 863 states and 1615 transitions. [2025-02-05 17:38:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:38:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-05 17:38:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:41,066 INFO L225 Difference]: With dead ends: 863 [2025-02-05 17:38:41,067 INFO L226 Difference]: Without dead ends: 821 [2025-02-05 17:38:41,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:38:41,068 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:41,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-05 17:38:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-02-05 17:38:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8656898656898657) internal successors, (1528), 820 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1528 transitions. [2025-02-05 17:38:41,083 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1528 transitions. Word has length 22 [2025-02-05 17:38:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:41,084 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1528 transitions. [2025-02-05 17:38:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1528 transitions. [2025-02-05 17:38:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:38:41,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:41,084 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] [2025-02-05 17:38:41,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:38:41,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:41,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1418659904, now seen corresponding path program 1 times [2025-02-05 17:38:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:41,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602002423] [2025-02-05 17:38:41,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:38:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:38:41,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602002423] [2025-02-05 17:38:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602002423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:41,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:41,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:38:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213666411] [2025-02-05 17:38:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:41,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:41,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:41,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:41,197 INFO L87 Difference]: Start difference. First operand 821 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:43,726 INFO L93 Difference]: Finished difference Result 2325 states and 4401 transitions. [2025-02-05 17:38:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:38:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:43,733 INFO L225 Difference]: With dead ends: 2325 [2025-02-05 17:38:43,733 INFO L226 Difference]: Without dead ends: 1572 [2025-02-05 17:38:43,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:43,735 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 883 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:43,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 517 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 17:38:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-02-05 17:38:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-02-05 17:38:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.627388535031847) internal successors, (2555), 1571 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2555 transitions. [2025-02-05 17:38:43,771 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2555 transitions. Word has length 24 [2025-02-05 17:38:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2555 transitions. [2025-02-05 17:38:43,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2555 transitions. [2025-02-05 17:38:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:38:43,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:43,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:43,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:38:43,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-02-05 17:38:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931574457] [2025-02-05 17:38:43,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:43,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:38:43,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:38:43,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:43,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931574457] [2025-02-05 17:38:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931574457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:43,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:43,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437826175] [2025-02-05 17:38:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:43,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:43,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:43,913 INFO L87 Difference]: Start difference. First operand 1572 states and 2555 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,026 INFO L93 Difference]: Finished difference Result 1876 states and 3035 transitions. [2025-02-05 17:38:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:38:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 17:38:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,033 INFO L225 Difference]: With dead ends: 1876 [2025-02-05 17:38:44,033 INFO L226 Difference]: Without dead ends: 1838 [2025-02-05 17:38:44,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:38:44,034 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:44,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:38:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-05 17:38:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-02-05 17:38:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1606 states have (on average 1.62640099626401) internal successors, (2612), 1607 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2612 transitions. [2025-02-05 17:38:44,061 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2612 transitions. Word has length 44 [2025-02-05 17:38:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,062 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2612 transitions. [2025-02-05 17:38:44,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2612 transitions. [2025-02-05 17:38:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:38:44,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,063 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] [2025-02-05 17:38:44,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:38:44,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-02-05 17:38:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206083950] [2025-02-05 17:38:44,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:38:44,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:38:44,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206083950] [2025-02-05 17:38:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206083950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107278745] [2025-02-05 17:38:44,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:44,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:44,140 INFO L87 Difference]: Start difference. First operand 1608 states and 2612 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,166 INFO L93 Difference]: Finished difference Result 1745 states and 2827 transitions. [2025-02-05 17:38:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-05 17:38:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,172 INFO L225 Difference]: With dead ends: 1745 [2025-02-05 17:38:44,172 INFO L226 Difference]: Without dead ends: 1671 [2025-02-05 17:38:44,173 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-02-05 17:38:44,173 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 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-02-05 17:38:44,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-02-05 17:38:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-02-05 17:38:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6228228228228228) internal successors, (2702), 1666 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2702 transitions. [2025-02-05 17:38:44,199 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2702 transitions. Word has length 46 [2025-02-05 17:38:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2702 transitions. [2025-02-05 17:38:44,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2702 transitions. [2025-02-05 17:38:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:38:44,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,202 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] [2025-02-05 17:38:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:38:44,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-02-05 17:38:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477150752] [2025-02-05 17:38:44,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:38:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:38:44,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477150752] [2025-02-05 17:38:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477150752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119345516] [2025-02-05 17:38:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:44,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:44,405 INFO L87 Difference]: Start difference. First operand 1667 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,495 INFO L93 Difference]: Finished difference Result 1802 states and 2910 transitions. [2025-02-05 17:38:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:38:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-05 17:38:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,501 INFO L225 Difference]: With dead ends: 1802 [2025-02-05 17:38:44,501 INFO L226 Difference]: Without dead ends: 1669 [2025-02-05 17:38:44,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:38:44,502 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 5936 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5936 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:44,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5936 Valid, 1690 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-02-05 17:38:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-02-05 17:38:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6216216216216217) internal successors, (2700), 1666 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2700 transitions. [2025-02-05 17:38:44,534 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2700 transitions. Word has length 46 [2025-02-05 17:38:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,534 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2700 transitions. [2025-02-05 17:38:44,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2700 transitions. [2025-02-05 17:38:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 17:38:44,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:44,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:38:44,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-02-05 17:38:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779408963] [2025-02-05 17:38:44,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 17:38:44,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 17:38:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779408963] [2025-02-05 17:38:44,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779408963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:38:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431463155] [2025-02-05 17:38:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:38:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:38:44,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:38:44,700 INFO L87 Difference]: Start difference. First operand 1667 states and 2700 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-02-05 17:38:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,726 INFO L93 Difference]: Finished difference Result 1675 states and 2709 transitions. [2025-02-05 17:38:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:38:44,726 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 47 [2025-02-05 17:38:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,731 INFO L225 Difference]: With dead ends: 1675 [2025-02-05 17:38:44,731 INFO L226 Difference]: Without dead ends: 1673 [2025-02-05 17:38:44,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:38:44,732 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:44,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-02-05 17:38:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-02-05 17:38:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1671 states have (on average 1.6187911430281268) internal successors, (2705), 1672 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2705 transitions. [2025-02-05 17:38:44,758 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2705 transitions. Word has length 47 [2025-02-05 17:38:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,758 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2705 transitions. [2025-02-05 17:38:44,758 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-02-05 17:38:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2705 transitions. [2025-02-05 17:38:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:38:44,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,759 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] [2025-02-05 17:38:44,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:38:44,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-02-05 17:38:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990859511] [2025-02-05 17:38:44,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:38:44,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:38:44,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990859511] [2025-02-05 17:38:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990859511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861185564] [2025-02-05 17:38:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:44,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:44,806 INFO L87 Difference]: Start difference. First operand 1673 states and 2705 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,824 INFO L93 Difference]: Finished difference Result 1935 states and 3097 transitions. [2025-02-05 17:38:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 17:38:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,829 INFO L225 Difference]: With dead ends: 1935 [2025-02-05 17:38:44,829 INFO L226 Difference]: Without dead ends: 1796 [2025-02-05 17:38:44,830 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-02-05 17:38:44,830 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 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-02-05 17:38:44,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-02-05 17:38:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-02-05 17:38:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.6082589285714286) internal successors, (2882), 1793 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2882 transitions. [2025-02-05 17:38:44,858 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2882 transitions. Word has length 48 [2025-02-05 17:38:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,858 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2882 transitions. [2025-02-05 17:38:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2882 transitions. [2025-02-05 17:38:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:38:44,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,859 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] [2025-02-05 17:38:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:38:44,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-02-05 17:38:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272514542] [2025-02-05 17:38:44,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:38:44,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:38:44,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272514542] [2025-02-05 17:38:44,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272514542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:44,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743383109] [2025-02-05 17:38:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:44,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:44,896 INFO L87 Difference]: Start difference. First operand 1794 states and 2882 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:44,916 INFO L93 Difference]: Finished difference Result 2282 states and 3600 transitions. [2025-02-05 17:38:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:44,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 17:38:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:44,922 INFO L225 Difference]: With dead ends: 2282 [2025-02-05 17:38:44,922 INFO L226 Difference]: Without dead ends: 2022 [2025-02-05 17:38:44,923 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-02-05 17:38:44,924 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 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-02-05 17:38:44,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-02-05 17:38:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-02-05 17:38:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.5877106045589693) internal successors, (3204), 2019 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3204 transitions. [2025-02-05 17:38:44,957 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3204 transitions. Word has length 48 [2025-02-05 17:38:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:44,957 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3204 transitions. [2025-02-05 17:38:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3204 transitions. [2025-02-05 17:38:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:38:44,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:44,958 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] [2025-02-05 17:38:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:38:44,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-02-05 17:38:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379749479] [2025-02-05 17:38:44,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:38:44,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:38:44,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:44,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379749479] [2025-02-05 17:38:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379749479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369679931] [2025-02-05 17:38:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:44,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:44,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:44,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:44,993 INFO L87 Difference]: Start difference. First operand 2020 states and 3204 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:45,017 INFO L93 Difference]: Finished difference Result 2928 states and 4510 transitions. [2025-02-05 17:38:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:45,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 17:38:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:45,025 INFO L225 Difference]: With dead ends: 2928 [2025-02-05 17:38:45,025 INFO L226 Difference]: Without dead ends: 2442 [2025-02-05 17:38:45,026 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-02-05 17:38:45,026 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 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-02-05 17:38:45,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-02-05 17:38:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-02-05 17:38:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.5520918785890074) internal successors, (3784), 2439 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3784 transitions. [2025-02-05 17:38:45,066 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3784 transitions. Word has length 48 [2025-02-05 17:38:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:45,066 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3784 transitions. [2025-02-05 17:38:45,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3784 transitions. [2025-02-05 17:38:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 17:38:45,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:45,067 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] [2025-02-05 17:38:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:38:45,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:45,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:45,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-02-05 17:38:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872893197] [2025-02-05 17:38:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:45,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 17:38:45,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 17:38:45,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872893197] [2025-02-05 17:38:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872893197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:45,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:45,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051088891] [2025-02-05 17:38:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:45,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:45,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:45,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:45,102 INFO L87 Difference]: Start difference. First operand 2440 states and 3784 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:45,132 INFO L93 Difference]: Finished difference Result 3407 states and 5182 transitions. [2025-02-05 17:38:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-02-05 17:38:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:45,141 INFO L225 Difference]: With dead ends: 3407 [2025-02-05 17:38:45,141 INFO L226 Difference]: Without dead ends: 2876 [2025-02-05 17:38:45,142 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-02-05 17:38:45,143 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 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-02-05 17:38:45,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-02-05 17:38:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-02-05 17:38:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.527158774373259) internal successors, (4386), 2873 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4386 transitions. [2025-02-05 17:38:45,195 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4386 transitions. Word has length 50 [2025-02-05 17:38:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:45,196 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4386 transitions. [2025-02-05 17:38:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4386 transitions. [2025-02-05 17:38:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:38:45,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:45,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:45,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:38:45,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:45,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-02-05 17:38:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579829868] [2025-02-05 17:38:45,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:45,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:38:45,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:38:45,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:45,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:38:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579829868] [2025-02-05 17:38:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579829868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341436231] [2025-02-05 17:38:45,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:45,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:45,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:45,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:45,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:45,296 INFO L87 Difference]: Start difference. First operand 2874 states and 4386 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:45,429 INFO L93 Difference]: Finished difference Result 8524 states and 12343 transitions. [2025-02-05 17:38:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:38:45,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:38:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:45,457 INFO L225 Difference]: With dead ends: 8524 [2025-02-05 17:38:45,457 INFO L226 Difference]: Without dead ends: 7186 [2025-02-05 17:38:45,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:38:45,462 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4663 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4663 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:45,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4663 Valid, 3368 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-02-05 17:38:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-02-05 17:38:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.4852661596958174) internal successors, (6250), 4209 states have internal predecessors, (6250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6250 transitions. [2025-02-05 17:38:45,587 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6250 transitions. Word has length 65 [2025-02-05 17:38:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6250 transitions. [2025-02-05 17:38:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6250 transitions. [2025-02-05 17:38:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:38:45,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:45,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:38:45,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:45,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-02-05 17:38:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679581757] [2025-02-05 17:38:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:38:45,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:38:45,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:45,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:38:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679581757] [2025-02-05 17:38:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679581757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048347191] [2025-02-05 17:38:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:45,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:45,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:45,703 INFO L87 Difference]: Start difference. First operand 4210 states and 6250 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:45,841 INFO L93 Difference]: Finished difference Result 9860 states and 14207 transitions. [2025-02-05 17:38:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:38:45,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:38:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:45,854 INFO L225 Difference]: With dead ends: 9860 [2025-02-05 17:38:45,854 INFO L226 Difference]: Without dead ends: 8522 [2025-02-05 17:38:45,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:38:45,859 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4688 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:45,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3318 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-02-05 17:38:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-02-05 17:38:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.452059202059202) internal successors, (9026), 6217 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9026 transitions. [2025-02-05 17:38:45,986 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9026 transitions. Word has length 65 [2025-02-05 17:38:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:45,986 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9026 transitions. [2025-02-05 17:38:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9026 transitions. [2025-02-05 17:38:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:38:45,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:45,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:45,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:38:45,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-02-05 17:38:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:45,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403531481] [2025-02-05 17:38:45,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:45,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:38:46,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:38:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:38:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403531481] [2025-02-05 17:38:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403531481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833925016] [2025-02-05 17:38:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:46,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:46,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:46,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:46,084 INFO L87 Difference]: Start difference. First operand 6218 states and 9026 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:46,222 INFO L93 Difference]: Finished difference Result 11196 states and 16071 transitions. [2025-02-05 17:38:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:38:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:38:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:46,238 INFO L225 Difference]: With dead ends: 11196 [2025-02-05 17:38:46,238 INFO L226 Difference]: Without dead ends: 9858 [2025-02-05 17:38:46,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:38:46,244 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4673 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:46,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3337 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-02-05 17:38:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-02-05 17:38:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.4420021186440677) internal successors, (10890), 7553 states have internal predecessors, (10890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 10890 transitions. [2025-02-05 17:38:46,420 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 10890 transitions. Word has length 65 [2025-02-05 17:38:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:46,420 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 10890 transitions. [2025-02-05 17:38:46,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 10890 transitions. [2025-02-05 17:38:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:38:46,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:46,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:38:46,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-02-05 17:38:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435531856] [2025-02-05 17:38:46,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:46,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:38:46,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:38:46,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:46,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:46,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435531856] [2025-02-05 17:38:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435531856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:46,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839470303] [2025-02-05 17:38:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:46,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:46,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:46,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:46,486 INFO L87 Difference]: Start difference. First operand 7554 states and 10890 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:46,537 INFO L93 Difference]: Finished difference Result 11896 states and 17031 transitions. [2025-02-05 17:38:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:38:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:46,547 INFO L225 Difference]: With dead ends: 11896 [2025-02-05 17:38:46,547 INFO L226 Difference]: Without dead ends: 5878 [2025-02-05 17:38:46,553 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-02-05 17:38:46,554 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 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-02-05 17:38:46,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2025-02-05 17:38:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2025-02-05 17:38:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5874 states have (on average 1.4579502894109635) internal successors, (8564), 5875 states have internal predecessors, (8564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 8564 transitions. [2025-02-05 17:38:46,639 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 8564 transitions. Word has length 67 [2025-02-05 17:38:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:46,639 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 8564 transitions. [2025-02-05 17:38:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 8564 transitions. [2025-02-05 17:38:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:38:46,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:46,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:46,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:38:46,640 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:46,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-02-05 17:38:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872416634] [2025-02-05 17:38:46,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:46,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:46,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:38:46,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:38:46,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:46,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:38:46,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:46,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872416634] [2025-02-05 17:38:46,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872416634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:46,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:46,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:38:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970231331] [2025-02-05 17:38:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:46,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:38:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:46,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:38:46,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:38:46,724 INFO L87 Difference]: Start difference. First operand 5876 states and 8564 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:46,838 INFO L93 Difference]: Finished difference Result 9726 states and 14009 transitions. [2025-02-05 17:38:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:38:46,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:38:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:46,852 INFO L225 Difference]: With dead ends: 9726 [2025-02-05 17:38:46,852 INFO L226 Difference]: Without dead ends: 8764 [2025-02-05 17:38:46,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:38:46,857 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4667 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:46,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3393 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2025-02-05 17:38:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 6836. [2025-02-05 17:38:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.4498097746561311) internal successors, (9908), 6835 states have internal predecessors, (9908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9908 transitions. [2025-02-05 17:38:47,012 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9908 transitions. Word has length 67 [2025-02-05 17:38:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9908 transitions. [2025-02-05 17:38:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9908 transitions. [2025-02-05 17:38:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:38:47,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:47,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:38:47,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:47,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-02-05 17:38:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936437823] [2025-02-05 17:38:47,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:47,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:38:47,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:38:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936437823] [2025-02-05 17:38:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936437823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320277882] [2025-02-05 17:38:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:47,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:47,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:47,109 INFO L87 Difference]: Start difference. First operand 6836 states and 9908 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:47,171 INFO L93 Difference]: Finished difference Result 9480 states and 13606 transitions. [2025-02-05 17:38:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 17:38:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:47,180 INFO L225 Difference]: With dead ends: 9480 [2025-02-05 17:38:47,180 INFO L226 Difference]: Without dead ends: 4198 [2025-02-05 17:38:47,185 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-02-05 17:38:47,186 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 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-02-05 17:38:47,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-02-05 17:38:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-02-05 17:38:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.4706723891273248) internal successors, (6168), 4195 states have internal predecessors, (6168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6168 transitions. [2025-02-05 17:38:47,265 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6168 transitions. Word has length 68 [2025-02-05 17:38:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6168 transitions. [2025-02-05 17:38:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6168 transitions. [2025-02-05 17:38:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 17:38:47,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:47,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:47,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:38:47,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-02-05 17:38:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16816460] [2025-02-05 17:38:47,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 17:38:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 17:38:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16816460] [2025-02-05 17:38:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16816460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373815109] [2025-02-05 17:38:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:47,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:47,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:47,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:47,354 INFO L87 Difference]: Start difference. First operand 4196 states and 6168 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:47,394 INFO L93 Difference]: Finished difference Result 5520 states and 7996 transitions. [2025-02-05 17:38:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 17:38:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:47,400 INFO L225 Difference]: With dead ends: 5520 [2025-02-05 17:38:47,400 INFO L226 Difference]: Without dead ends: 2878 [2025-02-05 17:38:47,403 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-02-05 17:38:47,404 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 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-02-05 17:38:47,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-02-05 17:38:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-02-05 17:38:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.5031315240083507) internal successors, (4320), 2875 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4320 transitions. [2025-02-05 17:38:47,440 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4320 transitions. Word has length 70 [2025-02-05 17:38:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:47,440 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4320 transitions. [2025-02-05 17:38:47,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4320 transitions. [2025-02-05 17:38:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 17:38:47,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:47,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:47,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:38:47,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:47,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-02-05 17:38:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112996199] [2025-02-05 17:38:47,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 17:38:47,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 17:38:47,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:47,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112996199] [2025-02-05 17:38:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112996199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:38:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:38:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:38:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524968153] [2025-02-05 17:38:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:38:47,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:38:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:38:47,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:38:47,503 INFO L87 Difference]: Start difference. First operand 2876 states and 4320 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:47,523 INFO L93 Difference]: Finished difference Result 3540 states and 5224 transitions. [2025-02-05 17:38:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:38:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 17:38:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:47,527 INFO L225 Difference]: With dead ends: 3540 [2025-02-05 17:38:47,527 INFO L226 Difference]: Without dead ends: 2218 [2025-02-05 17:38:47,528 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-02-05 17:38:47,529 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 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-02-05 17:38:47,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:38:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-02-05 17:38:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-02-05 17:38:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.538843721770551) internal successors, (3407), 2215 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3407 transitions. [2025-02-05 17:38:47,550 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3407 transitions. Word has length 72 [2025-02-05 17:38:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:47,550 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3407 transitions. [2025-02-05 17:38:47,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3407 transitions. [2025-02-05 17:38:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 17:38:47,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:47,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:47,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:38:47,553 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:47,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-02-05 17:38:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692149219] [2025-02-05 17:38:47,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:47,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 17:38:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 17:38:47,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692149219] [2025-02-05 17:38:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692149219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:38:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954389401] [2025-02-05 17:38:47,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:38:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:38:47,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:38:47,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:38:47,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 17:38:48,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 17:38:48,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:48,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:48,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:38:48,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:38:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:48,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:38:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954389401] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:38:48,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:38:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:38:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123052444] [2025-02-05 17:38:48,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:38:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:38:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:48,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:38:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:38:48,537 INFO L87 Difference]: Start difference. First operand 2216 states and 3407 transitions. Second operand has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:50,627 INFO L93 Difference]: Finished difference Result 7514 states and 10395 transitions. [2025-02-05 17:38:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 17:38:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 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 74 [2025-02-05 17:38:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:50,637 INFO L225 Difference]: With dead ends: 7514 [2025-02-05 17:38:50,637 INFO L226 Difference]: Without dead ends: 6778 [2025-02-05 17:38:50,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-02-05 17:38:50,642 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 15970 mSDsluCounter, 8022 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15970 SdHoareTripleChecker+Valid, 9558 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:50,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15970 Valid, 9558 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:38:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6778 states. [2025-02-05 17:38:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6778 to 6280. [2025-02-05 17:38:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6280 states, 6278 states have (on average 1.3791016247212489) internal successors, (8658), 6279 states have internal predecessors, (8658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 8658 transitions. [2025-02-05 17:38:50,782 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 8658 transitions. Word has length 74 [2025-02-05 17:38:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 6280 states and 8658 transitions. [2025-02-05 17:38:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 8658 transitions. [2025-02-05 17:38:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 17:38:50,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:50,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:50,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:38:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:38:50,986 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:50,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1424546165, now seen corresponding path program 1 times [2025-02-05 17:38:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:50,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162311785] [2025-02-05 17:38:50,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:50,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:38:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:38:51,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:51,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:51,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162311785] [2025-02-05 17:38:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162311785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:38:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869088928] [2025-02-05 17:38:51,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:38:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:38:51,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:38:51,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:38:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:38:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:38:51,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:51,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:51,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:38:51,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:38:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:52,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:38:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869088928] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:38:52,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:38:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-02-05 17:38:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653315222] [2025-02-05 17:38:52,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:38:52,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:38:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:52,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:38:52,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:38:52,784 INFO L87 Difference]: Start difference. First operand 6280 states and 8658 transitions. Second operand has 30 states, 30 states have (on average 6.566666666666666) internal successors, (197), 30 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:55,244 INFO L93 Difference]: Finished difference Result 27690 states and 36537 transitions. [2025-02-05 17:38:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 17:38:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.566666666666666) internal successors, (197), 30 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 17:38:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:55,280 INFO L225 Difference]: With dead ends: 27690 [2025-02-05 17:38:55,280 INFO L226 Difference]: Without dead ends: 23006 [2025-02-05 17:38:55,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=787, Invalid=3373, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 17:38:55,291 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 17900 mSDsluCounter, 14171 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17900 SdHoareTripleChecker+Valid, 15684 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:55,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17900 Valid, 15684 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:38:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23006 states. [2025-02-05 17:38:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23006 to 14968. [2025-02-05 17:38:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14968 states, 14966 states have (on average 1.3147133502605908) internal successors, (19676), 14967 states have internal predecessors, (19676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14968 states to 14968 states and 19676 transitions. [2025-02-05 17:38:55,712 INFO L78 Accepts]: Start accepts. Automaton has 14968 states and 19676 transitions. Word has length 75 [2025-02-05 17:38:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:38:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 14968 states and 19676 transitions. [2025-02-05 17:38:55,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.566666666666666) internal successors, (197), 30 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14968 states and 19676 transitions. [2025-02-05 17:38:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 17:38:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:38:55,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:38:55,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:38:55,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:38:55,917 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:38:55,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:38:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash -846880597, now seen corresponding path program 1 times [2025-02-05 17:38:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:38:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765594095] [2025-02-05 17:38:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:38:55,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:38:55,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:38:55,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:55,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:38:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765594095] [2025-02-05 17:38:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765594095] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:38:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091393323] [2025-02-05 17:38:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:38:56,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:38:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:38:56,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:38:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:38:56,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 17:38:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 17:38:56,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:38:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:38:56,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:38:56,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:38:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:56,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:38:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:38:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091393323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:38:57,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:38:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-02-05 17:38:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66225080] [2025-02-05 17:38:57,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:38:57,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:38:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:38:57,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:38:57,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:38:57,531 INFO L87 Difference]: Start difference. First operand 14968 states and 19676 transitions. Second operand has 28 states, 28 states have (on average 7.107142857142857) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:38:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:38:59,529 INFO L93 Difference]: Finished difference Result 45110 states and 58206 transitions. [2025-02-05 17:38:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 17:38:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.107142857142857) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 17:38:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:38:59,577 INFO L225 Difference]: With dead ends: 45110 [2025-02-05 17:38:59,577 INFO L226 Difference]: Without dead ends: 31718 [2025-02-05 17:38:59,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=710, Invalid=3072, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 17:38:59,590 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 17277 mSDsluCounter, 9474 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17277 SdHoareTripleChecker+Valid, 10983 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:38:59,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17277 Valid, 10983 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:38:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31718 states. [2025-02-05 17:39:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31718 to 30176. [2025-02-05 17:39:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30176 states, 30174 states have (on average 1.2826605687015311) internal successors, (38703), 30175 states have internal predecessors, (38703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:39:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30176 states to 30176 states and 38703 transitions. [2025-02-05 17:39:00,739 INFO L78 Accepts]: Start accepts. Automaton has 30176 states and 38703 transitions. Word has length 75 [2025-02-05 17:39:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:39:00,739 INFO L471 AbstractCegarLoop]: Abstraction has 30176 states and 38703 transitions. [2025-02-05 17:39:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.107142857142857) internal successors, (199), 27 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:39:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30176 states and 38703 transitions. [2025-02-05 17:39:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 17:39:00,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:39:00,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:39:00,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:39:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:39:00,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:39:00,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:39:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1144465886, now seen corresponding path program 1 times [2025-02-05 17:39:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:39:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206715695] [2025-02-05 17:39:00,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:39:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:39:00,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 17:39:00,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 17:39:00,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:39:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:39:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:39:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206715695] [2025-02-05 17:39:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206715695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:39:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445038131] [2025-02-05 17:39:01,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:39:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:39:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:39:01,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:39:01,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:39:01,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 17:39:01,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 17:39:01,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:39:01,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:39:01,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:39:01,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:39:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:01,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:39:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445038131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:39:02,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:39:02,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-02-05 17:39:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060888863] [2025-02-05 17:39:02,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:39:02,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:39:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:39:02,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:39:02,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:39:02,611 INFO L87 Difference]: Start difference. First operand 30176 states and 38703 transitions. Second operand has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:39:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:39:03,663 INFO L93 Difference]: Finished difference Result 58540 states and 74806 transitions. [2025-02-05 17:39:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:39:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 17:39:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:39:03,696 INFO L225 Difference]: With dead ends: 58540 [2025-02-05 17:39:03,696 INFO L226 Difference]: Without dead ends: 31392 [2025-02-05 17:39:03,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 17:39:03,714 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 16603 mSDsluCounter, 9271 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16603 SdHoareTripleChecker+Valid, 10778 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:39:03,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16603 Valid, 10778 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:39:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31392 states. [2025-02-05 17:39:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31392 to 29120. [2025-02-05 17:39:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29120 states, 29118 states have (on average 1.2741603132083248) internal successors, (37101), 29119 states have internal predecessors, (37101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:39:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29120 states to 29120 states and 37101 transitions. [2025-02-05 17:39:04,494 INFO L78 Accepts]: Start accepts. Automaton has 29120 states and 37101 transitions. Word has length 76 [2025-02-05 17:39:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:39:04,494 INFO L471 AbstractCegarLoop]: Abstraction has 29120 states and 37101 transitions. [2025-02-05 17:39:04,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:39:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 29120 states and 37101 transitions. [2025-02-05 17:39:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:39:04,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:39:04,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:39:04,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:39:04,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 17:39:04,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:39:04,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:39:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1571986160, now seen corresponding path program 1 times [2025-02-05 17:39:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:39:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465364482] [2025-02-05 17:39:04,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:39:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:39:04,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:39:04,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:39:04,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:39:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:39:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:39:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465364482] [2025-02-05 17:39:06,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465364482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:39:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158596378] [2025-02-05 17:39:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:39:06,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:39:06,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:39:06,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:39:06,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:39:06,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:39:06,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:39:06,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:39:06,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:39:06,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-05 17:39:06,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:39:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:10,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:39:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:39:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158596378] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:39:14,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:39:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 28] total 80 [2025-02-05 17:39:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812801459] [2025-02-05 17:39:14,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:39:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-02-05 17:39:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:39:14,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-02-05 17:39:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=5661, Unknown=0, NotChecked=0, Total=6320 [2025-02-05 17:39:14,797 INFO L87 Difference]: Start difference. First operand 29120 states and 37101 transitions. Second operand has 80 states, 80 states have (on average 2.675) internal successors, (214), 80 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)