./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.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 229b91e3de975681c9279ff5877f98d2e4ca4fb1a04c4bc6189640654fad2f3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:27:36,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:27:36,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:27:36,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:27:36,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:27:36,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:27:36,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:27:36,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:27:36,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:27:36,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:27:36,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:27:36,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:27:36,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:27:36,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:27:36,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:27:36,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:27:36,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:27:36,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:27:36,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:27:36,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:27:36,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:27:36,180 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 -> 229b91e3de975681c9279ff5877f98d2e4ca4fb1a04c4bc6189640654fad2f3e [2025-03-16 20:27:36,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:27:36,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:27:36,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:27:36,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:27:36,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:27:36,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2025-03-16 20:27:37,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e8bd8a7/1cfbc718464443848b967dd1be214855/FLAG5b8e0a255 [2025-03-16 20:27:38,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:27:38,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2025-03-16 20:27:38,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e8bd8a7/1cfbc718464443848b967dd1be214855/FLAG5b8e0a255 [2025-03-16 20:27:38,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e8bd8a7/1cfbc718464443848b967dd1be214855 [2025-03-16 20:27:38,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:27:38,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:27:38,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:27:38,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:27:38,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:27:38,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:27:38" (1/1) ... [2025-03-16 20:27:38,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b90895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:38, skipping insertion in model container [2025-03-16 20:27:38,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:27:38" (1/1) ... [2025-03-16 20:27:38,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:27:38,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c[11640,11653] [2025-03-16 20:27:38,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c[18930,18943] [2025-03-16 20:27:38,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:27:38,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:27:38,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c[11640,11653] [2025-03-16 20:27:38,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c[18930,18943] [2025-03-16 20:27:39,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:27:39,179 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:27:39,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39 WrapperNode [2025-03-16 20:27:39,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:27:39,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:27:39,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:27:39,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:27:39,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,477 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-03-16 20:27:39,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:27:39,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:27:39,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:27:39,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:27:39,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:27:39,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:27:39,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:27:39,930 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:27:39,930 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:27:39,931 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (1/1) ... [2025-03-16 20:27:39,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:27:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:39,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:27:39,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:27:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:27:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:27:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:27:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:27:40,087 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:27:40,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:27:43,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2025-03-16 20:27:43,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2025-03-16 20:27:43,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2025-03-16 20:27:43,420 INFO L? ?]: Removed 741 outVars from TransFormulas that were not future-live. [2025-03-16 20:27:43,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:27:43,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:27:43,437 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:27:43,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:27:43 BoogieIcfgContainer [2025-03-16 20:27:43,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:27:43,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:27:43,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:27:43,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:27:43,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:27:38" (1/3) ... [2025-03-16 20:27:43,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f52553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:27:43, skipping insertion in model container [2025-03-16 20:27:43,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:27:39" (2/3) ... [2025-03-16 20:27:43,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f52553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:27:43, skipping insertion in model container [2025-03-16 20:27:43,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:27:43" (3/3) ... [2025-03-16 20:27:43,450 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c [2025-03-16 20:27:43,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:27:43,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label02.c that has 1 procedures, 834 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:27:43,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:27:43,539 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;@226d9b35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:27:43,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:27:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 834 states, 831 states have (on average 1.97352587244284) internal successors, (1640), 833 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:27:43,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:43,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:43,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -187127705, now seen corresponding path program 1 times [2025-03-16 20:27:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625416961] [2025-03-16 20:27:43,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:27:43,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:27:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625416961] [2025-03-16 20:27:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625416961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:27:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924420317] [2025-03-16 20:27:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:43,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:27:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:43,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:27:43,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:27:43,761 INFO L87 Difference]: Start difference. First operand has 834 states, 831 states have (on average 1.97352587244284) internal successors, (1640), 833 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:43,839 INFO L93 Difference]: Finished difference Result 1633 states and 3212 transitions. [2025-03-16 20:27:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:27:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 20:27:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:43,853 INFO L225 Difference]: With dead ends: 1633 [2025-03-16 20:27:43,855 INFO L226 Difference]: Without dead ends: 830 [2025-03-16 20:27:43,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:27:43,864 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:43,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-16 20:27:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2025-03-16 20:27:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8973429951690821) internal successors, (1571), 829 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1571 transitions. [2025-03-16 20:27:43,916 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1571 transitions. Word has length 21 [2025-03-16 20:27:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:43,916 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1571 transitions. [2025-03-16 20:27:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1571 transitions. [2025-03-16 20:27:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:27:43,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:43,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:27:43,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1166181992, now seen corresponding path program 1 times [2025-03-16 20:27:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141341789] [2025-03-16 20:27:43,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:27:44,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:27:44,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:44,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:44,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141341789] [2025-03-16 20:27:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141341789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:27:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366147974] [2025-03-16 20:27:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:27:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:44,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:27:44,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:27:44,250 INFO L87 Difference]: Start difference. First operand 830 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:44,378 INFO L93 Difference]: Finished difference Result 874 states and 1640 transitions. [2025-03-16 20:27:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:27:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 20:27:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:44,382 INFO L225 Difference]: With dead ends: 874 [2025-03-16 20:27:44,384 INFO L226 Difference]: Without dead ends: 830 [2025-03-16 20:27:44,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:27:44,385 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 0 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4675 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:44,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4675 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-16 20:27:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2025-03-16 20:27:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8599033816425121) internal successors, (1540), 829 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1540 transitions. [2025-03-16 20:27:44,411 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1540 transitions. Word has length 21 [2025-03-16 20:27:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1540 transitions. [2025-03-16 20:27:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1540 transitions. [2025-03-16 20:27:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:27:44,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:44,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:44,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:27:44,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash 927808490, now seen corresponding path program 1 times [2025-03-16 20:27:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620880461] [2025-03-16 20:27:44,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:44,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:27:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:27:44,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620880461] [2025-03-16 20:27:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620880461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742184156] [2025-03-16 20:27:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:44,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:44,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:44,592 INFO L87 Difference]: Start difference. First operand 830 states and 1540 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:44,819 INFO L93 Difference]: Finished difference Result 1240 states and 2200 transitions. [2025-03-16 20:27:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:27:44,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 20:27:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:44,826 INFO L225 Difference]: With dead ends: 1240 [2025-03-16 20:27:44,826 INFO L226 Difference]: Without dead ends: 1199 [2025-03-16 20:27:44,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:27:44,827 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 7932 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7932 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:44,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7932 Valid, 2825 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-16 20:27:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 869. [2025-03-16 20:27:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 1.8489042675893888) internal successors, (1603), 868 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1603 transitions. [2025-03-16 20:27:44,849 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1603 transitions. Word has length 51 [2025-03-16 20:27:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:44,849 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1603 transitions. [2025-03-16 20:27:44,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1603 transitions. [2025-03-16 20:27:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:27:44,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:44,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:27:44,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:44,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1692056468, now seen corresponding path program 1 times [2025-03-16 20:27:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566056713] [2025-03-16 20:27:44,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:44,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:27:44,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:27:44,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566056713] [2025-03-16 20:27:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566056713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405946681] [2025-03-16 20:27:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:45,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:45,101 INFO L87 Difference]: Start difference. First operand 869 states and 1603 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,249 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2025-03-16 20:27:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 20:27:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,252 INFO L225 Difference]: With dead ends: 951 [2025-03-16 20:27:45,252 INFO L226 Difference]: Without dead ends: 871 [2025-03-16 20:27:45,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:27:45,253 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 2990 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2990 Valid, 1785 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-16 20:27:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2025-03-16 20:27:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 1.8477508650519032) internal successors, (1602), 868 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1602 transitions. [2025-03-16 20:27:45,274 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1602 transitions. Word has length 53 [2025-03-16 20:27:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:45,274 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1602 transitions. [2025-03-16 20:27:45,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1602 transitions. [2025-03-16 20:27:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:27:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:45,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:27:45,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1693099153, now seen corresponding path program 1 times [2025-03-16 20:27:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138054273] [2025-03-16 20:27:45,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:45,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:27:45,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:27:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138054273] [2025-03-16 20:27:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138054273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088024080] [2025-03-16 20:27:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:45,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,346 INFO L87 Difference]: Start difference. First operand 869 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,372 INFO L93 Difference]: Finished difference Result 1018 states and 1839 transitions. [2025-03-16 20:27:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 20:27:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,375 INFO L225 Difference]: With dead ends: 1018 [2025-03-16 20:27:45,375 INFO L226 Difference]: Without dead ends: 938 [2025-03-16 20:27:45,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,376 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1480 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1600 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-16 20:27:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 936. [2025-03-16 20:27:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 934 states have (on average 1.8276231263383298) internal successors, (1707), 935 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1707 transitions. [2025-03-16 20:27:45,396 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1707 transitions. Word has length 53 [2025-03-16 20:27:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:45,396 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1707 transitions. [2025-03-16 20:27:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1707 transitions. [2025-03-16 20:27:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:27:45,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:45,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:45,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:27:45,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:45,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash -913157896, now seen corresponding path program 1 times [2025-03-16 20:27:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953658851] [2025-03-16 20:27:45,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:45,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:27:45,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:27:45,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:45,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953658851] [2025-03-16 20:27:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953658851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:27:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681902325] [2025-03-16 20:27:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:27:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:27:45,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:27:45,630 INFO L87 Difference]: Start difference. First operand 936 states and 1707 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,670 INFO L93 Difference]: Finished difference Result 942 states and 1714 transitions. [2025-03-16 20:27:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:27:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 20:27:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,674 INFO L225 Difference]: With dead ends: 942 [2025-03-16 20:27:45,674 INFO L226 Difference]: Without dead ends: 940 [2025-03-16 20:27:45,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:27:45,676 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 0 mSDsluCounter, 6133 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7669 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7669 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-16 20:27:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2025-03-16 20:27:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 938 states have (on average 1.8230277185501067) internal successors, (1710), 939 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1710 transitions. [2025-03-16 20:27:45,696 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1710 transitions. Word has length 54 [2025-03-16 20:27:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:45,696 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1710 transitions. [2025-03-16 20:27:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1710 transitions. [2025-03-16 20:27:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:27:45,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:45,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:27:45,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1726279118, now seen corresponding path program 1 times [2025-03-16 20:27:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443850046] [2025-03-16 20:27:45,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:27:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:27:45,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443850046] [2025-03-16 20:27:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443850046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32915190] [2025-03-16 20:27:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:45,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,751 INFO L87 Difference]: Start difference. First operand 940 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,768 INFO L93 Difference]: Finished difference Result 1102 states and 1963 transitions. [2025-03-16 20:27:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:27:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,773 INFO L225 Difference]: With dead ends: 1102 [2025-03-16 20:27:45,773 INFO L226 Difference]: Without dead ends: 1018 [2025-03-16 20:27:45,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,774 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1494 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-16 20:27:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2025-03-16 20:27:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1014 states have (on average 1.801775147928994) internal successors, (1827), 1015 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1827 transitions. [2025-03-16 20:27:45,791 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1827 transitions. Word has length 55 [2025-03-16 20:27:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:45,791 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1827 transitions. [2025-03-16 20:27:45,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1827 transitions. [2025-03-16 20:27:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:27:45,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:45,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:45,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:27:45,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:45,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1725329202, now seen corresponding path program 1 times [2025-03-16 20:27:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386965819] [2025-03-16 20:27:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:27:45,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:27:45,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:45,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386965819] [2025-03-16 20:27:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386965819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910883087] [2025-03-16 20:27:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:45,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,863 INFO L87 Difference]: Start difference. First operand 1016 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,882 INFO L93 Difference]: Finished difference Result 1442 states and 2487 transitions. [2025-03-16 20:27:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:27:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,886 INFO L225 Difference]: With dead ends: 1442 [2025-03-16 20:27:45,886 INFO L226 Difference]: Without dead ends: 1217 [2025-03-16 20:27:45,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,887 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1492 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1664 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-16 20:27:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1215. [2025-03-16 20:27:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1213 states have (on average 1.7551525144270403) internal successors, (2129), 1214 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 2129 transitions. [2025-03-16 20:27:45,906 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 2129 transitions. Word has length 55 [2025-03-16 20:27:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 2129 transitions. [2025-03-16 20:27:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 2129 transitions. [2025-03-16 20:27:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:27:45,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:45,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:45,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:27:45,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:45,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -968288562, now seen corresponding path program 1 times [2025-03-16 20:27:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958651604] [2025-03-16 20:27:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:27:45,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:27:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958651604] [2025-03-16 20:27:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958651604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847479208] [2025-03-16 20:27:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:45,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,957 INFO L87 Difference]: Start difference. First operand 1215 states and 2129 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:45,981 INFO L93 Difference]: Finished difference Result 2015 states and 3351 transitions. [2025-03-16 20:27:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:27:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:45,985 INFO L225 Difference]: With dead ends: 2015 [2025-03-16 20:27:45,986 INFO L226 Difference]: Without dead ends: 1591 [2025-03-16 20:27:45,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:45,987 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1488 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:45,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1660 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-16 20:27:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1589. [2025-03-16 20:27:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1587 states have (on average 1.6918714555765595) internal successors, (2685), 1588 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2685 transitions. [2025-03-16 20:27:46,016 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2685 transitions. Word has length 55 [2025-03-16 20:27:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:46,016 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2685 transitions. [2025-03-16 20:27:46,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2685 transitions. [2025-03-16 20:27:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:27:46,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:46,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:46,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:27:46,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1518077490, now seen corresponding path program 1 times [2025-03-16 20:27:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042624852] [2025-03-16 20:27:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:27:46,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:27:46,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:46,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:46,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042624852] [2025-03-16 20:27:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042624852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103058782] [2025-03-16 20:27:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:46,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:46,057 INFO L87 Difference]: Start difference. First operand 1589 states and 2685 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:46,085 INFO L93 Difference]: Finished difference Result 3089 states and 4935 transitions. [2025-03-16 20:27:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:27:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:46,092 INFO L225 Difference]: With dead ends: 3089 [2025-03-16 20:27:46,092 INFO L226 Difference]: Without dead ends: 2291 [2025-03-16 20:27:46,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:46,093 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 1486 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:46,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1662 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-03-16 20:27:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2289. [2025-03-16 20:27:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2287 states have (on average 1.6182772190642762) internal successors, (3701), 2288 states have internal predecessors, (3701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 3701 transitions. [2025-03-16 20:27:46,132 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 3701 transitions. Word has length 55 [2025-03-16 20:27:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:46,133 INFO L471 AbstractCegarLoop]: Abstraction has 2289 states and 3701 transitions. [2025-03-16 20:27:46,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3701 transitions. [2025-03-16 20:27:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:27:46,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:46,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:46,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:27:46,134 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:46,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -902106162, now seen corresponding path program 1 times [2025-03-16 20:27:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738291137] [2025-03-16 20:27:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:46,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:27:46,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:27:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:46,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738291137] [2025-03-16 20:27:46,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738291137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:46,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642506625] [2025-03-16 20:27:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:46,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:46,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:46,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:46,178 INFO L87 Difference]: Start difference. First operand 2289 states and 3701 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:46,224 INFO L93 Difference]: Finished difference Result 5093 states and 7815 transitions. [2025-03-16 20:27:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:27:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:46,237 INFO L225 Difference]: With dead ends: 5093 [2025-03-16 20:27:46,237 INFO L226 Difference]: Without dead ends: 3595 [2025-03-16 20:27:46,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:46,241 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:46,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1666 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2025-03-16 20:27:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3593. [2025-03-16 20:27:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3591 states have (on average 1.5430242272347536) internal successors, (5541), 3592 states have internal predecessors, (5541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5541 transitions. [2025-03-16 20:27:46,311 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5541 transitions. Word has length 55 [2025-03-16 20:27:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:46,311 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 5541 transitions. [2025-03-16 20:27:46,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5541 transitions. [2025-03-16 20:27:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:27:46,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:46,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:27:46,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -582224634, now seen corresponding path program 1 times [2025-03-16 20:27:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521541710] [2025-03-16 20:27:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:46,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:27:46,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:27:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521541710] [2025-03-16 20:27:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521541710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981206729] [2025-03-16 20:27:46,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:27:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:46,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:27:46,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:27:46,412 INFO L87 Difference]: Start difference. First operand 3593 states and 5541 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:50,748 INFO L93 Difference]: Finished difference Result 5848 states and 9850 transitions. [2025-03-16 20:27:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:27:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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 62 [2025-03-16 20:27:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:50,761 INFO L225 Difference]: With dead ends: 5848 [2025-03-16 20:27:50,761 INFO L226 Difference]: Without dead ends: 5095 [2025-03-16 20:27:50,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:27:50,763 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 2396 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:50,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 812 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 20:27:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2025-03-16 20:27:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2025-03-16 20:27:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5093 states have (on average 1.475947378755154) internal successors, (7517), 5094 states have internal predecessors, (7517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7517 transitions. [2025-03-16 20:27:50,844 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7517 transitions. Word has length 62 [2025-03-16 20:27:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:50,845 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7517 transitions. [2025-03-16 20:27:50,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7517 transitions. [2025-03-16 20:27:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:27:50,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:50,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:27:50,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1226706756, now seen corresponding path program 1 times [2025-03-16 20:27:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098307828] [2025-03-16 20:27:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:50,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:27:50,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:27:50,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:27:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098307828] [2025-03-16 20:27:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098307828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:50,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191084220] [2025-03-16 20:27:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:50,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:50,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:50,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:50,972 INFO L87 Difference]: Start difference. First operand 5095 states and 7517 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-16 20:27:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:51,215 INFO L93 Difference]: Finished difference Result 18883 states and 27507 transitions. [2025-03-16 20:27:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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 73 [2025-03-16 20:27:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:51,256 INFO L225 Difference]: With dead ends: 18883 [2025-03-16 20:27:51,256 INFO L226 Difference]: Without dead ends: 16897 [2025-03-16 20:27:51,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:27:51,264 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6340 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6340 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:51,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6340 Valid, 3595 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16897 states. [2025-03-16 20:27:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16897 to 7495. [2025-03-16 20:27:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7495 states, 7493 states have (on average 1.462298144935273) internal successors, (10957), 7494 states have internal predecessors, (10957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7495 states to 7495 states and 10957 transitions. [2025-03-16 20:27:51,502 INFO L78 Accepts]: Start accepts. Automaton has 7495 states and 10957 transitions. Word has length 73 [2025-03-16 20:27:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:51,502 INFO L471 AbstractCegarLoop]: Abstraction has 7495 states and 10957 transitions. [2025-03-16 20:27:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-16 20:27:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7495 states and 10957 transitions. [2025-03-16 20:27:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:27:51,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:51,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:51,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:27:51,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:51,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:51,505 INFO L85 PathProgramCache]: Analyzing trace with hash -383347780, now seen corresponding path program 1 times [2025-03-16 20:27:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639556531] [2025-03-16 20:27:51,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:51,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:27:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:27:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:27:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639556531] [2025-03-16 20:27:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639556531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:51,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641612561] [2025-03-16 20:27:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:51,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:51,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:51,640 INFO L87 Difference]: Start difference. First operand 7495 states and 10957 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:51,923 INFO L93 Difference]: Finished difference Result 21683 states and 31539 transitions. [2025-03-16 20:27:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:27:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:51,954 INFO L225 Difference]: With dead ends: 21683 [2025-03-16 20:27:51,954 INFO L226 Difference]: Without dead ends: 18881 [2025-03-16 20:27:51,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:27:51,964 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 6342 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6342 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:51,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6342 Valid, 3569 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18881 states. [2025-03-16 20:27:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18881 to 11287. [2025-03-16 20:27:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11287 states, 11285 states have (on average 1.4515728843597695) internal successors, (16381), 11286 states have internal predecessors, (16381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11287 states to 11287 states and 16381 transitions. [2025-03-16 20:27:52,384 INFO L78 Accepts]: Start accepts. Automaton has 11287 states and 16381 transitions. Word has length 73 [2025-03-16 20:27:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 11287 states and 16381 transitions. [2025-03-16 20:27:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11287 states and 16381 transitions. [2025-03-16 20:27:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:27:52,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:52,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:52,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:27:52,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash 373692860, now seen corresponding path program 1 times [2025-03-16 20:27:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:52,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052825054] [2025-03-16 20:27:52,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:52,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:27:52,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:27:52,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:27:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:52,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052825054] [2025-03-16 20:27:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052825054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284368812] [2025-03-16 20:27:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:52,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:52,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:52,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:52,505 INFO L87 Difference]: Start difference. First operand 11287 states and 16381 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:52,864 INFO L93 Difference]: Finished difference Result 24483 states and 35555 transitions. [2025-03-16 20:27:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:27:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:52,897 INFO L225 Difference]: With dead ends: 24483 [2025-03-16 20:27:52,897 INFO L226 Difference]: Without dead ends: 21681 [2025-03-16 20:27:52,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:27:52,905 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 6380 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6380 SdHoareTripleChecker+Valid, 3600 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:52,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6380 Valid, 3600 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21681 states. [2025-03-16 20:27:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21681 to 14087. [2025-03-16 20:27:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14087 states, 14085 states have (on average 1.448136315228967) internal successors, (20397), 14086 states have internal predecessors, (20397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14087 states to 14087 states and 20397 transitions. [2025-03-16 20:27:53,200 INFO L78 Accepts]: Start accepts. Automaton has 14087 states and 20397 transitions. Word has length 73 [2025-03-16 20:27:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:53,201 INFO L471 AbstractCegarLoop]: Abstraction has 14087 states and 20397 transitions. [2025-03-16 20:27:53,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 14087 states and 20397 transitions. [2025-03-16 20:27:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:27:53,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:53,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:53,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:27:53,203 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash -176096068, now seen corresponding path program 1 times [2025-03-16 20:27:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:53,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258874410] [2025-03-16 20:27:53,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:53,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:27:53,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:27:53,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:27:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258874410] [2025-03-16 20:27:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258874410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:53,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970890105] [2025-03-16 20:27:53,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:53,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:53,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:53,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:53,293 INFO L87 Difference]: Start difference. First operand 14087 states and 20397 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:53,775 INFO L93 Difference]: Finished difference Result 27283 states and 39571 transitions. [2025-03-16 20:27:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:27:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:53,818 INFO L225 Difference]: With dead ends: 27283 [2025-03-16 20:27:53,818 INFO L226 Difference]: Without dead ends: 24481 [2025-03-16 20:27:53,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:27:53,829 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 6346 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6346 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:53,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6346 Valid, 3598 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2025-03-16 20:27:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 16887. [2025-03-16 20:27:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16887 states, 16885 states have (on average 1.445839502517027) internal successors, (24413), 16886 states have internal predecessors, (24413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16887 states to 16887 states and 24413 transitions. [2025-03-16 20:27:54,202 INFO L78 Accepts]: Start accepts. Automaton has 16887 states and 24413 transitions. Word has length 73 [2025-03-16 20:27:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:54,202 INFO L471 AbstractCegarLoop]: Abstraction has 16887 states and 24413 transitions. [2025-03-16 20:27:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 16887 states and 24413 transitions. [2025-03-16 20:27:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:27:54,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:54,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:54,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:27:54,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:54,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 439875260, now seen corresponding path program 1 times [2025-03-16 20:27:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875705869] [2025-03-16 20:27:54,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:54,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:27:54,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:27:54,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:27:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875705869] [2025-03-16 20:27:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875705869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:27:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298916206] [2025-03-16 20:27:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:54,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:27:54,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:54,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:27:54,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:27:54,324 INFO L87 Difference]: Start difference. First operand 16887 states and 24413 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:54,948 INFO L93 Difference]: Finished difference Result 30083 states and 43587 transitions. [2025-03-16 20:27:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:27:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 20:27:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:54,992 INFO L225 Difference]: With dead ends: 30083 [2025-03-16 20:27:54,992 INFO L226 Difference]: Without dead ends: 27281 [2025-03-16 20:27:55,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:27:55,005 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 6299 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6299 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:55,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6299 Valid, 3677 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:27:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27281 states. [2025-03-16 20:27:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27281 to 19687. [2025-03-16 20:27:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 19685 states have (on average 1.4441960883921767) internal successors, (28429), 19686 states have internal predecessors, (28429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 28429 transitions. [2025-03-16 20:27:55,700 INFO L78 Accepts]: Start accepts. Automaton has 19687 states and 28429 transitions. Word has length 73 [2025-03-16 20:27:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 19687 states and 28429 transitions. [2025-03-16 20:27:55,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 19687 states and 28429 transitions. [2025-03-16 20:27:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:27:55,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:55,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:27:55,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1866088736, now seen corresponding path program 1 times [2025-03-16 20:27:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753771924] [2025-03-16 20:27:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:27:55,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:27:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753771924] [2025-03-16 20:27:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753771924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004679769] [2025-03-16 20:27:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:55,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:55,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:55,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:55,757 INFO L87 Difference]: Start difference. First operand 19687 states and 28429 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:55,993 INFO L93 Difference]: Finished difference Result 37083 states and 53407 transitions. [2025-03-16 20:27:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:55,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 20:27:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:56,016 INFO L225 Difference]: With dead ends: 37083 [2025-03-16 20:27:56,016 INFO L226 Difference]: Without dead ends: 19689 [2025-03-16 20:27:56,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:56,032 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 45 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:56,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19689 states. [2025-03-16 20:27:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19689 to 19687. [2025-03-16 20:27:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 19685 states have (on average 1.4291592583185166) internal successors, (28133), 19686 states have internal predecessors, (28133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 28133 transitions. [2025-03-16 20:27:56,374 INFO L78 Accepts]: Start accepts. Automaton has 19687 states and 28133 transitions. Word has length 74 [2025-03-16 20:27:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:56,374 INFO L471 AbstractCegarLoop]: Abstraction has 19687 states and 28133 transitions. [2025-03-16 20:27:56,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 19687 states and 28133 transitions. [2025-03-16 20:27:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:27:56,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:56,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:27:56,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1007153086, now seen corresponding path program 1 times [2025-03-16 20:27:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889493315] [2025-03-16 20:27:56,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:56,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:27:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:27:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889493315] [2025-03-16 20:27:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889493315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566224395] [2025-03-16 20:27:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:56,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:56,439 INFO L87 Difference]: Start difference. First operand 19687 states and 28133 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:56,618 INFO L93 Difference]: Finished difference Result 26157 states and 37410 transitions. [2025-03-16 20:27:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 20:27:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:56,627 INFO L225 Difference]: With dead ends: 26157 [2025-03-16 20:27:56,627 INFO L226 Difference]: Without dead ends: 8763 [2025-03-16 20:27:56,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:56,639 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 39 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:56,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3099 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8763 states. [2025-03-16 20:27:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8763 to 8756. [2025-03-16 20:27:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8756 states, 8754 states have (on average 1.4413982179575051) internal successors, (12618), 8755 states have internal predecessors, (12618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 12618 transitions. [2025-03-16 20:27:56,771 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 12618 transitions. Word has length 75 [2025-03-16 20:27:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:56,771 INFO L471 AbstractCegarLoop]: Abstraction has 8756 states and 12618 transitions. [2025-03-16 20:27:56,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 12618 transitions. [2025-03-16 20:27:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:27:56,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:56,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:56,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:27:56,772 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:56,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2140444505, now seen corresponding path program 1 times [2025-03-16 20:27:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233166990] [2025-03-16 20:27:56,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:56,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:27:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:27:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233166990] [2025-03-16 20:27:56,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233166990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:56,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:56,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:56,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225461009] [2025-03-16 20:27:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:56,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:56,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:56,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:56,837 INFO L87 Difference]: Start difference. First operand 8756 states and 12618 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:56,901 INFO L93 Difference]: Finished difference Result 11984 states and 17196 transitions. [2025-03-16 20:27:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:27:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:56,909 INFO L225 Difference]: With dead ends: 11984 [2025-03-16 20:27:56,909 INFO L226 Difference]: Without dead ends: 5534 [2025-03-16 20:27:56,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:56,916 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 41 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:56,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3078 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2025-03-16 20:27:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5532. [2025-03-16 20:27:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5532 states, 5530 states have (on average 1.4448462929475587) internal successors, (7990), 5531 states have internal predecessors, (7990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 7990 transitions. [2025-03-16 20:27:56,990 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 7990 transitions. Word has length 76 [2025-03-16 20:27:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:56,990 INFO L471 AbstractCegarLoop]: Abstraction has 5532 states and 7990 transitions. [2025-03-16 20:27:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 7990 transitions. [2025-03-16 20:27:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:27:56,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:56,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:27:56,993 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -193449262, now seen corresponding path program 1 times [2025-03-16 20:27:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256397001] [2025-03-16 20:27:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:57,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:27:57,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:27:57,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:57,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256397001] [2025-03-16 20:27:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256397001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25931857] [2025-03-16 20:27:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:57,052 INFO L87 Difference]: Start difference. First operand 5532 states and 7990 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:57,091 INFO L93 Difference]: Finished difference Result 7148 states and 10254 transitions. [2025-03-16 20:27:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:27:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:57,096 INFO L225 Difference]: With dead ends: 7148 [2025-03-16 20:27:57,097 INFO L226 Difference]: Without dead ends: 3922 [2025-03-16 20:27:57,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:57,102 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 38 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:57,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3063 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2025-03-16 20:27:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3920. [2025-03-16 20:27:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3918 states have (on average 1.4553343542623787) internal successors, (5702), 3919 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5702 transitions. [2025-03-16 20:27:57,145 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5702 transitions. Word has length 78 [2025-03-16 20:27:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:57,146 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 5702 transitions. [2025-03-16 20:27:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5702 transitions. [2025-03-16 20:27:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:27:57,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:57,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:27:57,147 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:57,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1642733899, now seen corresponding path program 1 times [2025-03-16 20:27:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:57,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897255572] [2025-03-16 20:27:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:27:57,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:27:57,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:57,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897255572] [2025-03-16 20:27:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897255572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:27:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:27:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:27:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847274604] [2025-03-16 20:27:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:27:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:27:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:27:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:57,199 INFO L87 Difference]: Start difference. First operand 3920 states and 5702 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:57,226 INFO L93 Difference]: Finished difference Result 4730 states and 6822 transitions. [2025-03-16 20:27:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:27:57,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 20:27:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:57,230 INFO L225 Difference]: With dead ends: 4730 [2025-03-16 20:27:57,231 INFO L226 Difference]: Without dead ends: 3116 [2025-03-16 20:27:57,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:27:57,233 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 35 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:57,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3048 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:27:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2025-03-16 20:27:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3114. [2025-03-16 20:27:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3112 states have (on average 1.4688303341902313) internal successors, (4571), 3113 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4571 transitions. [2025-03-16 20:27:57,268 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4571 transitions. Word has length 80 [2025-03-16 20:27:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:57,268 INFO L471 AbstractCegarLoop]: Abstraction has 3114 states and 4571 transitions. [2025-03-16 20:27:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4571 transitions. [2025-03-16 20:27:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:27:57,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:57,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:57,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:27:57,270 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:57,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1248595260, now seen corresponding path program 1 times [2025-03-16 20:27:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:57,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73060921] [2025-03-16 20:27:57,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:57,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:27:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:27:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:27:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73060921] [2025-03-16 20:27:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73060921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785778768] [2025-03-16 20:27:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:57,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:27:57,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:27:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:27:57,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:57,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:27:57,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:27:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:57,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:27:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785778768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:27:58,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:27:58,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-03-16 20:27:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866991897] [2025-03-16 20:27:58,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:27:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 20:27:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:27:58,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 20:27:58,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:27:58,512 INFO L87 Difference]: Start difference. First operand 3114 states and 4571 transitions. Second operand has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:27:59,222 INFO L93 Difference]: Finished difference Result 5617 states and 7906 transitions. [2025-03-16 20:27:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 20:27:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 20:27:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:27:59,227 INFO L225 Difference]: With dead ends: 5617 [2025-03-16 20:27:59,228 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 20:27:59,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=410, Invalid=1312, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 20:27:59,230 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 12568 mSDsluCounter, 4833 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12568 SdHoareTripleChecker+Valid, 6339 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:27:59,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12568 Valid, 6339 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:27:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 20:27:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4653. [2025-03-16 20:27:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4651 states have (on average 1.401849064717265) internal successors, (6520), 4652 states have internal predecessors, (6520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 6520 transitions. [2025-03-16 20:27:59,294 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 6520 transitions. Word has length 82 [2025-03-16 20:27:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:27:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 4653 states and 6520 transitions. [2025-03-16 20:27:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 20 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:27:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 6520 transitions. [2025-03-16 20:27:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 20:27:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:27:59,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:27:59,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:27:59,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 20:27:59,496 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:27:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:27:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 59366805, now seen corresponding path program 1 times [2025-03-16 20:27:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:27:59,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481639953] [2025-03-16 20:27:59,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:27:59,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 20:27:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 20:27:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:27:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:27:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481639953] [2025-03-16 20:27:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481639953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:27:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155503156] [2025-03-16 20:27:59,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:27:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:27:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:27:59,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:27:59,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:27:59,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 20:27:59,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 20:27:59,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:27:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:27:59,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:27:59,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:00,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155503156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:00,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-16 20:28:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533137757] [2025-03-16 20:28:00,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:00,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 20:28:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 20:28:00,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-16 20:28:00,873 INFO L87 Difference]: Start difference. First operand 4653 states and 6520 transitions. Second operand has 26 states, 26 states have (on average 8.961538461538462) internal successors, (233), 25 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:01,826 INFO L93 Difference]: Finished difference Result 10975 states and 14836 transitions. [2025-03-16 20:28:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:28:01,827 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.961538461538462) internal successors, (233), 25 states have internal predecessors, (233), 0 states have call successors, (0), 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 83 [2025-03-16 20:28:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:01,835 INFO L225 Difference]: With dead ends: 10975 [2025-03-16 20:28:01,835 INFO L226 Difference]: Without dead ends: 8756 [2025-03-16 20:28:01,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 20:28:01,839 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 17050 mSDsluCounter, 8036 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17050 SdHoareTripleChecker+Valid, 9543 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:01,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17050 Valid, 9543 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:28:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8756 states. [2025-03-16 20:28:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8756 to 8722. [2025-03-16 20:28:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8722 states, 8720 states have (on average 1.3472477064220183) internal successors, (11748), 8721 states have internal predecessors, (11748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 11748 transitions. [2025-03-16 20:28:01,984 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 11748 transitions. Word has length 83 [2025-03-16 20:28:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:01,984 INFO L471 AbstractCegarLoop]: Abstraction has 8722 states and 11748 transitions. [2025-03-16 20:28:01,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.961538461538462) internal successors, (233), 25 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 11748 transitions. [2025-03-16 20:28:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:28:01,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:01,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:01,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:28:02,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 20:28:02,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 897404719, now seen corresponding path program 1 times [2025-03-16 20:28:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869172791] [2025-03-16 20:28:02,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:02,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:02,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869172791] [2025-03-16 20:28:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869172791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350250567] [2025-03-16 20:28:02,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:02,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:02,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:02,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:02,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:28:02,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:02,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 20:28:02,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:03,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350250567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:05,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:05,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 37 [2025-03-16 20:28:05,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11155972] [2025-03-16 20:28:05,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:05,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 20:28:05,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:05,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 20:28:05,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 20:28:05,236 INFO L87 Difference]: Start difference. First operand 8722 states and 11748 transitions. Second operand has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:17,177 INFO L93 Difference]: Finished difference Result 50515 states and 66702 transitions. [2025-03-16 20:28:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-03-16 20:28:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 20:28:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:17,222 INFO L225 Difference]: With dead ends: 50515 [2025-03-16 20:28:17,222 INFO L226 Difference]: Without dead ends: 44361 [2025-03-16 20:28:17,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10748 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=5023, Invalid=25427, Unknown=0, NotChecked=0, Total=30450 [2025-03-16 20:28:17,239 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 20138 mSDsluCounter, 15951 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20138 SdHoareTripleChecker+Valid, 17544 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:17,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20138 Valid, 17544 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:28:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44361 states. [2025-03-16 20:28:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44361 to 31785. [2025-03-16 20:28:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31785 states, 31783 states have (on average 1.3018594846301481) internal successors, (41377), 31784 states have internal predecessors, (41377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31785 states to 31785 states and 41377 transitions. [2025-03-16 20:28:18,161 INFO L78 Accepts]: Start accepts. Automaton has 31785 states and 41377 transitions. Word has length 84 [2025-03-16 20:28:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:18,161 INFO L471 AbstractCegarLoop]: Abstraction has 31785 states and 41377 transitions. [2025-03-16 20:28:18,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31785 states and 41377 transitions. [2025-03-16 20:28:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:28:18,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:18,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:18,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:28:18,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:18,364 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2123585233, now seen corresponding path program 1 times [2025-03-16 20:28:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:18,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043923534] [2025-03-16 20:28:18,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:18,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:18,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043923534] [2025-03-16 20:28:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043923534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952461382] [2025-03-16 20:28:19,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:19,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:19,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:28:19,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:19,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:19,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:19,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:19,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:28:19,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:19,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952461382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:20,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-16 20:28:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669468459] [2025-03-16 20:28:20,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:20,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:28:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:20,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:28:20,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:28:20,564 INFO L87 Difference]: Start difference. First operand 31785 states and 41377 transitions. Second operand has 30 states, 30 states have (on average 7.633333333333334) internal successors, (229), 30 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:22,568 INFO L93 Difference]: Finished difference Result 57235 states and 74738 transitions. [2025-03-16 20:28:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 20:28:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.633333333333334) internal successors, (229), 30 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:28:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:22,620 INFO L225 Difference]: With dead ends: 57235 [2025-03-16 20:28:22,620 INFO L226 Difference]: Without dead ends: 47584 [2025-03-16 20:28:22,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:28:22,632 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 11513 mSDsluCounter, 15174 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11513 SdHoareTripleChecker+Valid, 16681 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:22,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11513 Valid, 16681 Invalid, 810 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:28:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47584 states. [2025-03-16 20:28:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47584 to 29701. [2025-03-16 20:28:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29701 states, 29699 states have (on average 1.3021313848951144) internal successors, (38672), 29700 states have internal predecessors, (38672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29701 states to 29701 states and 38672 transitions. [2025-03-16 20:28:23,588 INFO L78 Accepts]: Start accepts. Automaton has 29701 states and 38672 transitions. Word has length 86 [2025-03-16 20:28:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:23,588 INFO L471 AbstractCegarLoop]: Abstraction has 29701 states and 38672 transitions. [2025-03-16 20:28:23,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.633333333333334) internal successors, (229), 30 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 29701 states and 38672 transitions. [2025-03-16 20:28:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:28:23,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:23,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:23,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:28:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:28:23,789 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -846928305, now seen corresponding path program 1 times [2025-03-16 20:28:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421801300] [2025-03-16 20:28:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:23,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:23,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:23,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421801300] [2025-03-16 20:28:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421801300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040132286] [2025-03-16 20:28:24,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:24,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:28:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:28:24,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:28:24,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:24,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-16 20:28:24,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:28,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040132286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:34,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 31, 30] total 69 [2025-03-16 20:28:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185526224] [2025-03-16 20:28:34,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-16 20:28:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:34,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-16 20:28:34,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=3913, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 20:28:34,639 INFO L87 Difference]: Start difference. First operand 29701 states and 38672 transitions. Second operand has 69 states, 69 states have (on average 3.246376811594203) internal successors, (224), 69 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:51,487 INFO L93 Difference]: Finished difference Result 47107 states and 60682 transitions. [2025-03-16 20:28:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-16 20:28:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.246376811594203) internal successors, (224), 69 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:28:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:51,517 INFO L225 Difference]: With dead ends: 47107 [2025-03-16 20:28:51,517 INFO L226 Difference]: Without dead ends: 33134 [2025-03-16 20:28:51,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7338 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=4993, Invalid=18877, Unknown=0, NotChecked=0, Total=23870 [2025-03-16 20:28:51,526 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 24206 mSDsluCounter, 24971 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24206 SdHoareTripleChecker+Valid, 26511 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:51,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24206 Valid, 26511 Invalid, 3719 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [115 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 20:28:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33134 states. [2025-03-16 20:28:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33134 to 28748. [2025-03-16 20:28:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28748 states, 28746 states have (on average 1.2973283239407223) internal successors, (37293), 28747 states have internal predecessors, (37293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28748 states to 28748 states and 37293 transitions. [2025-03-16 20:28:52,325 INFO L78 Accepts]: Start accepts. Automaton has 28748 states and 37293 transitions. Word has length 86 [2025-03-16 20:28:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:52,326 INFO L471 AbstractCegarLoop]: Abstraction has 28748 states and 37293 transitions. [2025-03-16 20:28:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.246376811594203) internal successors, (224), 69 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28748 states and 37293 transitions. [2025-03-16 20:28:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:28:52,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:52,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:52,333 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-16 20:28:52,527 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,SelfDestructingSolverStorable26 [2025-03-16 20:28:52,527 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash -352563379, now seen corresponding path program 1 times [2025-03-16 20:28:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257713022] [2025-03-16 20:28:52,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:52,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257713022] [2025-03-16 20:28:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257713022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45692997] [2025-03-16 20:28:53,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:53,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:53,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:28:53,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:53,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:53,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:28:53,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:53,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45692997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:54,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 41 [2025-03-16 20:28:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166049086] [2025-03-16 20:28:54,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:54,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 20:28:54,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:54,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 20:28:54,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:28:54,592 INFO L87 Difference]: Start difference. First operand 28748 states and 37293 transitions. Second operand has 41 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)