./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 355b6431f903a7e9642ff9c83d141a20cc82336cba9865af34a1f63508906235 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:06:00,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:06:00,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:06:00,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:06:00,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:06:00,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:06:00,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:06:00,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:06:00,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:06:00,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:06:00,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:06:00,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:06:00,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:06:00,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:06:00,434 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:06:00,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:06:00,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:06:00,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:06:00,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:06:00,436 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 355b6431f903a7e9642ff9c83d141a20cc82336cba9865af34a1f63508906235 [2025-03-03 16:06:00,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:06:00,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:06:00,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:06:00,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:06:00,659 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:06:00,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:06:01,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5409f2940/edfc40a375684b96b14e9c2b495d1493/FLAG604dbe109 [2025-03-03 16:06:02,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:06:02,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:06:02,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5409f2940/edfc40a375684b96b14e9c2b495d1493/FLAG604dbe109 [2025-03-03 16:06:02,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5409f2940/edfc40a375684b96b14e9c2b495d1493 [2025-03-03 16:06:02,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:06:02,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:06:02,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:06:02,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:06:02,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:06:02,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:06:02" (1/1) ... [2025-03-03 16:06:02,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aad87d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:02, skipping insertion in model container [2025-03-03 16:06:02,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:06:02" (1/1) ... [2025-03-03 16:06:02,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:06:02,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c[8712,8725] [2025-03-03 16:06:02,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c[10587,10600] [2025-03-03 16:06:03,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:06:03,160 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:06:03,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c[8712,8725] [2025-03-03 16:06:03,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c[10587,10600] [2025-03-03 16:06:03,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:06:03,456 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:06:03,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03 WrapperNode [2025-03-03 16:06:03,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:06:03,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:06:03,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:06:03,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:06:03,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,713 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-03 16:06:03,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:06:03,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:06:03,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:06:03,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:06:03,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:06:03,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:03,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:04,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:04,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:04,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:04,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:06:04,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:06:04,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:06:04,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:06:04,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (1/1) ... [2025-03-03 16:06:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:06:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:04,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:06:04,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:06:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:06:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:06:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:06:04,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:06:04,230 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:06:04,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:06:07,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-03 16:06:07,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-03 16:06:07,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-03 16:06:07,777 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-03 16:06:07,777 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:06:07,797 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:06:07,798 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:06:07,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:06:07 BoogieIcfgContainer [2025-03-03 16:06:07,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:06:07,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:06:07,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:06:07,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:06:07,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:06:02" (1/3) ... [2025-03-03 16:06:07,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4b1455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:06:07, skipping insertion in model container [2025-03-03 16:06:07,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:03" (2/3) ... [2025-03-03 16:06:07,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4b1455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:06:07, skipping insertion in model container [2025-03-03 16:06:07,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:06:07" (3/3) ... [2025-03-03 16:06:07,805 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:06:07,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:06:07,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label00.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:06:07,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:06:07,900 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;@46d7dae8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:06:07,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:06:07,909 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-03-03 16:06:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 16:06:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:07,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:07,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1299114804, now seen corresponding path program 1 times [2025-03-03 16:06:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037319437] [2025-03-03 16:06:07,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:07,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 16:06:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 16:06:08,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:08,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037319437] [2025-03-03 16:06:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037319437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:06:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105502797] [2025-03-03 16:06:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:08,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:08,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:08,161 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:10,845 INFO L93 Difference]: Finished difference Result 2497 states and 4808 transitions. [2025-03-03 16:06:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-03 16:06:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:10,863 INFO L225 Difference]: With dead ends: 2497 [2025-03-03 16:06:10,863 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 16:06:10,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:10,872 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 931 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:10,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 595 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 16:06:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 16:06:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 16:06:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.6420382165605096) internal successors, (2578), 1571 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2578 transitions. [2025-03-03 16:06:10,949 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2578 transitions. Word has length 16 [2025-03-03 16:06:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:10,949 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2578 transitions. [2025-03-03 16:06:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2578 transitions. [2025-03-03 16:06:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:06:10,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:10,950 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-03-03 16:06:10,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:06:10,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-03-03 16:06:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793151521] [2025-03-03 16:06:10,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:10,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:06:10,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:06:10,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:10,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793151521] [2025-03-03 16:06:11,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793151521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:11,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:11,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:06:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974769429] [2025-03-03 16:06:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:11,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:06:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:11,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:06:11,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:11,134 INFO L87 Difference]: Start difference. First operand 1572 states and 2578 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-03-03 16:06:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:11,179 INFO L93 Difference]: Finished difference Result 1614 states and 2642 transitions. [2025-03-03 16:06:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:06:11,180 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-03-03 16:06:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:11,184 INFO L225 Difference]: With dead ends: 1614 [2025-03-03 16:06:11,184 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 16:06:11,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:11,186 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-03-03 16:06:11,186 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-03-03 16:06:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 16:06:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 16:06:11,205 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-03-03 16:06:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2555 transitions. [2025-03-03 16:06:11,209 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2555 transitions. Word has length 22 [2025-03-03 16:06:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:11,209 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2555 transitions. [2025-03-03 16:06:11,209 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-03-03 16:06:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2555 transitions. [2025-03-03 16:06:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:06:11,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:11,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:06:11,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-03-03 16:06:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549140335] [2025-03-03 16:06:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:11,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:06:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:06:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549140335] [2025-03-03 16:06:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549140335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346452051] [2025-03-03 16:06:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:11,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:11,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:11,348 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-03-03 16:06:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:11,470 INFO L93 Difference]: Finished difference Result 1876 states and 3035 transitions. [2025-03-03 16:06:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:06:11,471 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-03-03 16:06:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:11,476 INFO L225 Difference]: With dead ends: 1876 [2025-03-03 16:06:11,477 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 16:06:11,477 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-03-03 16:06:11,478 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-03-03 16:06:11,481 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-03-03 16:06:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 16:06:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-03-03 16:06:11,505 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-03-03 16:06:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2612 transitions. [2025-03-03 16:06:11,509 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2612 transitions. Word has length 44 [2025-03-03 16:06:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2612 transitions. [2025-03-03 16:06:11,509 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-03-03 16:06:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2612 transitions. [2025-03-03 16:06:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:06:11,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:11,510 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-03-03 16:06:11,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:06:11,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:11,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-03-03 16:06:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238817230] [2025-03-03 16:06:11,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:11,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:06:11,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:06:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:11,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:11,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238817230] [2025-03-03 16:06:11,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238817230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:11,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294625502] [2025-03-03 16:06:11,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:11,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:11,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:11,599 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-03-03 16:06:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:11,631 INFO L93 Difference]: Finished difference Result 1745 states and 2827 transitions. [2025-03-03 16:06:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:11,631 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-03-03 16:06:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:11,636 INFO L225 Difference]: With dead ends: 1745 [2025-03-03 16:06:11,636 INFO L226 Difference]: Without dead ends: 1671 [2025-03-03 16:06:11,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:11,637 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-03-03 16:06:11,639 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-03-03 16:06:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-03 16:06:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-03-03 16:06:11,661 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-03-03 16:06:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2702 transitions. [2025-03-03 16:06:11,665 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2702 transitions. Word has length 46 [2025-03-03 16:06:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:11,666 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2702 transitions. [2025-03-03 16:06:11,666 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-03-03 16:06:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2702 transitions. [2025-03-03 16:06:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:06:11,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:11,669 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-03-03 16:06:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:06:11,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-03-03 16:06:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837878937] [2025-03-03 16:06:11,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:11,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:06:11,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:06:11,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:11,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:11,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:11,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837878937] [2025-03-03 16:06:11,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837878937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:11,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:11,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879422599] [2025-03-03 16:06:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:11,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:11,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:11,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:11,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:11,863 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-03-03 16:06:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:11,955 INFO L93 Difference]: Finished difference Result 1802 states and 2910 transitions. [2025-03-03 16:06:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:11,956 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-03-03 16:06:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:11,961 INFO L225 Difference]: With dead ends: 1802 [2025-03-03 16:06:11,961 INFO L226 Difference]: Without dead ends: 1669 [2025-03-03 16:06:11,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:06:11,962 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 4455 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:11,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 1690 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-03 16:06:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-03-03 16:06:11,982 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-03-03 16:06:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2700 transitions. [2025-03-03 16:06:11,986 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2700 transitions. Word has length 46 [2025-03-03 16:06:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2700 transitions. [2025-03-03 16:06:11,986 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-03-03 16:06:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2700 transitions. [2025-03-03 16:06:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 16:06:11,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:11,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:11,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:06:11,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-03-03 16:06:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872802276] [2025-03-03 16:06:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:11,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 16:06:12,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 16:06:12,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872802276] [2025-03-03 16:06:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872802276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:06:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058413011] [2025-03-03 16:06:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:06:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:06:12,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:12,145 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-03-03 16:06:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,179 INFO L93 Difference]: Finished difference Result 1675 states and 2709 transitions. [2025-03-03 16:06:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:06:12,180 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-03-03 16:06:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,184 INFO L225 Difference]: With dead ends: 1675 [2025-03-03 16:06:12,185 INFO L226 Difference]: Without dead ends: 1673 [2025-03-03 16:06:12,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:12,185 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-03-03 16:06:12,186 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-03-03 16:06:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-03 16:06:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-03 16:06:12,210 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-03-03 16:06:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2705 transitions. [2025-03-03 16:06:12,216 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2705 transitions. Word has length 47 [2025-03-03 16:06:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:12,216 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2705 transitions. [2025-03-03 16:06:12,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2705 transitions. [2025-03-03 16:06:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:12,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:12,217 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-03-03 16:06:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:06:12,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-03-03 16:06:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100067200] [2025-03-03 16:06:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:12,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:12,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100067200] [2025-03-03 16:06:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100067200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658455680] [2025-03-03 16:06:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:12,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,270 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-03-03 16:06:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,292 INFO L93 Difference]: Finished difference Result 1935 states and 3097 transitions. [2025-03-03 16:06:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:12,293 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-03-03 16:06:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,298 INFO L225 Difference]: With dead ends: 1935 [2025-03-03 16:06:12,298 INFO L226 Difference]: Without dead ends: 1796 [2025-03-03 16:06:12,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,299 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-03-03 16:06:12,299 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-03-03 16:06:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-03-03 16:06:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-03-03 16:06:12,322 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-03-03 16:06:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2882 transitions. [2025-03-03 16:06:12,326 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2882 transitions. Word has length 48 [2025-03-03 16:06:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:12,327 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2882 transitions. [2025-03-03 16:06:12,327 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-03-03 16:06:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2882 transitions. [2025-03-03 16:06:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:12,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:12,328 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-03-03 16:06:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:06:12,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:12,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-03-03 16:06:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:12,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439872902] [2025-03-03 16:06:12,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:12,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:12,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439872902] [2025-03-03 16:06:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439872902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279294948] [2025-03-03 16:06:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:12,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,378 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-03-03 16:06:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,430 INFO L93 Difference]: Finished difference Result 2282 states and 3600 transitions. [2025-03-03 16:06:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:12,431 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-03-03 16:06:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,436 INFO L225 Difference]: With dead ends: 2282 [2025-03-03 16:06:12,436 INFO L226 Difference]: Without dead ends: 2022 [2025-03-03 16:06:12,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,437 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-03-03 16:06:12,437 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-03-03 16:06:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-03-03 16:06:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-03-03 16:06:12,463 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-03-03 16:06:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3204 transitions. [2025-03-03 16:06:12,468 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3204 transitions. Word has length 48 [2025-03-03 16:06:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3204 transitions. [2025-03-03 16:06:12,468 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-03-03 16:06:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3204 transitions. [2025-03-03 16:06:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:12,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:12,469 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-03-03 16:06:12,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:06:12,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-03-03 16:06:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208035304] [2025-03-03 16:06:12,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:12,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:12,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208035304] [2025-03-03 16:06:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208035304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705247120] [2025-03-03 16:06:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:12,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,509 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-03-03 16:06:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,536 INFO L93 Difference]: Finished difference Result 2928 states and 4510 transitions. [2025-03-03 16:06:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:12,537 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-03-03 16:06:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,544 INFO L225 Difference]: With dead ends: 2928 [2025-03-03 16:06:12,544 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 16:06:12,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,545 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-03-03 16:06:12,546 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-03-03 16:06:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 16:06:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-03-03 16:06:12,593 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-03-03 16:06:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3784 transitions. [2025-03-03 16:06:12,602 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3784 transitions. Word has length 48 [2025-03-03 16:06:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:12,602 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3784 transitions. [2025-03-03 16:06:12,602 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-03-03 16:06:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3784 transitions. [2025-03-03 16:06:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 16:06:12,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:12,603 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-03-03 16:06:12,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:06:12,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:12,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-03-03 16:06:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258978677] [2025-03-03 16:06:12,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:12,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 16:06:12,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 16:06:12,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258978677] [2025-03-03 16:06:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258978677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083730009] [2025-03-03 16:06:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:12,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,660 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-03-03 16:06:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,697 INFO L93 Difference]: Finished difference Result 3407 states and 5182 transitions. [2025-03-03 16:06:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:12,697 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-03-03 16:06:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,704 INFO L225 Difference]: With dead ends: 3407 [2025-03-03 16:06:12,705 INFO L226 Difference]: Without dead ends: 2876 [2025-03-03 16:06:12,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:12,706 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-03-03 16:06:12,706 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-03-03 16:06:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-03-03 16:06:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-03-03 16:06:12,747 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-03-03 16:06:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4386 transitions. [2025-03-03 16:06:12,753 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4386 transitions. Word has length 50 [2025-03-03 16:06:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:12,753 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4386 transitions. [2025-03-03 16:06:12,754 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-03-03 16:06:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4386 transitions. [2025-03-03 16:06:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:12,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:12,755 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-03-03 16:06:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:06:12,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-03-03 16:06:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215838904] [2025-03-03 16:06:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:12,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:12,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:06:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215838904] [2025-03-03 16:06:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215838904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925211012] [2025-03-03 16:06:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:12,864 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-03-03 16:06:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:13,001 INFO L93 Difference]: Finished difference Result 8524 states and 12343 transitions. [2025-03-03 16:06:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:13,002 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-03-03 16:06:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:13,026 INFO L225 Difference]: With dead ends: 8524 [2025-03-03 16:06:13,029 INFO L226 Difference]: Without dead ends: 7186 [2025-03-03 16:06:13,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:13,033 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4667 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:13,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3350 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-03-03 16:06:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-03-03 16:06:13,120 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-03-03 16:06:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6250 transitions. [2025-03-03 16:06:13,131 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6250 transitions. Word has length 65 [2025-03-03 16:06:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:13,131 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6250 transitions. [2025-03-03 16:06:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6250 transitions. [2025-03-03 16:06:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:13,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:13,136 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-03-03 16:06:13,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:06:13,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-03-03 16:06:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814275524] [2025-03-03 16:06:13,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:13,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:13,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:06:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814275524] [2025-03-03 16:06:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814275524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851345122] [2025-03-03 16:06:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:13,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:13,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:13,236 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-03-03 16:06:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:13,457 INFO L93 Difference]: Finished difference Result 9860 states and 14207 transitions. [2025-03-03 16:06:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:13,457 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-03-03 16:06:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:13,473 INFO L225 Difference]: With dead ends: 9860 [2025-03-03 16:06:13,474 INFO L226 Difference]: Without dead ends: 8522 [2025-03-03 16:06:13,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:13,477 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-03-03 16:06:13,477 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-03-03 16:06:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-03-03 16:06:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-03-03 16:06:13,640 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-03-03 16:06:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9026 transitions. [2025-03-03 16:06:13,656 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9026 transitions. Word has length 65 [2025-03-03 16:06:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:13,657 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9026 transitions. [2025-03-03 16:06:13,657 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-03-03 16:06:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9026 transitions. [2025-03-03 16:06:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:13,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:13,658 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-03-03 16:06:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:06:13,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:13,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:13,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-03-03 16:06:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099619047] [2025-03-03 16:06:13,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:06:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099619047] [2025-03-03 16:06:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099619047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:13,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173086946] [2025-03-03 16:06:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:13,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:13,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:13,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:13,799 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-03-03 16:06:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:13,968 INFO L93 Difference]: Finished difference Result 11196 states and 16071 transitions. [2025-03-03 16:06:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:13,968 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-03-03 16:06:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:13,984 INFO L225 Difference]: With dead ends: 11196 [2025-03-03 16:06:13,984 INFO L226 Difference]: Without dead ends: 9858 [2025-03-03 16:06:13,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:13,990 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:13,990 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.1s Time] [2025-03-03 16:06:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-03-03 16:06:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-03-03 16:06:14,128 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-03-03 16:06:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 10890 transitions. [2025-03-03 16:06:14,141 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 10890 transitions. Word has length 65 [2025-03-03 16:06:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 10890 transitions. [2025-03-03 16:06:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 10890 transitions. [2025-03-03 16:06:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:06:14,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:14,144 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-03-03 16:06:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:06:14,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-03-03 16:06:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007649294] [2025-03-03 16:06:14,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:14,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:06:14,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:06:14,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:14,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007649294] [2025-03-03 16:06:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007649294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151426404] [2025-03-03 16:06:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:14,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:14,216 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-03-03 16:06:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:14,281 INFO L93 Difference]: Finished difference Result 11896 states and 17031 transitions. [2025-03-03 16:06:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:06:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:14,293 INFO L225 Difference]: With dead ends: 11896 [2025-03-03 16:06:14,294 INFO L226 Difference]: Without dead ends: 5878 [2025-03-03 16:06:14,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:14,301 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-03-03 16:06:14,302 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-03-03 16:06:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2025-03-03 16:06:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2025-03-03 16:06:14,448 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-03-03 16:06:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 8564 transitions. [2025-03-03 16:06:14,459 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 8564 transitions. Word has length 67 [2025-03-03 16:06:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:14,459 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 8564 transitions. [2025-03-03 16:06:14,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 8564 transitions. [2025-03-03 16:06:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:06:14,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:14,460 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-03-03 16:06:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:06:14,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-03-03 16:06:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100265584] [2025-03-03 16:06:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:14,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:06:14,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:06:14,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:14,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:06:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100265584] [2025-03-03 16:06:14,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100265584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:14,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392678375] [2025-03-03 16:06:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:14,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:14,559 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-03-03 16:06:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:14,698 INFO L93 Difference]: Finished difference Result 9726 states and 14009 transitions. [2025-03-03 16:06:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:14,699 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-03-03 16:06:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:14,711 INFO L225 Difference]: With dead ends: 9726 [2025-03-03 16:06:14,711 INFO L226 Difference]: Without dead ends: 8764 [2025-03-03 16:06:14,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:14,715 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4665 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:14,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 3404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2025-03-03 16:06:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 6836. [2025-03-03 16:06:14,826 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-03-03 16:06:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9908 transitions. [2025-03-03 16:06:14,838 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9908 transitions. Word has length 67 [2025-03-03 16:06:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:14,838 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9908 transitions. [2025-03-03 16:06:14,838 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-03-03 16:06:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9908 transitions. [2025-03-03 16:06:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:06:14,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:14,839 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-03-03 16:06:14,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:06:14,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-03-03 16:06:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425665702] [2025-03-03 16:06:14,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:14,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:06:14,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:06:14,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:14,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:14,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425665702] [2025-03-03 16:06:14,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425665702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:14,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:14,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076573547] [2025-03-03 16:06:14,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:14,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:14,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:14,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:14,921 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-03-03 16:06:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:14,982 INFO L93 Difference]: Finished difference Result 9480 states and 13606 transitions. [2025-03-03 16:06:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:14,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 16:06:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:14,989 INFO L225 Difference]: With dead ends: 9480 [2025-03-03 16:06:14,989 INFO L226 Difference]: Without dead ends: 4198 [2025-03-03 16:06:14,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:14,994 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-03-03 16:06:14,994 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-03-03 16:06:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-03-03 16:06:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-03-03 16:06:15,047 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-03-03 16:06:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6168 transitions. [2025-03-03 16:06:15,053 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6168 transitions. Word has length 68 [2025-03-03 16:06:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6168 transitions. [2025-03-03 16:06:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6168 transitions. [2025-03-03 16:06:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:06:15,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:15,054 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-03-03 16:06:15,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:06:15,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-03-03 16:06:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368965770] [2025-03-03 16:06:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:15,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:06:15,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:06:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368965770] [2025-03-03 16:06:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368965770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323475273] [2025-03-03 16:06:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:15,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:15,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:15,131 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-03-03 16:06:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:15,163 INFO L93 Difference]: Finished difference Result 5520 states and 7996 transitions. [2025-03-03 16:06:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:15,164 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-03-03 16:06:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:15,169 INFO L225 Difference]: With dead ends: 5520 [2025-03-03 16:06:15,169 INFO L226 Difference]: Without dead ends: 2878 [2025-03-03 16:06:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:15,172 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-03-03 16:06:15,172 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-03-03 16:06:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-03-03 16:06:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-03-03 16:06:15,204 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-03-03 16:06:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4320 transitions. [2025-03-03 16:06:15,208 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4320 transitions. Word has length 70 [2025-03-03 16:06:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:15,208 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4320 transitions. [2025-03-03 16:06:15,208 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-03-03 16:06:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4320 transitions. [2025-03-03 16:06:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:06:15,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:15,209 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-03-03 16:06:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:06:15,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:15,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-03-03 16:06:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:15,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542007063] [2025-03-03 16:06:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:15,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:06:15,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:06:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:15,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:15,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542007063] [2025-03-03 16:06:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542007063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:15,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746639602] [2025-03-03 16:06:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:15,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:15,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:15,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:15,318 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-03-03 16:06:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:15,338 INFO L93 Difference]: Finished difference Result 3540 states and 5224 transitions. [2025-03-03 16:06:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:15,339 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-03-03 16:06:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:15,342 INFO L225 Difference]: With dead ends: 3540 [2025-03-03 16:06:15,342 INFO L226 Difference]: Without dead ends: 2218 [2025-03-03 16:06:15,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:15,344 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-03-03 16:06:15,344 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-03-03 16:06:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-03-03 16:06:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-03-03 16:06:15,365 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-03-03 16:06:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3407 transitions. [2025-03-03 16:06:15,368 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3407 transitions. Word has length 72 [2025-03-03 16:06:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:15,368 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3407 transitions. [2025-03-03 16:06:15,368 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-03-03 16:06:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3407 transitions. [2025-03-03 16:06:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 16:06:15,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:15,369 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-03-03 16:06:15,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:06:15,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-03-03 16:06:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738238055] [2025-03-03 16:06:15,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:15,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:06:15,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:06:15,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:15,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738238055] [2025-03-03 16:06:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738238055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100461213] [2025-03-03 16:06:16,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:16,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:16,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:16,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:06:16,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:06:16,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:06:16,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:16,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:16,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:06:16,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:16,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100461213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:17,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:06:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518431254] [2025-03-03 16:06:17,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:17,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:06:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:17,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:06:17,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:06:17,147 INFO L87 Difference]: Start difference. First operand 2216 states and 3407 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 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-03-03 16:06:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:20,141 INFO L93 Difference]: Finished difference Result 8272 states and 11455 transitions. [2025-03-03 16:06:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 16:06:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 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-03-03 16:06:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:20,154 INFO L225 Difference]: With dead ends: 8272 [2025-03-03 16:06:20,154 INFO L226 Difference]: Without dead ends: 7536 [2025-03-03 16:06:20,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 16:06:20,159 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 11766 mSDsluCounter, 9491 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11766 SdHoareTripleChecker+Valid, 11008 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:20,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11766 Valid, 11008 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:06:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-03-03 16:06:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-03-03 16:06:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.3752131893121091) internal successors, (9676), 7037 states have internal predecessors, (9676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9676 transitions. [2025-03-03 16:06:20,344 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9676 transitions. Word has length 74 [2025-03-03 16:06:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:20,344 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 9676 transitions. [2025-03-03 16:06:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 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-03-03 16:06:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9676 transitions. [2025-03-03 16:06:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:06:20,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:20,347 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-03-03 16:06:20,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:06:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:20,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:20,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1032286997, now seen corresponding path program 1 times [2025-03-03 16:06:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:20,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008838536] [2025-03-03 16:06:20,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:20,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:20,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:20,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:21,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:21,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008838536] [2025-03-03 16:06:21,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008838536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:21,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543009288] [2025-03-03 16:06:21,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:21,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:21,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:21,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:21,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:06:21,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:21,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:21,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:21,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:06:21,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:21,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543009288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:22,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 31 [2025-03-03 16:06:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380047218] [2025-03-03 16:06:22,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:22,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 16:06:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:22,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 16:06:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:06:22,764 INFO L87 Difference]: Start difference. First operand 7038 states and 9676 transitions. Second operand has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:24,660 INFO L93 Difference]: Finished difference Result 27900 states and 36863 transitions. [2025-03-03 16:06:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 16:06:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 16:06:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:24,693 INFO L225 Difference]: With dead ends: 27900 [2025-03-03 16:06:24,693 INFO L226 Difference]: Without dead ends: 22490 [2025-03-03 16:06:24,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=697, Invalid=3335, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 16:06:24,704 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 14092 mSDsluCounter, 8036 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14092 SdHoareTripleChecker+Valid, 9528 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:24,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14092 Valid, 9528 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:06:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2025-03-03 16:06:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 22326. [2025-03-03 16:06:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22326 states, 22324 states have (on average 1.3158036194230425) internal successors, (29374), 22325 states have internal predecessors, (29374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22326 states to 22326 states and 29374 transitions. [2025-03-03 16:06:25,169 INFO L78 Accepts]: Start accepts. Automaton has 22326 states and 29374 transitions. Word has length 75 [2025-03-03 16:06:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:25,169 INFO L471 AbstractCegarLoop]: Abstraction has 22326 states and 29374 transitions. [2025-03-03 16:06:25,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 22326 states and 29374 transitions. [2025-03-03 16:06:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:06:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:25,171 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-03-03 16:06:25,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:06:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-03 16:06:25,371 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1424546165, now seen corresponding path program 1 times [2025-03-03 16:06:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489286877] [2025-03-03 16:06:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:25,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:25,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:25,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:25,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489286877] [2025-03-03 16:06:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489286877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88465225] [2025-03-03 16:06:25,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:25,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:25,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:06:25,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:25,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:25,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:25,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:06:25,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:26,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88465225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:26,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 16:06:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476079539] [2025-03-03 16:06:26,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:26,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:06:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:26,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:06:26,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:06:26,509 INFO L87 Difference]: Start difference. First operand 22326 states and 29374 transitions. Second operand has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:27,102 INFO L93 Difference]: Finished difference Result 42686 states and 55837 transitions. [2025-03-03 16:06:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:06:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 16:06:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:27,129 INFO L225 Difference]: With dead ends: 42686 [2025-03-03 16:06:27,130 INFO L226 Difference]: Without dead ends: 23218 [2025-03-03 16:06:27,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:06:27,147 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 18125 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18125 SdHoareTripleChecker+Valid, 6116 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:27,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18125 Valid, 6116 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:06:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23218 states. [2025-03-03 16:06:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23218 to 21858. [2025-03-03 16:06:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21858 states, 21856 states have (on average 1.3023883601756954) internal successors, (28465), 21857 states have internal predecessors, (28465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 28465 transitions. [2025-03-03 16:06:27,641 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 28465 transitions. Word has length 75 [2025-03-03 16:06:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 21858 states and 28465 transitions. [2025-03-03 16:06:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 28465 transitions. [2025-03-03 16:06:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:06:27,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:27,642 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-03-03 16:06:27,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:06:27,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:27,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1434856139, now seen corresponding path program 1 times [2025-03-03 16:06:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:27,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193965745] [2025-03-03 16:06:27,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:27,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:27,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:27,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:27,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193965745] [2025-03-03 16:06:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193965745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61030959] [2025-03-03 16:06:28,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:28,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:28,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:06:28,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:28,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:28,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:28,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:28,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:06:28,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:28,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61030959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:29,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:06:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029184341] [2025-03-03 16:06:29,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:29,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:06:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:29,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:06:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:06:29,257 INFO L87 Difference]: Start difference. First operand 21858 states and 28465 transitions. Second operand has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:30,266 INFO L93 Difference]: Finished difference Result 63206 states and 81670 transitions. [2025-03-03 16:06:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:06:30,267 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 16:06:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:30,314 INFO L225 Difference]: With dead ends: 63206 [2025-03-03 16:06:30,314 INFO L226 Difference]: Without dead ends: 43718 [2025-03-03 16:06:30,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:06:30,328 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 12079 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12079 SdHoareTripleChecker+Valid, 6273 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:30,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12079 Valid, 6273 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:06:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43718 states. [2025-03-03 16:06:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43718 to 43170. [2025-03-03 16:06:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43170 states, 43168 states have (on average 1.27515752409192) internal successors, (55046), 43169 states have internal predecessors, (55046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43170 states to 43170 states and 55046 transitions. [2025-03-03 16:06:31,559 INFO L78 Accepts]: Start accepts. Automaton has 43170 states and 55046 transitions. Word has length 75 [2025-03-03 16:06:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:31,559 INFO L471 AbstractCegarLoop]: Abstraction has 43170 states and 55046 transitions. [2025-03-03 16:06:31,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 43170 states and 55046 transitions. [2025-03-03 16:06:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:06:31,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:31,561 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-03-03 16:06:31,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:06:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:31,762 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:31,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1161185343, now seen corresponding path program 1 times [2025-03-03 16:06:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:31,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323511806] [2025-03-03 16:06:31,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:31,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:31,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:31,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323511806] [2025-03-03 16:06:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323511806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:31,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925165276] [2025-03-03 16:06:31,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:31,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:31,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:06:32,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:32,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:32,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:32,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:32,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:06:32,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:32,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925165276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:32,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 16:06:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105202772] [2025-03-03 16:06:32,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:32,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:06:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:32,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:06:32,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:06:32,831 INFO L87 Difference]: Start difference. First operand 43170 states and 55046 transitions. Second operand has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:34,057 INFO L93 Difference]: Finished difference Result 84532 states and 107618 transitions. [2025-03-03 16:06:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:06:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 16:06:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:34,142 INFO L225 Difference]: With dead ends: 84532 [2025-03-03 16:06:34,142 INFO L226 Difference]: Without dead ends: 44854 [2025-03-03 16:06:34,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:06:34,167 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 20806 mSDsluCounter, 6287 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20806 SdHoareTripleChecker+Valid, 7804 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:34,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20806 Valid, 7804 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:06:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-03 16:06:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 42370. [2025-03-03 16:06:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42370 states, 42368 states have (on average 1.2651529456193353) internal successors, (53602), 42369 states have internal predecessors, (53602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42370 states to 42370 states and 53602 transitions. [2025-03-03 16:06:35,433 INFO L78 Accepts]: Start accepts. Automaton has 42370 states and 53602 transitions. Word has length 76 [2025-03-03 16:06:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:35,433 INFO L471 AbstractCegarLoop]: Abstraction has 42370 states and 53602 transitions. [2025-03-03 16:06:35,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 42370 states and 53602 transitions. [2025-03-03 16:06:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:06:35,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:35,435 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-03-03 16:06:35,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 16:06:35,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:06:35,636 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:35,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1571986160, now seen corresponding path program 1 times [2025-03-03 16:06:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:35,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261705572] [2025-03-03 16:06:35,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:06:35,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:06:35,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:35,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261705572] [2025-03-03 16:06:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261705572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067323055] [2025-03-03 16:06:36,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:36,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:36,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:06:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:06:36,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:06:36,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:36,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:36,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 16:06:36,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:39,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067323055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:40,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 45 [2025-03-03 16:06:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938596531] [2025-03-03 16:06:40,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:40,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 16:06:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:40,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 16:06:40,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 16:06:40,902 INFO L87 Difference]: Start difference. First operand 42370 states and 53602 transitions. Second operand has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:54,497 INFO L93 Difference]: Finished difference Result 109534 states and 139245 transitions. [2025-03-03 16:06:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-03 16:06:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 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 77 [2025-03-03 16:06:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:54,595 INFO L225 Difference]: With dead ends: 109534 [2025-03-03 16:06:54,596 INFO L226 Difference]: Without dead ends: 88744 [2025-03-03 16:06:54,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4983 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3330, Invalid=12672, Unknown=0, NotChecked=0, Total=16002 [2025-03-03 16:06:54,616 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 19117 mSDsluCounter, 22452 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19117 SdHoareTripleChecker+Valid, 24011 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:54,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19117 Valid, 24011 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:06:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88744 states. [2025-03-03 16:06:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88744 to 57894. [2025-03-03 16:06:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57894 states, 57892 states have (on average 1.2671008084018518) internal successors, (73355), 57893 states have internal predecessors, (73355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57894 states to 57894 states and 73355 transitions. [2025-03-03 16:06:56,865 INFO L78 Accepts]: Start accepts. Automaton has 57894 states and 73355 transitions. Word has length 77 [2025-03-03 16:06:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 57894 states and 73355 transitions. [2025-03-03 16:06:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 57894 states and 73355 transitions. [2025-03-03 16:06:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:06:56,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:56,868 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-03-03 16:06:56,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 16:06:57,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:57,069 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1286826896, now seen corresponding path program 1 times [2025-03-03 16:06:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422702075] [2025-03-03 16:06:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:57,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:06:57,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:06:57,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:57,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:57,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422702075] [2025-03-03 16:06:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422702075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060557636] [2025-03-03 16:06:57,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:57,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:57,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:57,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:06:57,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:06:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:06:57,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:57,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:06:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:58,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060557636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:59,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 36 [2025-03-03 16:06:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962105224] [2025-03-03 16:06:59,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:59,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 16:06:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:59,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 16:06:59,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 16:06:59,498 INFO L87 Difference]: Start difference. First operand 57894 states and 73355 transitions. Second operand has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:02,706 INFO L93 Difference]: Finished difference Result 79264 states and 99437 transitions. [2025-03-03 16:07:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:07:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 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 77 [2025-03-03 16:07:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:02,760 INFO L225 Difference]: With dead ends: 79264 [2025-03-03 16:07:02,760 INFO L226 Difference]: Without dead ends: 57294 [2025-03-03 16:07:02,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2001, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 16:07:02,771 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 9574 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9574 SdHoareTripleChecker+Valid, 18300 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:02,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9574 Valid, 18300 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:07:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57294 states. [2025-03-03 16:07:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57294 to 50628. [2025-03-03 16:07:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50628 states, 50626 states have (on average 1.2646861296566982) internal successors, (64026), 50627 states have internal predecessors, (64026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50628 states to 50628 states and 64026 transitions. [2025-03-03 16:07:04,394 INFO L78 Accepts]: Start accepts. Automaton has 50628 states and 64026 transitions. Word has length 77 [2025-03-03 16:07:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:04,394 INFO L471 AbstractCegarLoop]: Abstraction has 50628 states and 64026 transitions. [2025-03-03 16:07:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50628 states and 64026 transitions. [2025-03-03 16:07:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:07:04,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:04,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:07:04,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 16:07:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:04,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -221937505, now seen corresponding path program 1 times [2025-03-03 16:07:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893912550] [2025-03-03 16:07:04,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:07:04,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:07:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893912550] [2025-03-03 16:07:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893912550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816861117] [2025-03-03 16:07:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:05,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:05,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:05,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:05,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:07:05,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:07:05,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:07:05,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:05,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 16:07:05,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:08,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816861117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:12,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 25] total 61 [2025-03-03 16:07:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340131112] [2025-03-03 16:07:12,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 16:07:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:12,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 16:07:12,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3189, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:07:12,817 INFO L87 Difference]: Start difference. First operand 50628 states and 64026 transitions. Second operand has 61 states, 61 states have (on average 3.4754098360655736) internal successors, (212), 61 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)