./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77efdc70644c4d76b2b51ad31e4c72e04d88f3f8d138a44eb5f8e2813c15326a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:09:51,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:09:51,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:09:51,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:09:51,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:09:51,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:09:51,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:09:51,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:09:51,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:09:51,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:09:51,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:09:51,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:09:51,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:09:51,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:09:51,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:09:51,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:09:51,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:09:51,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:09:51,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:09:51,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:51,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:09:51,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:09:51,372 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 -> 77efdc70644c4d76b2b51ad31e4c72e04d88f3f8d138a44eb5f8e2813c15326a [2025-03-03 16:09:51,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:09:51,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:09:51,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:09:51,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:09:51,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:09:51,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:09:52,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de453417/e5a453ac0e6042e4981662d491851c5a/FLAG3bc11f96f [2025-03-03 16:09:53,183 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:09:53,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:09:53,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de453417/e5a453ac0e6042e4981662d491851c5a/FLAG3bc11f96f [2025-03-03 16:09:53,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de453417/e5a453ac0e6042e4981662d491851c5a [2025-03-03 16:09:53,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:09:53,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:09:53,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:53,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:09:53,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:09:53,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:53" (1/1) ... [2025-03-03 16:09:53,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d0a253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:53, skipping insertion in model container [2025-03-03 16:09:53,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:53" (1/1) ... [2025-03-03 16:09:53,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:09:53,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c[11668,11681] [2025-03-03 16:09:53,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c[18604,18617] [2025-03-03 16:09:53,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:53,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:09:54,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c[11668,11681] [2025-03-03 16:09:54,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c[18604,18617] [2025-03-03 16:09:54,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:54,244 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:09:54,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54 WrapperNode [2025-03-03 16:09:54,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:54,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:54,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:09:54,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:09:54,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,570 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-03 16:09:54,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:54,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:09:54,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:09:54,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:09:54,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,735 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:09:54,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:09:54,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:09:54,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:09:54,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:09:54,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (1/1) ... [2025-03-03 16:09:54,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:54,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:09:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:09:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:09:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:09:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:09:55,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:09:55,084 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:09:55,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:09:58,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-03 16:09:58,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-03 16:09:58,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-03 16:09:58,624 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-03 16:09:58,624 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:09:58,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:09:58,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:09:58,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:58 BoogieIcfgContainer [2025-03-03 16:09:58,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:09:58,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:09:58,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:09:58,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:09:58,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:09:53" (1/3) ... [2025-03-03 16:09:58,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08cd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:58, skipping insertion in model container [2025-03-03 16:09:58,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:54" (2/3) ... [2025-03-03 16:09:58,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08cd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:58, skipping insertion in model container [2025-03-03 16:09:58,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:58" (3/3) ... [2025-03-03 16:09:58,666 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:09:58,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:09:58,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:09:58,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:09:58,739 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;@37b2af29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:09:58,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:09:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 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-03 16:09:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:58,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:58,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:58,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -29917392, now seen corresponding path program 1 times [2025-03-03 16:09:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942246812] [2025-03-03 16:09:58,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:58,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:58,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:58,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942246812] [2025-03-03 16:09:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942246812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628451769] [2025-03-03 16:09:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:09:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:58,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:09:58,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:09:58,972 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 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) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:59,047 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-03-03 16:09:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:09:59,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:09:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:59,060 INFO L225 Difference]: With dead ends: 1762 [2025-03-03 16:09:59,060 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 16:09:59,067 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-03 16:09:59,069 INFO L435 NwaCegarLoop]: 1641 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, 1641 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-03 16:09:59,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 16:09:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-03-03 16:09:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-03-03 16:09:59,150 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-03-03 16:09:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:59,150 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-03-03 16:09:59,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-03-03 16:09:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:59,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:59,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:09:59,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:59,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1026989745, now seen corresponding path program 1 times [2025-03-03 16:09:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821867084] [2025-03-03 16:09:59,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:59,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:59,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:59,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:59,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821867084] [2025-03-03 16:09:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821867084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:09:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411826417] [2025-03-03 16:09:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:09:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:59,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:09:59,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:59,372 INFO L87 Difference]: Start difference. First operand 835 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:59,468 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-03-03 16:09:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:09:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:09:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:59,475 INFO L225 Difference]: With dead ends: 883 [2025-03-03 16:09:59,475 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 16:09:59,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:59,476 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:59,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 16:09:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-03-03 16:09:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-03-03 16:09:59,504 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-03-03 16:09:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:59,504 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-03-03 16:09:59,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-03-03 16:09:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:09:59,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:59,505 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-03 16:09:59,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:09:59,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:59,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1149039, now seen corresponding path program 1 times [2025-03-03 16:09:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558324395] [2025-03-03 16:09:59,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:59,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:09:59,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:09:59,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:59,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558324395] [2025-03-03 16:09:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558324395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:59,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:59,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945297499] [2025-03-03 16:09:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:59,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:59,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:59,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:59,657 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-03 16:09:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:59,854 INFO L93 Difference]: Finished difference Result 1275 states and 2246 transitions. [2025-03-03 16:09:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:09:59,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-03 16:09:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:59,863 INFO L225 Difference]: With dead ends: 1275 [2025-03-03 16:09:59,863 INFO L226 Difference]: Without dead ends: 1231 [2025-03-03 16:09:59,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:09:59,866 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:59,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-03-03 16:09:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 877. [2025-03-03 16:09:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8434285714285714) internal successors, (1613), 876 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1613 transitions. [2025-03-03 16:09:59,890 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1613 transitions. Word has length 54 [2025-03-03 16:09:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:59,890 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1613 transitions. [2025-03-03 16:09:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-03 16:09:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1613 transitions. [2025-03-03 16:09:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:59,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:59,893 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] [2025-03-03 16:09:59,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:09:59,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:59,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 16126764, now seen corresponding path program 1 times [2025-03-03 16:09:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:59,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982044177] [2025-03-03 16:09:59,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:59,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982044177] [2025-03-03 16:09:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982044177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748546409] [2025-03-03 16:09:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:59,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:59,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:59,994 INFO L87 Difference]: Start difference. First operand 877 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:00,026 INFO L93 Difference]: Finished difference Result 1038 states and 1868 transitions. [2025-03-03 16:10:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 16:10:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:00,030 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 16:10:00,030 INFO L226 Difference]: Without dead ends: 952 [2025-03-03 16:10:00,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:00,032 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:00,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-03-03 16:10:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2025-03-03 16:10:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2025-03-03 16:10:00,056 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 56 [2025-03-03 16:10:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2025-03-03 16:10:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2025-03-03 16:10:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:10:00,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:00,059 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] [2025-03-03 16:10:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:10:00,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:00,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash 48449999, now seen corresponding path program 1 times [2025-03-03 16:10:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438897001] [2025-03-03 16:10:00,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:00,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:10:00,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:10:00,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:00,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:00,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438897001] [2025-03-03 16:10:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438897001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:00,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026074174] [2025-03-03 16:10:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:00,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:00,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:00,337 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:00,480 INFO L93 Difference]: Finished difference Result 1107 states and 1971 transitions. [2025-03-03 16:10:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 16:10:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:00,484 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 16:10:00,484 INFO L226 Difference]: Without dead ends: 950 [2025-03-03 16:10:00,484 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-03 16:10:00,484 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 5976 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:00,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 1805 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-03-03 16:10:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2025-03-03 16:10:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2025-03-03 16:10:00,500 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 56 [2025-03-03 16:10:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2025-03-03 16:10:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2025-03-03 16:10:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:10:00,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:00,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:10:00,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:00,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1532487703, now seen corresponding path program 1 times [2025-03-03 16:10:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999524888] [2025-03-03 16:10:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:00,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:10:00,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:10:00,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:00,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999524888] [2025-03-03 16:10:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999524888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:10:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569067458] [2025-03-03 16:10:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:10:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:10:00,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:10:00,724 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:00,783 INFO L93 Difference]: Finished difference Result 956 states and 1730 transitions. [2025-03-03 16:10:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:10:00,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 16:10:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:00,787 INFO L225 Difference]: With dead ends: 956 [2025-03-03 16:10:00,787 INFO L226 Difference]: Without dead ends: 954 [2025-03-03 16:10:00,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:10:00,788 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:00,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-03 16:10:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-03-03 16:10:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.8130252100840336) internal successors, (1726), 953 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1726 transitions. [2025-03-03 16:10:00,804 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1726 transitions. Word has length 57 [2025-03-03 16:10:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:00,804 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1726 transitions. [2025-03-03 16:10:00,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1726 transitions. [2025-03-03 16:10:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:10:00,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:00,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:00,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:10:00,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:00,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1331006163, now seen corresponding path program 1 times [2025-03-03 16:10:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:00,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513500694] [2025-03-03 16:10:00,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:00,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:10:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:10:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513500694] [2025-03-03 16:10:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513500694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852941717] [2025-03-03 16:10:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:00,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:00,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:00,866 INFO L87 Difference]: Start difference. First operand 954 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:00,887 INFO L93 Difference]: Finished difference Result 1264 states and 2198 transitions. [2025-03-03 16:10:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:10:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:00,891 INFO L225 Difference]: With dead ends: 1264 [2025-03-03 16:10:00,891 INFO L226 Difference]: Without dead ends: 1101 [2025-03-03 16:10:00,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:00,892 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:00,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-03 16:10:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-03-03 16:10:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1098 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1943 transitions. [2025-03-03 16:10:00,910 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1943 transitions. Word has length 58 [2025-03-03 16:10:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:00,911 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1943 transitions. [2025-03-03 16:10:00,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1943 transitions. [2025-03-03 16:10:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:10:00,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:00,913 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] [2025-03-03 16:10:00,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:10:00,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951699, now seen corresponding path program 1 times [2025-03-03 16:10:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141856394] [2025-03-03 16:10:00,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:00,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:10:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:10:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141856394] [2025-03-03 16:10:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141856394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625971750] [2025-03-03 16:10:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:00,977 INFO L87 Difference]: Start difference. First operand 1099 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:01,001 INFO L93 Difference]: Finished difference Result 1683 states and 2821 transitions. [2025-03-03 16:10:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:01,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:10:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:01,006 INFO L225 Difference]: With dead ends: 1683 [2025-03-03 16:10:01,006 INFO L226 Difference]: Without dead ends: 1375 [2025-03-03 16:10:01,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,007 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:01,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-03 16:10:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-03-03 16:10:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1371 states have (on average 1.7104303428154632) internal successors, (2345), 1372 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2345 transitions. [2025-03-03 16:10:01,031 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2345 transitions. Word has length 58 [2025-03-03 16:10:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2345 transitions. [2025-03-03 16:10:01,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2345 transitions. [2025-03-03 16:10:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:10:01,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:01,034 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] [2025-03-03 16:10:01,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:10:01,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:01,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1363775827, now seen corresponding path program 1 times [2025-03-03 16:10:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:01,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028659993] [2025-03-03 16:10:01,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:01,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:10:01,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:10:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028659993] [2025-03-03 16:10:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028659993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:01,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100686788] [2025-03-03 16:10:01,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:01,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,081 INFO L87 Difference]: Start difference. First operand 1373 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:01,108 INFO L93 Difference]: Finished difference Result 2473 states and 3971 transitions. [2025-03-03 16:10:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:01,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:10:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:01,114 INFO L225 Difference]: With dead ends: 2473 [2025-03-03 16:10:01,114 INFO L226 Difference]: Without dead ends: 1891 [2025-03-03 16:10:01,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,116 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:01,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-03-03 16:10:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1889. [2025-03-03 16:10:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.634870164281929) internal successors, (3085), 1888 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 3085 transitions. [2025-03-03 16:10:01,153 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 3085 transitions. Word has length 58 [2025-03-03 16:10:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:01,153 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 3085 transitions. [2025-03-03 16:10:01,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3085 transitions. [2025-03-03 16:10:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:10:01,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:01,153 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] [2025-03-03 16:10:01,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:10:01,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:01,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1850494099, now seen corresponding path program 1 times [2025-03-03 16:10:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207930974] [2025-03-03 16:10:01,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:01,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:10:01,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:10:01,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207930974] [2025-03-03 16:10:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207930974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:01,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895517752] [2025-03-03 16:10:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:01,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:01,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:01,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,197 INFO L87 Difference]: Start difference. First operand 1889 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:01,238 INFO L93 Difference]: Finished difference Result 3957 states and 6079 transitions. [2025-03-03 16:10:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:01,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:10:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:01,247 INFO L225 Difference]: With dead ends: 3957 [2025-03-03 16:10:01,247 INFO L226 Difference]: Without dead ends: 2859 [2025-03-03 16:10:01,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,249 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:01,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-03-03 16:10:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2025-03-03 16:10:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2855 states have (on average 1.5541155866900176) internal successors, (4437), 2856 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4437 transitions. [2025-03-03 16:10:01,306 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4437 transitions. Word has length 58 [2025-03-03 16:10:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:01,306 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 4437 transitions. [2025-03-03 16:10:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4437 transitions. [2025-03-03 16:10:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:10:01,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:01,306 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] [2025-03-03 16:10:01,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:10:01,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash 291030893, now seen corresponding path program 1 times [2025-03-03 16:10:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472918179] [2025-03-03 16:10:01,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:10:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:10:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472918179] [2025-03-03 16:10:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472918179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:01,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:01,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64557556] [2025-03-03 16:10:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:01,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:01,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,358 INFO L87 Difference]: Start difference. First operand 2857 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:01,403 INFO L93 Difference]: Finished difference Result 5040 states and 7611 transitions. [2025-03-03 16:10:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:01,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:10:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:01,415 INFO L225 Difference]: With dead ends: 5040 [2025-03-03 16:10:01,415 INFO L226 Difference]: Without dead ends: 3853 [2025-03-03 16:10:01,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:01,417 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:01,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-03-03 16:10:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-03-03 16:10:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5149389451805664) internal successors, (5831), 3850 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5831 transitions. [2025-03-03 16:10:01,579 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5831 transitions. Word has length 60 [2025-03-03 16:10:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5831 transitions. [2025-03-03 16:10:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5831 transitions. [2025-03-03 16:10:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:10:01,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:01,586 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] [2025-03-03 16:10:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:10:01,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 945089098, now seen corresponding path program 1 times [2025-03-03 16:10:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708597855] [2025-03-03 16:10:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:01,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:10:01,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:10:01,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,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-03 16:10:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708597855] [2025-03-03 16:10:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708597855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:01,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:01,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846435440] [2025-03-03 16:10:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:01,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:10:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:01,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:10:01,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:10:01,739 INFO L87 Difference]: Start difference. First operand 3851 states and 5831 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:06,416 INFO L93 Difference]: Finished difference Result 6106 states and 10140 transitions. [2025-03-03 16:10:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:10:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:10:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:06,430 INFO L225 Difference]: With dead ends: 6106 [2025-03-03 16:10:06,430 INFO L226 Difference]: Without dead ends: 5353 [2025-03-03 16:10:06,431 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-03 16:10:06,432 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2395 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:06,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 818 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 16:10:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-03-03 16:10:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5353. [2025-03-03 16:10:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5351 states have (on average 1.4870117735002804) internal successors, (7957), 5352 states have internal predecessors, (7957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7957 transitions. [2025-03-03 16:10:06,530 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7957 transitions. Word has length 60 [2025-03-03 16:10:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:06,530 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7957 transitions. [2025-03-03 16:10:06,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7957 transitions. [2025-03-03 16:10:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:10:06,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:06,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:06,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:10:06,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:06,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1155468229, now seen corresponding path program 1 times [2025-03-03 16:10:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055371587] [2025-03-03 16:10:06,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:06,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:10:06,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:10:06,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:10:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055371587] [2025-03-03 16:10:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055371587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065166751] [2025-03-03 16:10:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:06,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:06,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:06,667 INFO L87 Difference]: Start difference. First operand 5353 states and 7957 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:07,073 INFO L93 Difference]: Finished difference Result 21301 states and 30619 transitions. [2025-03-03 16:10:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:10:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:07,107 INFO L225 Difference]: With dead ends: 21301 [2025-03-03 16:10:07,108 INFO L226 Difference]: Without dead ends: 18243 [2025-03-03 16:10:07,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:10:07,118 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6328 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6328 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:07,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6328 Valid, 3660 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:10:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-03-03 16:10:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 8409. [2025-03-03 16:10:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8407 states have (on average 1.4584275008921137) internal successors, (12261), 8408 states have internal predecessors, (12261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 12261 transitions. [2025-03-03 16:10:07,368 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 12261 transitions. Word has length 77 [2025-03-03 16:10:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 12261 transitions. [2025-03-03 16:10:07,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 12261 transitions. [2025-03-03 16:10:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:10:07,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:07,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:07,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:10:07,371 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:07,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 707522693, now seen corresponding path program 1 times [2025-03-03 16:10:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731289339] [2025-03-03 16:10:07,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:07,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:10:07,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:10:07,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:10:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731289339] [2025-03-03 16:10:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731289339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728336235] [2025-03-03 16:10:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:07,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:07,511 INFO L87 Difference]: Start difference. First operand 8409 states and 12261 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-03 16:10:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:07,844 INFO L93 Difference]: Finished difference Result 24357 states and 34923 transitions. [2025-03-03 16:10:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:07,844 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 77 [2025-03-03 16:10:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:07,876 INFO L225 Difference]: With dead ends: 24357 [2025-03-03 16:10:07,876 INFO L226 Difference]: Without dead ends: 21299 [2025-03-03 16:10:07,884 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-03 16:10:07,884 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 6357 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:07,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 3567 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:10:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2025-03-03 16:10:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 13001. [2025-03-03 16:10:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 12999 states have (on average 1.436802830986999) internal successors, (18677), 13000 states have internal predecessors, (18677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 18677 transitions. [2025-03-03 16:10:08,256 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 18677 transitions. Word has length 77 [2025-03-03 16:10:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 18677 transitions. [2025-03-03 16:10:08,256 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-03 16:10:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 18677 transitions. [2025-03-03 16:10:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:10:08,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:08,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:08,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:10:08,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698565, now seen corresponding path program 1 times [2025-03-03 16:10:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47270453] [2025-03-03 16:10:08,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:08,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:10:08,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:10:08,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:10:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47270453] [2025-03-03 16:10:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47270453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:08,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:08,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765474884] [2025-03-03 16:10:08,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:08,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:08,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:08,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:08,472 INFO L87 Difference]: Start difference. First operand 13001 states and 18677 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-03 16:10:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:08,835 INFO L93 Difference]: Finished difference Result 27413 states and 39227 transitions. [2025-03-03 16:10:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:08,835 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 77 [2025-03-03 16:10:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:08,872 INFO L225 Difference]: With dead ends: 27413 [2025-03-03 16:10:08,873 INFO L226 Difference]: Without dead ends: 24355 [2025-03-03 16:10:08,884 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-03 16:10:08,884 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6394 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6394 SdHoareTripleChecker+Valid, 3577 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-03 16:10:08,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6394 Valid, 3577 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:10:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-03-03 16:10:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 16057. [2025-03-03 16:10:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16057 states, 16055 states have (on average 1.4313920896916847) internal successors, (22981), 16056 states have internal predecessors, (22981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 22981 transitions. [2025-03-03 16:10:09,370 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 22981 transitions. Word has length 77 [2025-03-03 16:10:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:09,370 INFO L471 AbstractCegarLoop]: Abstraction has 16057 states and 22981 transitions. [2025-03-03 16:10:09,371 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-03 16:10:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 22981 transitions. [2025-03-03 16:10:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:10:09,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:09,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:10:09,373 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 635980293, now seen corresponding path program 1 times [2025-03-03 16:10:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498305827] [2025-03-03 16:10:09,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:09,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:10:09,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:10:09,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:09,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:10:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498305827] [2025-03-03 16:10:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498305827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365244601] [2025-03-03 16:10:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:09,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:09,535 INFO L87 Difference]: Start difference. First operand 16057 states and 22981 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-03 16:10:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:10,031 INFO L93 Difference]: Finished difference Result 30469 states and 43531 transitions. [2025-03-03 16:10:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:10,032 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 77 [2025-03-03 16:10:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:10,082 INFO L225 Difference]: With dead ends: 30469 [2025-03-03 16:10:10,082 INFO L226 Difference]: Without dead ends: 27411 [2025-03-03 16:10:10,088 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-03 16:10:10,089 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6343 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6343 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:10,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6343 Valid, 3641 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:10:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2025-03-03 16:10:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 19113. [2025-03-03 16:10:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19113 states, 19111 states have (on average 1.4277117890220292) internal successors, (27285), 19112 states have internal predecessors, (27285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 27285 transitions. [2025-03-03 16:10:10,421 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 27285 transitions. Word has length 77 [2025-03-03 16:10:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 19113 states and 27285 transitions. [2025-03-03 16:10:10,421 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-03 16:10:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 27285 transitions. [2025-03-03 16:10:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:10:10,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:10,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:10:10,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1791105029, now seen corresponding path program 1 times [2025-03-03 16:10:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204169737] [2025-03-03 16:10:10,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:10,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:10:10,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:10:10,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:10,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:10:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204169737] [2025-03-03 16:10:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204169737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:10:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049395159] [2025-03-03 16:10:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:10:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:10:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:10:10,588 INFO L87 Difference]: Start difference. First operand 19113 states and 27285 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-03 16:10:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:10,966 INFO L93 Difference]: Finished difference Result 31765 states and 45403 transitions. [2025-03-03 16:10:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:10:10,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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 79 [2025-03-03 16:10:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:11,000 INFO L225 Difference]: With dead ends: 31765 [2025-03-03 16:10:11,001 INFO L226 Difference]: Without dead ends: 29587 [2025-03-03 16:10:11,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:10:11,011 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6326 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:11,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 3734 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:10:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29587 states. [2025-03-03 16:10:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29587 to 21289. [2025-03-03 16:10:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21289 states, 21287 states have (on average 1.4275849109785315) internal successors, (30389), 21288 states have internal predecessors, (30389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 30389 transitions. [2025-03-03 16:10:11,442 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 30389 transitions. Word has length 79 [2025-03-03 16:10:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:11,442 INFO L471 AbstractCegarLoop]: Abstraction has 21289 states and 30389 transitions. [2025-03-03 16:10:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-03 16:10:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 30389 transitions. [2025-03-03 16:10:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:10:11,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:11,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:11,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:10:11,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash -838885117, now seen corresponding path program 1 times [2025-03-03 16:10:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748381268] [2025-03-03 16:10:11,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:11,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:10:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:10:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748381268] [2025-03-03 16:10:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748381268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927237351] [2025-03-03 16:10:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:11,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:11,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:11,515 INFO L87 Difference]: Start difference. First operand 21289 states and 30389 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:11,772 INFO L93 Difference]: Finished difference Result 35457 states and 50588 transitions. [2025-03-03 16:10:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:10:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:11,792 INFO L225 Difference]: With dead ends: 35457 [2025-03-03 16:10:11,793 INFO L226 Difference]: Without dead ends: 16463 [2025-03-03 16:10:11,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:11,803 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:11,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-03-03 16:10:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16461. [2025-03-03 16:10:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16461 states, 16459 states have (on average 1.4334406707576401) internal successors, (23593), 16460 states have internal predecessors, (23593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 23593 transitions. [2025-03-03 16:10:12,197 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 23593 transitions. Word has length 79 [2025-03-03 16:10:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:12,197 INFO L471 AbstractCegarLoop]: Abstraction has 16461 states and 23593 transitions. [2025-03-03 16:10:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 23593 transitions. [2025-03-03 16:10:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:10:12,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:12,200 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, 1, 1, 1, 1, 1] [2025-03-03 16:10:12,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:10:12,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:12,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash 97319945, now seen corresponding path program 1 times [2025-03-03 16:10:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402579306] [2025-03-03 16:10:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:12,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:10:12,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:10:12,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:12,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:12,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402579306] [2025-03-03 16:10:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402579306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136387346] [2025-03-03 16:10:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:12,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:12,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:12,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:12,290 INFO L87 Difference]: Start difference. First operand 16461 states and 23593 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-03 16:10:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:12,459 INFO L93 Difference]: Finished difference Result 23537 states and 33579 transitions. [2025-03-03 16:10:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:12,459 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-03 16:10:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:12,473 INFO L225 Difference]: With dead ends: 23537 [2025-03-03 16:10:12,473 INFO L226 Difference]: Without dead ends: 9391 [2025-03-03 16:10:12,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:12,485 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 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-03 16:10:12,485 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-03 16:10:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-03-03 16:10:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 9389. [2025-03-03 16:10:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9389 states, 9387 states have (on average 1.4386918078193247) internal successors, (13505), 9388 states have internal predecessors, (13505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9389 states to 9389 states and 13505 transitions. [2025-03-03 16:10:12,693 INFO L78 Accepts]: Start accepts. Automaton has 9389 states and 13505 transitions. Word has length 80 [2025-03-03 16:10:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 9389 states and 13505 transitions. [2025-03-03 16:10:12,693 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-03 16:10:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9389 states and 13505 transitions. [2025-03-03 16:10:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:10:12,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:12,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:10:12,695 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash -755676880, now seen corresponding path program 1 times [2025-03-03 16:10:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106106632] [2025-03-03 16:10:12,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:10:12,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:10:12,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106106632] [2025-03-03 16:10:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106106632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:12,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:12,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047186324] [2025-03-03 16:10:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:12,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:12,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:12,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:12,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:12,792 INFO L87 Difference]: Start difference. First operand 9389 states and 13505 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:12,905 INFO L93 Difference]: Finished difference Result 12929 states and 18447 transitions. [2025-03-03 16:10:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 16:10:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:12,914 INFO L225 Difference]: With dead ends: 12929 [2025-03-03 16:10:12,914 INFO L226 Difference]: Without dead ends: 5855 [2025-03-03 16:10:12,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:12,922 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:12,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2025-03-03 16:10:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5853. [2025-03-03 16:10:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 5851 states have (on average 1.4549649632541446) internal successors, (8513), 5852 states have internal predecessors, (8513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 8513 transitions. [2025-03-03 16:10:13,044 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 8513 transitions. Word has length 82 [2025-03-03 16:10:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:13,044 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 8513 transitions. [2025-03-03 16:10:13,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 8513 transitions. [2025-03-03 16:10:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 16:10:13,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:13,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:10:13,046 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1816537225, now seen corresponding path program 1 times [2025-03-03 16:10:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:13,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900036801] [2025-03-03 16:10:13,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:13,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 16:10:13,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 16:10:13,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:13,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900036801] [2025-03-03 16:10:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900036801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677310849] [2025-03-03 16:10:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:13,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:13,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:13,123 INFO L87 Difference]: Start difference. First operand 5853 states and 8513 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:13,181 INFO L93 Difference]: Finished difference Result 7625 states and 10959 transitions. [2025-03-03 16:10:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 16:10:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:13,186 INFO L225 Difference]: With dead ends: 7625 [2025-03-03 16:10:13,186 INFO L226 Difference]: Without dead ends: 4087 [2025-03-03 16:10:13,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:13,189 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:13,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2025-03-03 16:10:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4085. [2025-03-03 16:10:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.4800391868723977) internal successors, (6043), 4084 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 6043 transitions. [2025-03-03 16:10:13,258 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 6043 transitions. Word has length 84 [2025-03-03 16:10:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 6043 transitions. [2025-03-03 16:10:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 6043 transitions. [2025-03-03 16:10:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 16:10:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:13,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:10:13,260 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1212344610, now seen corresponding path program 1 times [2025-03-03 16:10:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684297524] [2025-03-03 16:10:13,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:10:13,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:10:13,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:13,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684297524] [2025-03-03 16:10:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684297524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:10:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:10:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:10:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206756018] [2025-03-03 16:10:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:10:13,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:10:13,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:13,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:10:13,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:13,324 INFO L87 Difference]: Start difference. First operand 4085 states and 6043 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:13,350 INFO L93 Difference]: Finished difference Result 4973 states and 7254 transitions. [2025-03-03 16:10:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:10:13,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 16:10:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:13,354 INFO L225 Difference]: With dead ends: 4973 [2025-03-03 16:10:13,355 INFO L226 Difference]: Without dead ends: 3203 [2025-03-03 16:10:13,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:10:13,358 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:13,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:10:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-03-03 16:10:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-03-03 16:10:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3199 states have (on average 1.5070334479524852) internal successors, (4821), 3200 states have internal predecessors, (4821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4821 transitions. [2025-03-03 16:10:13,391 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4821 transitions. Word has length 86 [2025-03-03 16:10:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:13,392 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4821 transitions. [2025-03-03 16:10:13,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4821 transitions. [2025-03-03 16:10:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 16:10:13,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:13,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:13,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:10:13,393 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:13,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -705464475, now seen corresponding path program 1 times [2025-03-03 16:10:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458712955] [2025-03-03 16:10:13,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:13,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:10:13,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:10:13,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:13,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458712955] [2025-03-03 16:10:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458712955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856180973] [2025-03-03 16:10:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:14,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:10:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:10:14,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:10:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:14,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:10:14,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:14,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856180973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:14,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:14,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:10:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748368655] [2025-03-03 16:10:14,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:10:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:14,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:10:14,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:10:14,670 INFO L87 Difference]: Start difference. First operand 3201 states and 4821 transitions. Second operand has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:17,852 INFO L93 Difference]: Finished difference Result 11153 states and 15402 transitions. [2025-03-03 16:10:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 16:10:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 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 88 [2025-03-03 16:10:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:17,859 INFO L225 Difference]: With dead ends: 11153 [2025-03-03 16:10:17,859 INFO L226 Difference]: Without dead ends: 10181 [2025-03-03 16:10:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 16:10:17,862 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 15198 mSDsluCounter, 9596 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15198 SdHoareTripleChecker+Valid, 11135 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:17,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15198 Valid, 11135 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:10:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-03-03 16:10:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 9571. [2025-03-03 16:10:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9569 states have (on average 1.3729752325216846) internal successors, (13138), 9570 states have internal predecessors, (13138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 13138 transitions. [2025-03-03 16:10:18,015 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 13138 transitions. Word has length 88 [2025-03-03 16:10:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:18,015 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 13138 transitions. [2025-03-03 16:10:18,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 13138 transitions. [2025-03-03 16:10:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 16:10:18,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:18,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:18,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:10:18,216 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-03 16:10:18,217 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:18,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1536780076, now seen corresponding path program 1 times [2025-03-03 16:10:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948179977] [2025-03-03 16:10:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:10:18,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:10:18,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948179977] [2025-03-03 16:10:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948179977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962547274] [2025-03-03 16:10:18,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:18,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:18,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:18,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:10:18,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:10:18,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:10:18,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:18,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:18,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:10:18,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:19,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962547274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:19,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-03 16:10:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269131493] [2025-03-03 16:10:19,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:19,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 16:10:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 16:10:19,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-03 16:10:19,838 INFO L87 Difference]: Start difference. First operand 9571 states and 13138 transitions. Second operand has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 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-03 16:10:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:20,621 INFO L93 Difference]: Finished difference Result 24405 states and 32663 transitions. [2025-03-03 16:10:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 16:10:20,621 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 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 89 [2025-03-03 16:10:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:20,636 INFO L225 Difference]: With dead ends: 24405 [2025-03-03 16:10:20,636 INFO L226 Difference]: Without dead ends: 17223 [2025-03-03 16:10:20,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 16:10:20,641 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 10663 mSDsluCounter, 6464 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10663 SdHoareTripleChecker+Valid, 7987 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:20,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10663 Valid, 7987 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:10:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2025-03-03 16:10:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 17059. [2025-03-03 16:10:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17059 states, 17057 states have (on average 1.33241484434543) internal successors, (22727), 17058 states have internal predecessors, (22727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 22727 transitions. [2025-03-03 16:10:20,974 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 22727 transitions. Word has length 89 [2025-03-03 16:10:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:20,974 INFO L471 AbstractCegarLoop]: Abstraction has 17059 states and 22727 transitions. [2025-03-03 16:10:20,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 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-03 16:10:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 22727 transitions. [2025-03-03 16:10:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 16:10:20,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:20,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:20,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:10:21,176 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-03 16:10:21,176 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:21,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1731525900, now seen corresponding path program 1 times [2025-03-03 16:10:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582234442] [2025-03-03 16:10:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:10:21,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:10:21,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:21,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582234442] [2025-03-03 16:10:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582234442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256899681] [2025-03-03 16:10:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:21,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:21,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:21,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:10:21,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 16:10:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 16:10:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:21,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:10:21,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:21,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256899681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:22,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:22,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-03 16:10:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331567814] [2025-03-03 16:10:22,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:22,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 16:10:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:22,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 16:10:22,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:10:22,357 INFO L87 Difference]: Start difference. First operand 17059 states and 22727 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:23,844 INFO L93 Difference]: Finished difference Result 48303 states and 63335 transitions. [2025-03-03 16:10:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:10:23,845 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 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 89 [2025-03-03 16:10:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:23,879 INFO L225 Difference]: With dead ends: 48303 [2025-03-03 16:10:23,879 INFO L226 Difference]: Without dead ends: 33703 [2025-03-03 16:10:23,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 16:10:23,896 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 18773 mSDsluCounter, 6929 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18773 SdHoareTripleChecker+Valid, 8494 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:23,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18773 Valid, 8494 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:10:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33703 states. [2025-03-03 16:10:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33703 to 29683. [2025-03-03 16:10:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29683 states, 29681 states have (on average 1.2932178834944914) internal successors, (38384), 29682 states have internal predecessors, (38384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29683 states to 29683 states and 38384 transitions. [2025-03-03 16:10:24,610 INFO L78 Accepts]: Start accepts. Automaton has 29683 states and 38384 transitions. Word has length 89 [2025-03-03 16:10:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 29683 states and 38384 transitions. [2025-03-03 16:10:24,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29683 states and 38384 transitions. [2025-03-03 16:10:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:10:24,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:24,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:24,618 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-03 16:10:24,812 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-03 16:10:24,813 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:24,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1758561150, now seen corresponding path program 1 times [2025-03-03 16:10:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733556064] [2025-03-03 16:10:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:24,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:24,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:24,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733556064] [2025-03-03 16:10:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733556064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254158239] [2025-03-03 16:10:25,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:25,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:25,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:10:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:25,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:10:25,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:25,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254158239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:25,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-03 16:10:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464786158] [2025-03-03 16:10:25,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:10:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:25,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:10:25,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:10:25,984 INFO L87 Difference]: Start difference. First operand 29683 states and 38384 transitions. Second operand has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:27,553 INFO L93 Difference]: Finished difference Result 83069 states and 106133 transitions. [2025-03-03 16:10:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:10:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 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 90 [2025-03-03 16:10:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:27,624 INFO L225 Difference]: With dead ends: 83069 [2025-03-03 16:10:27,624 INFO L226 Difference]: Without dead ends: 56663 [2025-03-03 16:10:27,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:10:27,642 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 12223 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12223 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:27,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12223 Valid, 4831 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:10:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56663 states. [2025-03-03 16:10:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56663 to 56659. [2025-03-03 16:10:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56659 states, 56657 states have (on average 1.275658788852216) internal successors, (72275), 56658 states have internal predecessors, (72275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56659 states to 56659 states and 72275 transitions. [2025-03-03 16:10:29,230 INFO L78 Accepts]: Start accepts. Automaton has 56659 states and 72275 transitions. Word has length 90 [2025-03-03 16:10:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:29,230 INFO L471 AbstractCegarLoop]: Abstraction has 56659 states and 72275 transitions. [2025-03-03 16:10:29,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 56659 states and 72275 transitions. [2025-03-03 16:10:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 16:10:29,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:29,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:29,239 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-03 16:10:29,433 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-03 16:10:29,433 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1872225329, now seen corresponding path program 1 times [2025-03-03 16:10:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048115638] [2025-03-03 16:10:29,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:29,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 16:10:29,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 16:10:29,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048115638] [2025-03-03 16:10:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048115638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201653021] [2025-03-03 16:10:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:29,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:10:29,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 16:10:29,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 16:10:29,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:29,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:29,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:10:29,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:30,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201653021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:31,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-03 16:10:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111921028] [2025-03-03 16:10:31,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 16:10:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:31,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 16:10:31,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:10:31,165 INFO L87 Difference]: Start difference. First operand 56659 states and 72275 transitions. Second operand has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:36,595 INFO L93 Difference]: Finished difference Result 174335 states and 222213 transitions. [2025-03-03 16:10:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 16:10:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 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 91 [2025-03-03 16:10:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:36,736 INFO L225 Difference]: With dead ends: 174335 [2025-03-03 16:10:36,736 INFO L226 Difference]: Without dead ends: 122773 [2025-03-03 16:10:36,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=816, Invalid=3606, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 16:10:36,765 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 19973 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19973 SdHoareTripleChecker+Valid, 15532 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:36,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19973 Valid, 15532 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:10:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122773 states. [2025-03-03 16:10:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122773 to 78355. [2025-03-03 16:10:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78355 states, 78353 states have (on average 1.2606409454647556) internal successors, (98775), 78354 states have internal predecessors, (98775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78355 states to 78355 states and 98775 transitions. [2025-03-03 16:10:39,483 INFO L78 Accepts]: Start accepts. Automaton has 78355 states and 98775 transitions. Word has length 91 [2025-03-03 16:10:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:39,483 INFO L471 AbstractCegarLoop]: Abstraction has 78355 states and 98775 transitions. [2025-03-03 16:10:39,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 78355 states and 98775 transitions. [2025-03-03 16:10:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:10:39,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:39,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:39,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:10:39,685 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-03 16:10:39,686 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:39,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -201120643, now seen corresponding path program 1 times [2025-03-03 16:10:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255673472] [2025-03-03 16:10:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:10:39,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:10:39,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255673472] [2025-03-03 16:10:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255673472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508107631] [2025-03-03 16:10:41,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:41,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:41,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:10:41,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:10:41,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:10:41,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:10:41,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:41,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:41,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 16:10:41,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:45,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508107631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:47,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 17] total 64 [2025-03-03 16:10:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000449989] [2025-03-03 16:10:47,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 16:10:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 16:10:47,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3740, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 16:10:47,287 INFO L87 Difference]: Start difference. First operand 78355 states and 98775 transitions. Second operand has 64 states, 64 states have (on average 3.890625) internal successors, (249), 64 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)