./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19716c7655e34d197f46fa451b10ae0c8c502a032fb57ff83ff50da1b9e9fcc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:47:45,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:47:45,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:47:45,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:47:45,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:47:45,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:47:45,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:47:45,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:47:45,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:47:45,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:47:45,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:47:45,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:47:45,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:47:45,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:47:45,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:47:45,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:47:45,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:47:45,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:47:45,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19716c7655e34d197f46fa451b10ae0c8c502a032fb57ff83ff50da1b9e9fcc5 [2025-02-05 17:47:45,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:47:46,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:47:46,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:47:46,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:47:46,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:47:46,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-02-05 17:47:47,320 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b686be2/2a30840fd265458eaee1e637ce17e6b5/FLAGdb16a4b7b [2025-02-05 17:47:47,936 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:47:47,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-02-05 17:47:47,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b686be2/2a30840fd265458eaee1e637ce17e6b5/FLAGdb16a4b7b [2025-02-05 17:47:47,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b686be2/2a30840fd265458eaee1e637ce17e6b5 [2025-02-05 17:47:47,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:47:48,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:47:48,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:47:48,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:47:48,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:47:48,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:47:47" (1/1) ... [2025-02-05 17:47:48,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30490454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:48, skipping insertion in model container [2025-02-05 17:47:48,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:47:47" (1/1) ... [2025-02-05 17:47:48,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:47:48,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c[20463,20476] [2025-02-05 17:47:48,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c[28211,28224] [2025-02-05 17:47:49,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:47:49,070 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:47:49,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c[20463,20476] [2025-02-05 17:47:49,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c[28211,28224] [2025-02-05 17:47:49,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:47:49,475 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:47:49,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49 WrapperNode [2025-02-05 17:47:49,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:47:49,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:47:49,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:47:49,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:47:49,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:49,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:49,866 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5216 [2025-02-05 17:47:49,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:47:49,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:47:49,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:47:49,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:47:49,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:49,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:49,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:47:50,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:47:50,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:47:50,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:47:50,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:47:50,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (1/1) ... [2025-02-05 17:47:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:47:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:47:50,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:47:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:47:50,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:47:50,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:47:50,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:47:50,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:47:50,577 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:47:50,579 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:47:55,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret48#1; [2025-02-05 17:47:55,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret46#1; [2025-02-05 17:47:55,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret47#1; [2025-02-05 17:47:55,556 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-02-05 17:47:55,557 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:47:55,597 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:47:55,600 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:47:55,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:47:55 BoogieIcfgContainer [2025-02-05 17:47:55,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:47:55,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:47:55,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:47:55,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:47:55,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:47:47" (1/3) ... [2025-02-05 17:47:55,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190edada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:47:55, skipping insertion in model container [2025-02-05 17:47:55,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:47:49" (2/3) ... [2025-02-05 17:47:55,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190edada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:47:55, skipping insertion in model container [2025-02-05 17:47:55,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:47:55" (3/3) ... [2025-02-05 17:47:55,611 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c [2025-02-05 17:47:55,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:47:55,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label09.c that has 1 procedures, 929 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:47:55,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:47:55,775 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;@74d787c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:47:55,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:47:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 17:47:55,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:47:55,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:47:55,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:47:55,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:47:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1420392849, now seen corresponding path program 1 times [2025-02-05 17:47:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:47:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569567496] [2025-02-05 17:47:55,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:47:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:47:55,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 17:47:55,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 17:47:55,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:47:55,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:47:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:47:56,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:47:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569567496] [2025-02-05 17:47:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569567496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:47:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:47:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:47:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747227828] [2025-02-05 17:47:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:47:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:47:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:47:56,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:47:56,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:47:56,110 INFO L87 Difference]: Start difference. First operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:47:56,199 INFO L93 Difference]: Finished difference Result 1802 states and 3416 transitions. [2025-02-05 17:47:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:47:56,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 17:47:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:47:56,224 INFO L225 Difference]: With dead ends: 1802 [2025-02-05 17:47:56,226 INFO L226 Difference]: Without dead ends: 864 [2025-02-05 17:47:56,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:47:56,239 INFO L435 NwaCegarLoop]: 1698 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, 1698 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:47:56,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:47:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-02-05 17:47:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-02-05 17:47:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8932714617169373) internal successors, (1632), 863 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2025-02-05 17:47:56,327 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2025-02-05 17:47:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:47:56,328 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2025-02-05 17:47:56,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2025-02-05 17:47:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 17:47:56,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:47:56,330 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] [2025-02-05 17:47:56,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:47:56,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:47:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:47:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 836518158, now seen corresponding path program 1 times [2025-02-05 17:47:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:47:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477827617] [2025-02-05 17:47:56,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:47:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:47:56,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 17:47:56,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 17:47:56,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:47:56,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:47:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:47:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:47:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477827617] [2025-02-05 17:47:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477827617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:47:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:47:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:47:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973246736] [2025-02-05 17:47:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:47:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:47:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:47:56,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:47:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:47:56,663 INFO L87 Difference]: Start difference. First operand 864 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:47:56,821 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2025-02-05 17:47:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:47:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 17:47:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:47:56,826 INFO L225 Difference]: With dead ends: 922 [2025-02-05 17:47:56,828 INFO L226 Difference]: Without dead ends: 864 [2025-02-05 17:47:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:47:56,830 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:47:56,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:47:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-02-05 17:47:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2025-02-05 17:47:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8352668213457077) internal successors, (1582), 863 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2025-02-05 17:47:56,857 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2025-02-05 17:47:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:47:56,857 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2025-02-05 17:47:56,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:47:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2025-02-05 17:47:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:47:56,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:47:56,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:47:56,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:47:56,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:47:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:47:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1208291531, now seen corresponding path program 1 times [2025-02-05 17:47:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:47:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822232619] [2025-02-05 17:47:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:47:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:47:56,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:47:56,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:47:56,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:47:56,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:47:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:47:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:47:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822232619] [2025-02-05 17:47:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822232619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:47:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:47:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:47:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736966562] [2025-02-05 17:47:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:47:57,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:47:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:47:57,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:47:57,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:47:57,177 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:03,108 INFO L93 Difference]: Finished difference Result 3119 states and 5891 transitions. [2025-02-05 17:48:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:48:03,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:48:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:03,122 INFO L225 Difference]: With dead ends: 3119 [2025-02-05 17:48:03,122 INFO L226 Difference]: Without dead ends: 2366 [2025-02-05 17:48:03,124 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-02-05 17:48:03,124 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2465 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2465 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2465 Valid, 836 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 17:48:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-02-05 17:48:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2025-02-05 17:48:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5634517766497462) internal successors, (3696), 2365 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3696 transitions. [2025-02-05 17:48:03,181 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3696 transitions. Word has length 67 [2025-02-05 17:48:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3696 transitions. [2025-02-05 17:48:03,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3696 transitions. [2025-02-05 17:48:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:48:03,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:03,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:03,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:48:03,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1769088500, now seen corresponding path program 1 times [2025-02-05 17:48:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387785552] [2025-02-05 17:48:03,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:03,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:48:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:48:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:03,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387785552] [2025-02-05 17:48:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387785552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:03,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:03,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864681414] [2025-02-05 17:48:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:03,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:03,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:03,503 INFO L87 Difference]: Start difference. First operand 2366 states and 3696 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:03,887 INFO L93 Difference]: Finished difference Result 3122 states and 4914 transitions. [2025-02-05 17:48:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 17:48:03,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-05 17:48:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:03,903 INFO L225 Difference]: With dead ends: 3122 [2025-02-05 17:48:03,903 INFO L226 Difference]: Without dead ends: 3068 [2025-02-05 17:48:03,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:48:03,905 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11431 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11431 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:03,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11431 Valid, 5337 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:48:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-02-05 17:48:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2418. [2025-02-05 17:48:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.564569536423841) internal successors, (3780), 2417 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3780 transitions. [2025-02-05 17:48:03,970 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3780 transitions. Word has length 77 [2025-02-05 17:48:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:03,971 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3780 transitions. [2025-02-05 17:48:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3780 transitions. [2025-02-05 17:48:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:48:03,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:03,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:03,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:48:03,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:03,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1833353959, now seen corresponding path program 1 times [2025-02-05 17:48:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:03,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963443449] [2025-02-05 17:48:03,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:48:04,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:48:04,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963443449] [2025-02-05 17:48:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963443449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200788639] [2025-02-05 17:48:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:04,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:04,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:04,077 INFO L87 Difference]: Start difference. First operand 2418 states and 3780 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-02-05 17:48:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:04,107 INFO L93 Difference]: Finished difference Result 2619 states and 4103 transitions. [2025-02-05 17:48:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:04,108 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-02-05 17:48:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:04,118 INFO L225 Difference]: With dead ends: 2619 [2025-02-05 17:48:04,119 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 17:48:04,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:04,121 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:04,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 17:48:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2025-02-05 17:48:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5655639697090473) internal successors, (3928), 2510 states have internal predecessors, (3928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3928 transitions. [2025-02-05 17:48:04,218 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3928 transitions. Word has length 79 [2025-02-05 17:48:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3928 transitions. [2025-02-05 17:48:04,219 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-02-05 17:48:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3928 transitions. [2025-02-05 17:48:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:48:04,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:04,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:48:04,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:04,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1865677194, now seen corresponding path program 1 times [2025-02-05 17:48:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240747297] [2025-02-05 17:48:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:04,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:48:04,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:48:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:04,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:04,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240747297] [2025-02-05 17:48:04,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240747297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:04,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:04,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900456703] [2025-02-05 17:48:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:04,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:04,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:04,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:04,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:04,662 INFO L87 Difference]: Start difference. First operand 2511 states and 3928 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-02-05 17:48:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:04,958 INFO L93 Difference]: Finished difference Result 2712 states and 4248 transitions. [2025-02-05 17:48:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-02-05 17:48:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:04,967 INFO L225 Difference]: With dead ends: 2712 [2025-02-05 17:48:04,968 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 17:48:04,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:48:04,969 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 7555 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7555 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7555 Valid, 2077 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 17:48:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2025-02-05 17:48:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5647668393782384) internal successors, (3926), 2510 states have internal predecessors, (3926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3926 transitions. [2025-02-05 17:48:05,025 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3926 transitions. Word has length 79 [2025-02-05 17:48:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:05,026 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3926 transitions. [2025-02-05 17:48:05,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-02-05 17:48:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3926 transitions. [2025-02-05 17:48:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:48:05,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:05,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:05,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:48:05,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:05,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2031955900, now seen corresponding path program 1 times [2025-02-05 17:48:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:05,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668607664] [2025-02-05 17:48:05,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:05,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:48:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:48:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:05,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-02-05 17:48:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668607664] [2025-02-05 17:48:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668607664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:48:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166695627] [2025-02-05 17:48:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:48:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:05,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:48:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:48:05,337 INFO L87 Difference]: Start difference. First operand 2511 states and 3926 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-02-05 17:48:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:05,406 INFO L93 Difference]: Finished difference Result 2519 states and 3935 transitions. [2025-02-05 17:48:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:48:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-02-05 17:48:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:05,417 INFO L225 Difference]: With dead ends: 2519 [2025-02-05 17:48:05,417 INFO L226 Difference]: Without dead ends: 2517 [2025-02-05 17:48:05,418 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-02-05 17:48:05,419 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 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-02-05 17:48:05,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2025-02-05 17:48:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2025-02-05 17:48:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5630218687872763) internal successors, (3931), 2516 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3931 transitions. [2025-02-05 17:48:05,473 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3931 transitions. Word has length 80 [2025-02-05 17:48:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:05,473 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3931 transitions. [2025-02-05 17:48:05,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-02-05 17:48:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3931 transitions. [2025-02-05 17:48:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:05,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:05,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:48:05,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 425497576, now seen corresponding path program 1 times [2025-02-05 17:48:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795845532] [2025-02-05 17:48:05,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:05,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:05,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:05,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:05,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795845532] [2025-02-05 17:48:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795845532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173821220] [2025-02-05 17:48:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:05,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:05,547 INFO L87 Difference]: Start difference. First operand 2517 states and 3931 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:05,580 INFO L93 Difference]: Finished difference Result 2735 states and 4272 transitions. [2025-02-05 17:48:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:05,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:05,590 INFO L225 Difference]: With dead ends: 2735 [2025-02-05 17:48:05,590 INFO L226 Difference]: Without dead ends: 2623 [2025-02-05 17:48:05,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:05,591 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:05,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-02-05 17:48:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2621. [2025-02-05 17:48:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 1.5624284077892325) internal successors, (4092), 2620 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 4092 transitions. [2025-02-05 17:48:05,648 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 4092 transitions. Word has length 81 [2025-02-05 17:48:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 4092 transitions. [2025-02-05 17:48:05,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 4092 transitions. [2025-02-05 17:48:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:05,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:05,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:05,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:48:05,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1894061912, now seen corresponding path program 1 times [2025-02-05 17:48:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461059318] [2025-02-05 17:48:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:05,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:05,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:05,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:05,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:05,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461059318] [2025-02-05 17:48:05,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461059318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:05,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:05,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157094637] [2025-02-05 17:48:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:05,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:05,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:05,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:05,724 INFO L87 Difference]: Start difference. First operand 2621 states and 4092 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:05,756 INFO L93 Difference]: Finished difference Result 3211 states and 5012 transitions. [2025-02-05 17:48:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:05,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:05,767 INFO L225 Difference]: With dead ends: 3211 [2025-02-05 17:48:05,767 INFO L226 Difference]: Without dead ends: 2904 [2025-02-05 17:48:05,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:05,771 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:05,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2025-02-05 17:48:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2902. [2025-02-05 17:48:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2900 states have (on average 1.56) internal successors, (4524), 2901 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 4524 transitions. [2025-02-05 17:48:05,886 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 4524 transitions. Word has length 81 [2025-02-05 17:48:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:05,887 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 4524 transitions. [2025-02-05 17:48:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 4524 transitions. [2025-02-05 17:48:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:05,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:05,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:48:05,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2048430744, now seen corresponding path program 1 times [2025-02-05 17:48:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:05,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198541397] [2025-02-05 17:48:05,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:05,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:05,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:05,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:05,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198541397] [2025-02-05 17:48:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198541397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54483527] [2025-02-05 17:48:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:05,962 INFO L87 Difference]: Start difference. First operand 2902 states and 4524 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:06,003 INFO L93 Difference]: Finished difference Result 4030 states and 6266 transitions. [2025-02-05 17:48:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:06,024 INFO L225 Difference]: With dead ends: 4030 [2025-02-05 17:48:06,024 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 17:48:06,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,031 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:06,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 17:48:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3440. [2025-02-05 17:48:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3438 states have (on average 1.5532286212914486) internal successors, (5340), 3439 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 5340 transitions. [2025-02-05 17:48:06,115 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 5340 transitions. Word has length 81 [2025-02-05 17:48:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 5340 transitions. [2025-02-05 17:48:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 5340 transitions. [2025-02-05 17:48:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:06,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:06,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:48:06,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1267606056, now seen corresponding path program 1 times [2025-02-05 17:48:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638513704] [2025-02-05 17:48:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:06,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:06,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:06,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:06,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638513704] [2025-02-05 17:48:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638513704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300709369] [2025-02-05 17:48:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,187 INFO L87 Difference]: Start difference. First operand 3440 states and 5340 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:06,238 INFO L93 Difference]: Finished difference Result 5596 states and 8630 transitions. [2025-02-05 17:48:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:06,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:06,250 INFO L225 Difference]: With dead ends: 5596 [2025-02-05 17:48:06,250 INFO L226 Difference]: Without dead ends: 4470 [2025-02-05 17:48:06,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,254 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:06,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1752 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2025-02-05 17:48:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4468. [2025-02-05 17:48:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4466 states have (on average 1.5396327810120913) internal successors, (6876), 4467 states have internal predecessors, (6876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 6876 transitions. [2025-02-05 17:48:06,364 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 6876 transitions. Word has length 81 [2025-02-05 17:48:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:06,365 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 6876 transitions. [2025-02-05 17:48:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 6876 transitions. [2025-02-05 17:48:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:06,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:06,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:06,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:48:06,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash 819660520, now seen corresponding path program 1 times [2025-02-05 17:48:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371328171] [2025-02-05 17:48:06,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:06,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:06,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:06,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:06,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371328171] [2025-02-05 17:48:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371328171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700335033] [2025-02-05 17:48:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:06,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:06,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:06,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,442 INFO L87 Difference]: Start difference. First operand 4468 states and 6876 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:06,525 INFO L93 Difference]: Finished difference Result 8584 states and 13070 transitions. [2025-02-05 17:48:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:06,546 INFO L225 Difference]: With dead ends: 8584 [2025-02-05 17:48:06,546 INFO L226 Difference]: Without dead ends: 6430 [2025-02-05 17:48:06,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,553 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:06,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1754 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2025-02-05 17:48:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 6428. [2025-02-05 17:48:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6428 states, 6426 states have (on average 1.5182072829131652) internal successors, (9756), 6427 states have internal predecessors, (9756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6428 states to 6428 states and 9756 transitions. [2025-02-05 17:48:06,699 INFO L78 Accepts]: Start accepts. Automaton has 6428 states and 9756 transitions. Word has length 81 [2025-02-05 17:48:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:06,699 INFO L471 AbstractCegarLoop]: Abstraction has 6428 states and 9756 transitions. [2025-02-05 17:48:06,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9756 transitions. [2025-02-05 17:48:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:06,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:06,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:06,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:48:06,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:06,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836392, now seen corresponding path program 1 times [2025-02-05 17:48:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313921772] [2025-02-05 17:48:06,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:06,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:06,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:06,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313921772] [2025-02-05 17:48:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313921772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786232744] [2025-02-05 17:48:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:06,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:06,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,764 INFO L87 Difference]: Start difference. First operand 6428 states and 9756 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:06,939 INFO L93 Difference]: Finished difference Result 14272 states and 21374 transitions. [2025-02-05 17:48:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:06,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:06,960 INFO L225 Difference]: With dead ends: 14272 [2025-02-05 17:48:06,961 INFO L226 Difference]: Without dead ends: 10158 [2025-02-05 17:48:06,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:06,968 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:06,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1756 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2025-02-05 17:48:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 10156. [2025-02-05 17:48:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10156 states, 10154 states have (on average 1.4902501477250345) internal successors, (15132), 10155 states have internal predecessors, (15132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 15132 transitions. [2025-02-05 17:48:07,210 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 15132 transitions. Word has length 81 [2025-02-05 17:48:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:07,210 INFO L471 AbstractCegarLoop]: Abstraction has 10156 states and 15132 transitions. [2025-02-05 17:48:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 15132 transitions. [2025-02-05 17:48:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:07,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:07,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:48:07,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 748118120, now seen corresponding path program 1 times [2025-02-05 17:48:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372337320] [2025-02-05 17:48:07,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:07,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:48:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:48:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:07,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372337320] [2025-02-05 17:48:07,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372337320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:07,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935767057] [2025-02-05 17:48:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:07,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:07,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:07,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:07,302 INFO L87 Difference]: Start difference. First operand 10156 states and 15132 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:07,522 INFO L93 Difference]: Finished difference Result 25072 states and 36830 transitions. [2025-02-05 17:48:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 17:48:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:07,562 INFO L225 Difference]: With dead ends: 25072 [2025-02-05 17:48:07,562 INFO L226 Difference]: Without dead ends: 17230 [2025-02-05 17:48:07,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:07,577 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:07,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1758 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17230 states. [2025-02-05 17:48:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17230 to 17228. [2025-02-05 17:48:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17228 states, 17226 states have (on average 1.4580285614768373) internal successors, (25116), 17227 states have internal predecessors, (25116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 25116 transitions. [2025-02-05 17:48:08,193 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 25116 transitions. Word has length 81 [2025-02-05 17:48:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:08,193 INFO L471 AbstractCegarLoop]: Abstraction has 17228 states and 25116 transitions. [2025-02-05 17:48:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 25116 transitions. [2025-02-05 17:48:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:08,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:08,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:48:08,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1592050071, now seen corresponding path program 1 times [2025-02-05 17:48:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225875964] [2025-02-05 17:48:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:08,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:08,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:08,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:08,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:48:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225875964] [2025-02-05 17:48:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225875964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585933571] [2025-02-05 17:48:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:08,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:08,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:08,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:08,422 INFO L87 Difference]: Start difference. First operand 17228 states and 25116 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:10,234 INFO L93 Difference]: Finished difference Result 120284 states and 173604 transitions. [2025-02-05 17:48:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:10,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2025-02-05 17:48:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:10,529 INFO L225 Difference]: With dead ends: 120284 [2025-02-05 17:48:10,530 INFO L226 Difference]: Without dead ends: 109786 [2025-02-05 17:48:10,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:48:10,561 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 9793 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9793 SdHoareTripleChecker+Valid, 4808 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:10,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9793 Valid, 4808 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:48:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109786 states. [2025-02-05 17:48:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109786 to 29964. [2025-02-05 17:48:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29964 states, 29962 states have (on average 1.4448968693678659) internal successors, (43292), 29963 states have internal predecessors, (43292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 43292 transitions. [2025-02-05 17:48:11,910 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 43292 transitions. Word has length 104 [2025-02-05 17:48:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 29964 states and 43292 transitions. [2025-02-05 17:48:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 43292 transitions. [2025-02-05 17:48:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:11,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:11,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:48:11,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 383357737, now seen corresponding path program 1 times [2025-02-05 17:48:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833589874] [2025-02-05 17:48:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:11,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:11,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:11,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:11,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:48:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833589874] [2025-02-05 17:48:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833589874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:12,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:12,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923936821] [2025-02-05 17:48:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:12,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:12,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:12,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:12,189 INFO L87 Difference]: Start difference. First operand 29964 states and 43292 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:14,506 INFO L93 Difference]: Finished difference Result 135196 states and 194980 transitions. [2025-02-05 17:48:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:14,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2025-02-05 17:48:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:14,763 INFO L225 Difference]: With dead ends: 135196 [2025-02-05 17:48:14,764 INFO L226 Difference]: Without dead ends: 120282 [2025-02-05 17:48:14,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:48:14,808 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9797 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9797 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:14,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9797 Valid, 4731 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120282 states. [2025-02-05 17:48:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120282 to 50124. [2025-02-05 17:48:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50124 states, 50122 states have (on average 1.437053589242249) internal successors, (72028), 50123 states have internal predecessors, (72028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50124 states to 50124 states and 72028 transitions. [2025-02-05 17:48:16,901 INFO L78 Accepts]: Start accepts. Automaton has 50124 states and 72028 transitions. Word has length 104 [2025-02-05 17:48:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 50124 states and 72028 transitions. [2025-02-05 17:48:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 50124 states and 72028 transitions. [2025-02-05 17:48:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:16,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:16,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:48:16,912 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 228988905, now seen corresponding path program 1 times [2025-02-05 17:48:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348545750] [2025-02-05 17:48:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:16,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:16,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:16,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:48:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348545750] [2025-02-05 17:48:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348545750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574459271] [2025-02-05 17:48:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:17,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:17,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:17,172 INFO L87 Difference]: Start difference. First operand 50124 states and 72028 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:19,982 INFO L93 Difference]: Finished difference Result 150108 states and 216292 transitions. [2025-02-05 17:48:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:19,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2025-02-05 17:48:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:20,131 INFO L225 Difference]: With dead ends: 150108 [2025-02-05 17:48:20,131 INFO L226 Difference]: Without dead ends: 135194 [2025-02-05 17:48:20,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:48:20,162 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9817 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9817 SdHoareTripleChecker+Valid, 4693 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:20,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9817 Valid, 4693 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:48:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135194 states. [2025-02-05 17:48:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135194 to 65036. [2025-02-05 17:48:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65036 states, 65034 states have (on average 1.4352492542362456) internal successors, (93340), 65035 states have internal predecessors, (93340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65036 states to 65036 states and 93340 transitions. [2025-02-05 17:48:22,658 INFO L78 Accepts]: Start accepts. Automaton has 65036 states and 93340 transitions. Word has length 104 [2025-02-05 17:48:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 65036 states and 93340 transitions. [2025-02-05 17:48:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65036 states and 93340 transitions. [2025-02-05 17:48:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:22,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:22,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:22,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:48:22,670 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:22,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash -749941591, now seen corresponding path program 1 times [2025-02-05 17:48:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703212986] [2025-02-05 17:48:22,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:22,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:48:22,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703212986] [2025-02-05 17:48:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703212986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329122550] [2025-02-05 17:48:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:22,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:22,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:22,933 INFO L87 Difference]: Start difference. First operand 65036 states and 93340 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:26,188 INFO L93 Difference]: Finished difference Result 165020 states and 237604 transitions. [2025-02-05 17:48:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 104 [2025-02-05 17:48:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:26,374 INFO L225 Difference]: With dead ends: 165020 [2025-02-05 17:48:26,374 INFO L226 Difference]: Without dead ends: 150106 [2025-02-05 17:48:26,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:48:26,412 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9857 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9857 SdHoareTripleChecker+Valid, 4606 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:26,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9857 Valid, 4606 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150106 states. [2025-02-05 17:48:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150106 to 79948. [2025-02-05 17:48:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79948 states, 79946 states have (on average 1.4341180296700273) internal successors, (114652), 79947 states have internal predecessors, (114652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79948 states to 79948 states and 114652 transitions. [2025-02-05 17:48:28,930 INFO L78 Accepts]: Start accepts. Automaton has 79948 states and 114652 transitions. Word has length 104 [2025-02-05 17:48:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 79948 states and 114652 transitions. [2025-02-05 17:48:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 79948 states and 114652 transitions. [2025-02-05 17:48:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:28,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:28,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:28,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:48:28,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:28,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1197887127, now seen corresponding path program 1 times [2025-02-05 17:48:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262611458] [2025-02-05 17:48:28,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:29,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:29,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:29,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:29,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:48:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262611458] [2025-02-05 17:48:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262611458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751437428] [2025-02-05 17:48:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:29,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:29,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:29,248 INFO L87 Difference]: Start difference. First operand 79948 states and 114652 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:33,274 INFO L93 Difference]: Finished difference Result 179932 states and 258916 transitions. [2025-02-05 17:48:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 104 [2025-02-05 17:48:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:33,506 INFO L225 Difference]: With dead ends: 179932 [2025-02-05 17:48:33,506 INFO L226 Difference]: Without dead ends: 165018 [2025-02-05 17:48:33,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:48:33,544 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9904 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9904 SdHoareTripleChecker+Valid, 4581 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:33,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9904 Valid, 4581 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165018 states. [2025-02-05 17:48:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165018 to 94860. [2025-02-05 17:48:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94860 states, 94858 states have (on average 1.4333424697969597) internal successors, (135964), 94859 states have internal predecessors, (135964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94860 states to 94860 states and 135964 transitions. [2025-02-05 17:48:36,882 INFO L78 Accepts]: Start accepts. Automaton has 94860 states and 135964 transitions. Word has length 104 [2025-02-05 17:48:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:36,883 INFO L471 AbstractCegarLoop]: Abstraction has 94860 states and 135964 transitions. [2025-02-05 17:48:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 94860 states and 135964 transitions. [2025-02-05 17:48:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:48:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:36,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:48:36,889 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -782711255, now seen corresponding path program 1 times [2025-02-05 17:48:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334976311] [2025-02-05 17:48:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:36,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:48:36,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:48:36,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:36,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:48:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334976311] [2025-02-05 17:48:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334976311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420613771] [2025-02-05 17:48:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:37,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:37,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:37,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:37,070 INFO L87 Difference]: Start difference. First operand 94860 states and 135964 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)