./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:10:45,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:10:45,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:10:45,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:10:45,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:10:45,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:10:45,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:10:45,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:10:45,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:10:45,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:10:45,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:10:45,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:10:45,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:10:45,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:10:45,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:10:45,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:10:45,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:10:45,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:10:45,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:10:45,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 [2025-03-03 15:10:45,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:10:45,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:10:45,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:10:45,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:10:45,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:10:45,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:10:47,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe7a6f07/f618e30c243c41b5ad97d21f7802a144/FLAGc2a8034cb [2025-03-03 15:10:47,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:10:47,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:10:47,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe7a6f07/f618e30c243c41b5ad97d21f7802a144/FLAGc2a8034cb [2025-03-03 15:10:47,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe7a6f07/f618e30c243c41b5ad97d21f7802a144 [2025-03-03 15:10:47,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:10:47,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:10:47,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:10:47,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:10:47,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:10:47,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195a8129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47, skipping insertion in model container [2025-03-03 15:10:47,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:10:47,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-03 15:10:47,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:10:47,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:10:47,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-03 15:10:47,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:10:47,746 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:10:47,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47 WrapperNode [2025-03-03 15:10:47,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:10:47,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:10:47,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:10:47,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:10:47,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,789 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1006 [2025-03-03 15:10:47,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:10:47,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:10:47,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:10:47,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:10:47,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:10:47,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:10:47,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:10:47,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:10:47,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:10:47,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (1/1) ... [2025-03-03 15:10:47,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:10:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:10:47,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:10:47,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:10:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:10:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:10:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:10:47,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:10:48,003 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:10:48,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3__m3~2#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node5__m5~2#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node6____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:48,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_~node2__m2~2#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4__m4~2#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:10:48,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1323: havoc main_~node6____CPAchecker_TMP_1~1#1; [2025-03-03 15:10:48,821 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-03 15:10:48,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:10:48,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:10:48,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:10:48,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:10:48 BoogieIcfgContainer [2025-03-03 15:10:48,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:10:48,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:10:48,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:10:48,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:10:48,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:10:47" (1/3) ... [2025-03-03 15:10:48,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45205721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:10:48, skipping insertion in model container [2025-03-03 15:10:48,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:10:47" (2/3) ... [2025-03-03 15:10:48,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45205721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:10:48, skipping insertion in model container [2025-03-03 15:10:48,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:10:48" (3/3) ... [2025-03-03 15:10:48,845 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:10:48,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:10:48,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 249 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:10:48,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:10:48,912 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;@70fcb8fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:10:48,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:10:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 247 states have (on average 1.7246963562753037) internal successors, (426), 248 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:10:48,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:48,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:48,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash 779372886, now seen corresponding path program 1 times [2025-03-03 15:10:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600498141] [2025-03-03 15:10:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:49,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:10:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:10:49,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:49,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600498141] [2025-03-03 15:10:49,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600498141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:49,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853636471] [2025-03-03 15:10:49,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:10:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:49,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:10:49,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:10:49,605 INFO L87 Difference]: Start difference. First operand has 249 states, 247 states have (on average 1.7246963562753037) internal successors, (426), 248 states have internal predecessors, (426), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-03-03 15:10:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:49,910 INFO L93 Difference]: Finished difference Result 1119 states and 1815 transitions. [2025-03-03 15:10:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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 95 [2025-03-03 15:10:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:49,923 INFO L225 Difference]: With dead ends: 1119 [2025-03-03 15:10:49,924 INFO L226 Difference]: Without dead ends: 983 [2025-03-03 15:10:49,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:10:49,928 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3358 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3358 SdHoareTripleChecker+Valid, 4384 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:49,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3358 Valid, 4384 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-03 15:10:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 381. [2025-03-03 15:10:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 572 transitions. [2025-03-03 15:10:49,993 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 572 transitions. Word has length 95 [2025-03-03 15:10:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:49,996 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 572 transitions. [2025-03-03 15:10:49,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-03-03 15:10:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 572 transitions. [2025-03-03 15:10:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:10:49,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:49,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:50,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:10:50,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1608282555, now seen corresponding path program 1 times [2025-03-03 15:10:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:50,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599857266] [2025-03-03 15:10:50,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:50,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:10:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:10:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599857266] [2025-03-03 15:10:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599857266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:50,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403187632] [2025-03-03 15:10:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:50,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:10:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:50,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:10:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:10:50,433 INFO L87 Difference]: Start difference. First operand 381 states and 572 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:50,710 INFO L93 Difference]: Finished difference Result 1908 states and 2968 transitions. [2025-03-03 15:10:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:50,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-03 15:10:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:50,717 INFO L225 Difference]: With dead ends: 1908 [2025-03-03 15:10:50,717 INFO L226 Difference]: Without dead ends: 1622 [2025-03-03 15:10:50,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:10:50,721 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3198 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3198 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:50,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3198 Valid, 1414 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-03 15:10:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1612. [2025-03-03 15:10:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2501 transitions. [2025-03-03 15:10:50,788 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2501 transitions. Word has length 96 [2025-03-03 15:10:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2501 transitions. [2025-03-03 15:10:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2501 transitions. [2025-03-03 15:10:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:50,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:50,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:50,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:10:50,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1489257074, now seen corresponding path program 1 times [2025-03-03 15:10:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836220427] [2025-03-03 15:10:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:50,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:50,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:50,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836220427] [2025-03-03 15:10:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836220427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:50,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641128269] [2025-03-03 15:10:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:50,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:50,968 INFO L87 Difference]: Start difference. First operand 1612 states and 2501 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:51,239 INFO L93 Difference]: Finished difference Result 4122 states and 6485 transitions. [2025-03-03 15:10:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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 97 [2025-03-03 15:10:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:51,250 INFO L225 Difference]: With dead ends: 4122 [2025-03-03 15:10:51,250 INFO L226 Difference]: Without dead ends: 2704 [2025-03-03 15:10:51,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:51,255 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1294 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:51,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 361 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-03 15:10:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2702. [2025-03-03 15:10:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.5634950018511662) internal successors, (4223), 2701 states have internal predecessors, (4223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 4223 transitions. [2025-03-03 15:10:51,341 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 4223 transitions. Word has length 97 [2025-03-03 15:10:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:51,341 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 4223 transitions. [2025-03-03 15:10:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 4223 transitions. [2025-03-03 15:10:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:51,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:10:51,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2097536670, now seen corresponding path program 1 times [2025-03-03 15:10:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810952084] [2025-03-03 15:10:51,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810952084] [2025-03-03 15:10:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810952084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:51,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2369310] [2025-03-03 15:10:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:51,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:51,537 INFO L87 Difference]: Start difference. First operand 2702 states and 4223 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:51,775 INFO L93 Difference]: Finished difference Result 7443 states and 11724 transitions. [2025-03-03 15:10:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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 97 [2025-03-03 15:10:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:51,792 INFO L225 Difference]: With dead ends: 7443 [2025-03-03 15:10:51,793 INFO L226 Difference]: Without dead ends: 4894 [2025-03-03 15:10:51,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:51,801 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1296 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:51,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 352 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2025-03-03 15:10:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4892. [2025-03-03 15:10:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4891 states have (on average 1.567573093436925) internal successors, (7667), 4891 states have internal predecessors, (7667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 7667 transitions. [2025-03-03 15:10:51,901 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 7667 transitions. Word has length 97 [2025-03-03 15:10:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:51,901 INFO L471 AbstractCegarLoop]: Abstraction has 4892 states and 7667 transitions. [2025-03-03 15:10:51,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 7667 transitions. [2025-03-03 15:10:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:51,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:51,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:51,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:10:51,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:51,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -830833866, now seen corresponding path program 1 times [2025-03-03 15:10:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86498153] [2025-03-03 15:10:51,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:51,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:51,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:52,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86498153] [2025-03-03 15:10:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86498153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:52,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212870901] [2025-03-03 15:10:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:52,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:52,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:52,042 INFO L87 Difference]: Start difference. First operand 4892 states and 7667 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:52,336 INFO L93 Difference]: Finished difference Result 14096 states and 22189 transitions. [2025-03-03 15:10:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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 97 [2025-03-03 15:10:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:52,367 INFO L225 Difference]: With dead ends: 14096 [2025-03-03 15:10:52,367 INFO L226 Difference]: Without dead ends: 9320 [2025-03-03 15:10:52,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:52,375 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1326 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:52,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 348 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2025-03-03 15:10:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 9318. [2025-03-03 15:10:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9318 states, 9317 states have (on average 1.567028013309005) internal successors, (14600), 9317 states have internal predecessors, (14600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9318 states to 9318 states and 14600 transitions. [2025-03-03 15:10:52,560 INFO L78 Accepts]: Start accepts. Automaton has 9318 states and 14600 transitions. Word has length 97 [2025-03-03 15:10:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:52,560 INFO L471 AbstractCegarLoop]: Abstraction has 9318 states and 14600 transitions. [2025-03-03 15:10:52,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 9318 states and 14600 transitions. [2025-03-03 15:10:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:52,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:52,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:10:52,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1272040202, now seen corresponding path program 1 times [2025-03-03 15:10:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512052928] [2025-03-03 15:10:52,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:52,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512052928] [2025-03-03 15:10:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512052928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720094897] [2025-03-03 15:10:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:52,686 INFO L87 Difference]: Start difference. First operand 9318 states and 14600 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:52,996 INFO L93 Difference]: Finished difference Result 27444 states and 43104 transitions. [2025-03-03 15:10:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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 97 [2025-03-03 15:10:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:53,040 INFO L225 Difference]: With dead ends: 27444 [2025-03-03 15:10:53,041 INFO L226 Difference]: Without dead ends: 18212 [2025-03-03 15:10:53,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:53,057 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1348 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:53,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 348 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18212 states. [2025-03-03 15:10:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18212 to 18210. [2025-03-03 15:10:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18210 states, 18209 states have (on average 1.5629633697622054) internal successors, (28460), 18209 states have internal predecessors, (28460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18210 states to 18210 states and 28460 transitions. [2025-03-03 15:10:53,447 INFO L78 Accepts]: Start accepts. Automaton has 18210 states and 28460 transitions. Word has length 97 [2025-03-03 15:10:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:53,447 INFO L471 AbstractCegarLoop]: Abstraction has 18210 states and 28460 transitions. [2025-03-03 15:10:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18210 states and 28460 transitions. [2025-03-03 15:10:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:53,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:53,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:53,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:10:53,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:53,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1433071394, now seen corresponding path program 1 times [2025-03-03 15:10:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243512322] [2025-03-03 15:10:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:53,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243512322] [2025-03-03 15:10:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243512322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681291736] [2025-03-03 15:10:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:53,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:53,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:53,588 INFO L87 Difference]: Start difference. First operand 18210 states and 28460 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:53,894 INFO L93 Difference]: Finished difference Result 54167 states and 84769 transitions. [2025-03-03 15:10:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:53,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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 97 [2025-03-03 15:10:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:53,950 INFO L225 Difference]: With dead ends: 54167 [2025-03-03 15:10:53,950 INFO L226 Difference]: Without dead ends: 36020 [2025-03-03 15:10:54,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:54,074 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1374 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:54,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 346 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36020 states. [2025-03-03 15:10:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36020 to 36018. [2025-03-03 15:10:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36018 states, 36017 states have (on average 1.556403920370936) internal successors, (56057), 36017 states have internal predecessors, (56057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36018 states to 36018 states and 56057 transitions. [2025-03-03 15:10:54,595 INFO L78 Accepts]: Start accepts. Automaton has 36018 states and 56057 transitions. Word has length 97 [2025-03-03 15:10:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 36018 states and 56057 transitions. [2025-03-03 15:10:54,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-03 15:10:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36018 states and 56057 transitions. [2025-03-03 15:10:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:54,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:54,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:54,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:10:54,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -685580162, now seen corresponding path program 1 times [2025-03-03 15:10:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282700634] [2025-03-03 15:10:54,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:54,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:54,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:54,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:54,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:54,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:54,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282700634] [2025-03-03 15:10:54,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282700634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:54,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:54,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727850796] [2025-03-03 15:10:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:54,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:54,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:54,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:54,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:54,775 INFO L87 Difference]: Start difference. First operand 36018 states and 56057 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:55,527 INFO L93 Difference]: Finished difference Result 102358 states and 159437 transitions. [2025-03-03 15:10:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-03 15:10:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:55,615 INFO L225 Difference]: With dead ends: 102358 [2025-03-03 15:10:55,616 INFO L226 Difference]: Without dead ends: 66419 [2025-03-03 15:10:55,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:55,665 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1407 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:55,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 349 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66419 states. [2025-03-03 15:10:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66419 to 66417. [2025-03-03 15:10:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66417 states, 66416 states have (on average 1.5520808238978558) internal successors, (103083), 66416 states have internal predecessors, (103083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66417 states to 66417 states and 103083 transitions. [2025-03-03 15:10:56,775 INFO L78 Accepts]: Start accepts. Automaton has 66417 states and 103083 transitions. Word has length 98 [2025-03-03 15:10:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:56,775 INFO L471 AbstractCegarLoop]: Abstraction has 66417 states and 103083 transitions. [2025-03-03 15:10:56,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66417 states and 103083 transitions. [2025-03-03 15:10:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:56,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:56,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:10:56,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash -403063453, now seen corresponding path program 1 times [2025-03-03 15:10:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914047872] [2025-03-03 15:10:56,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:56,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914047872] [2025-03-03 15:10:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914047872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:10:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976459578] [2025-03-03 15:10:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:57,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:57,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:57,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:57,152 INFO L87 Difference]: Start difference. First operand 66417 states and 103083 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:57,309 INFO L93 Difference]: Finished difference Result 67827 states and 105196 transitions. [2025-03-03 15:10:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-03 15:10:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:57,546 INFO L225 Difference]: With dead ends: 67827 [2025-03-03 15:10:57,546 INFO L226 Difference]: Without dead ends: 67825 [2025-03-03 15:10:57,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:57,574 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:57,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67825 states. [2025-03-03 15:10:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67825 to 67825. [2025-03-03 15:10:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67825 states, 67824 states have (on average 1.5406198395848076) internal successors, (104491), 67824 states have internal predecessors, (104491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67825 states to 67825 states and 104491 transitions. [2025-03-03 15:10:58,812 INFO L78 Accepts]: Start accepts. Automaton has 67825 states and 104491 transitions. Word has length 98 [2025-03-03 15:10:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:58,813 INFO L471 AbstractCegarLoop]: Abstraction has 67825 states and 104491 transitions. [2025-03-03 15:10:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 67825 states and 104491 transitions. [2025-03-03 15:10:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:10:58,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:58,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:58,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:10:58,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 394709848, now seen corresponding path program 1 times [2025-03-03 15:10:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:58,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97081877] [2025-03-03 15:10:58,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:58,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:10:58,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:10:58,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:58,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97081877] [2025-03-03 15:10:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97081877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:10:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899286489] [2025-03-03 15:10:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:59,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:10:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:59,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:10:59,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:10:59,210 INFO L87 Difference]: Start difference. First operand 67825 states and 104491 transitions. Second operand has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:00,018 INFO L93 Difference]: Finished difference Result 82832 states and 126832 transitions. [2025-03-03 15:11:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:11:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) 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 99 [2025-03-03 15:11:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:00,110 INFO L225 Difference]: With dead ends: 82832 [2025-03-03 15:11:00,110 INFO L226 Difference]: Without dead ends: 75795 [2025-03-03 15:11:00,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:11:00,141 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1905 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:00,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 1092 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:11:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75795 states. [2025-03-03 15:11:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75795 to 67825. [2025-03-03 15:11:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67825 states, 67824 states have (on average 1.5406050955414012) internal successors, (104490), 67824 states have internal predecessors, (104490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67825 states to 67825 states and 104490 transitions. [2025-03-03 15:11:00,992 INFO L78 Accepts]: Start accepts. Automaton has 67825 states and 104490 transitions. Word has length 99 [2025-03-03 15:11:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:00,992 INFO L471 AbstractCegarLoop]: Abstraction has 67825 states and 104490 transitions. [2025-03-03 15:11:00,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 67825 states and 104490 transitions. [2025-03-03 15:11:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:11:01,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:01,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:11:01,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -250417192, now seen corresponding path program 1 times [2025-03-03 15:11:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521308931] [2025-03-03 15:11:01,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:11:01,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:11:01,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:01,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521308931] [2025-03-03 15:11:01,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521308931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:01,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:01,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:11:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414052845] [2025-03-03 15:11:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:01,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:01,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:01,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:01,513 INFO L87 Difference]: Start difference. First operand 67825 states and 104490 transitions. Second operand has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:02,328 INFO L93 Difference]: Finished difference Result 105064 states and 160563 transitions. [2025-03-03 15:11:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:02,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) 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 99 [2025-03-03 15:11:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:02,432 INFO L225 Difference]: With dead ends: 105064 [2025-03-03 15:11:02,432 INFO L226 Difference]: Without dead ends: 84902 [2025-03-03 15:11:02,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:11:02,473 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 2261 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:02,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 1122 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:11:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84902 states. [2025-03-03 15:11:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84902 to 68676. [2025-03-03 15:11:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68676 states, 68675 states have (on average 1.5399344739716054) internal successors, (105755), 68675 states have internal predecessors, (105755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68676 states to 68676 states and 105755 transitions. [2025-03-03 15:11:03,454 INFO L78 Accepts]: Start accepts. Automaton has 68676 states and 105755 transitions. Word has length 99 [2025-03-03 15:11:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:03,455 INFO L471 AbstractCegarLoop]: Abstraction has 68676 states and 105755 transitions. [2025-03-03 15:11:03,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 68676 states and 105755 transitions. [2025-03-03 15:11:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:11:03,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:03,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:11:03,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 653841496, now seen corresponding path program 1 times [2025-03-03 15:11:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27337716] [2025-03-03 15:11:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:03,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:11:03,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:11:03,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:03,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27337716] [2025-03-03 15:11:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27337716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:11:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540013074] [2025-03-03 15:11:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:03,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:03,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:03,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:03,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:03,742 INFO L87 Difference]: Start difference. First operand 68676 states and 105755 transitions. Second operand has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:04,860 INFO L93 Difference]: Finished difference Result 124553 states and 190575 transitions. [2025-03-03 15:11:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:04,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) 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 99 [2025-03-03 15:11:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:04,968 INFO L225 Difference]: With dead ends: 124553 [2025-03-03 15:11:04,968 INFO L226 Difference]: Without dead ends: 91537 [2025-03-03 15:11:05,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:11:05,001 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 930 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:05,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1206 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:11:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91537 states. [2025-03-03 15:11:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91537 to 69578. [2025-03-03 15:11:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69578 states, 69577 states have (on average 1.5379363870244478) internal successors, (107005), 69577 states have internal predecessors, (107005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69578 states to 69578 states and 107005 transitions. [2025-03-03 15:11:06,177 INFO L78 Accepts]: Start accepts. Automaton has 69578 states and 107005 transitions. Word has length 99 [2025-03-03 15:11:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:06,177 INFO L471 AbstractCegarLoop]: Abstraction has 69578 states and 107005 transitions. [2025-03-03 15:11:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69578 states and 107005 transitions. [2025-03-03 15:11:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:11:06,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:06,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:06,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:11:06,192 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1985509592, now seen corresponding path program 1 times [2025-03-03 15:11:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395600170] [2025-03-03 15:11:06,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:11:06,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:11:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395600170] [2025-03-03 15:11:06,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395600170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:06,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:11:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343997746] [2025-03-03 15:11:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:06,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:06,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:06,553 INFO L87 Difference]: Start difference. First operand 69578 states and 107005 transitions. Second operand has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:07,721 INFO L93 Difference]: Finished difference Result 144322 states and 220614 transitions. [2025-03-03 15:11:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) 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 99 [2025-03-03 15:11:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:07,839 INFO L225 Difference]: With dead ends: 144322 [2025-03-03 15:11:07,839 INFO L226 Difference]: Without dead ends: 99019 [2025-03-03 15:11:07,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:11:07,888 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 2014 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:07,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2014 Valid, 1216 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:11:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99019 states. [2025-03-03 15:11:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99019 to 70491. [2025-03-03 15:11:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70491 states, 70490 states have (on average 1.535622074053057) internal successors, (108246), 70490 states have internal predecessors, (108246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70491 states to 70491 states and 108246 transitions. [2025-03-03 15:11:09,095 INFO L78 Accepts]: Start accepts. Automaton has 70491 states and 108246 transitions. Word has length 99 [2025-03-03 15:11:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 70491 states and 108246 transitions. [2025-03-03 15:11:09,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 70491 states and 108246 transitions. [2025-03-03 15:11:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:11:09,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:09,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:09,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:11:09,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:09,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash 206691672, now seen corresponding path program 1 times [2025-03-03 15:11:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562915603] [2025-03-03 15:11:09,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:11:09,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:11:09,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:09,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:09,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562915603] [2025-03-03 15:11:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562915603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:09,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:11:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873755043] [2025-03-03 15:11:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:09,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:09,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:09,585 INFO L87 Difference]: Start difference. First operand 70491 states and 108246 transitions. Second operand has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:10,710 INFO L93 Difference]: Finished difference Result 162901 states and 248702 transitions. [2025-03-03 15:11:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:10,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) 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 99 [2025-03-03 15:11:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:10,850 INFO L225 Difference]: With dead ends: 162901 [2025-03-03 15:11:10,851 INFO L226 Difference]: Without dead ends: 106025 [2025-03-03 15:11:10,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:11:10,913 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 2057 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 1218 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:11:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106025 states. [2025-03-03 15:11:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106025 to 71373. [2025-03-03 15:11:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71373 states, 71372 states have (on average 1.53264585551757) internal successors, (109388), 71372 states have internal predecessors, (109388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71373 states to 71373 states and 109388 transitions. [2025-03-03 15:11:12,246 INFO L78 Accepts]: Start accepts. Automaton has 71373 states and 109388 transitions. Word has length 99 [2025-03-03 15:11:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:12,246 INFO L471 AbstractCegarLoop]: Abstraction has 71373 states and 109388 transitions. [2025-03-03 15:11:12,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) 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-03-03 15:11:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 71373 states and 109388 transitions. [2025-03-03 15:11:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:12,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:12,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:11:12,259 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:12,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -382152028, now seen corresponding path program 1 times [2025-03-03 15:11:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:12,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003442897] [2025-03-03 15:11:12,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:12,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:12,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:12,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-03-03 15:11:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003442897] [2025-03-03 15:11:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003442897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:11:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276627486] [2025-03-03 15:11:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:12,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:12,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:12,502 INFO L87 Difference]: Start difference. First operand 71373 states and 109388 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:13,861 INFO L93 Difference]: Finished difference Result 179296 states and 274149 transitions. [2025-03-03 15:11:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:14,016 INFO L225 Difference]: With dead ends: 179296 [2025-03-03 15:11:14,016 INFO L226 Difference]: Without dead ends: 111362 [2025-03-03 15:11:14,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:11:14,076 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1527 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1903 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:11:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111362 states. [2025-03-03 15:11:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111362 to 72165. [2025-03-03 15:11:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72165 states, 72164 states have (on average 1.528587661437836) internal successors, (110309), 72164 states have internal predecessors, (110309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72165 states to 72165 states and 110309 transitions. [2025-03-03 15:11:15,680 INFO L78 Accepts]: Start accepts. Automaton has 72165 states and 110309 transitions. Word has length 100 [2025-03-03 15:11:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:15,680 INFO L471 AbstractCegarLoop]: Abstraction has 72165 states and 110309 transitions. [2025-03-03 15:11:15,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 72165 states and 110309 transitions. [2025-03-03 15:11:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:15,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:15,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:15,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:11:15,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:15,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash 500511114, now seen corresponding path program 1 times [2025-03-03 15:11:15,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:15,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10895022] [2025-03-03 15:11:15,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:15,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:15,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:15,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:15,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:15,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10895022] [2025-03-03 15:11:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10895022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:15,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186053918] [2025-03-03 15:11:15,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:15,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:15,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:15,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:15,736 INFO L87 Difference]: Start difference. First operand 72165 states and 110309 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:16,070 INFO L93 Difference]: Finished difference Result 162793 states and 249529 transitions. [2025-03-03 15:11:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:16,198 INFO L225 Difference]: With dead ends: 162793 [2025-03-03 15:11:16,198 INFO L226 Difference]: Without dead ends: 99523 [2025-03-03 15:11:16,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:16,261 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 248 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:16,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 671 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99523 states. [2025-03-03 15:11:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99523 to 69997. [2025-03-03 15:11:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69997 states, 69996 states have (on average 1.515315160866335) internal successors, (106066), 69996 states have internal predecessors, (106066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69997 states to 69997 states and 106066 transitions. [2025-03-03 15:11:17,557 INFO L78 Accepts]: Start accepts. Automaton has 69997 states and 106066 transitions. Word has length 100 [2025-03-03 15:11:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 69997 states and 106066 transitions. [2025-03-03 15:11:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 69997 states and 106066 transitions. [2025-03-03 15:11:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:17,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:17,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:11:17,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1144874228, now seen corresponding path program 1 times [2025-03-03 15:11:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078692434] [2025-03-03 15:11:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:17,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:17,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078692434] [2025-03-03 15:11:17,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078692434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:17,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:17,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838830344] [2025-03-03 15:11:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:17,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:11:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:17,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:11:17,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:11:17,682 INFO L87 Difference]: Start difference. First operand 69997 states and 106066 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:18,004 INFO L93 Difference]: Finished difference Result 193969 states and 295252 transitions. [2025-03-03 15:11:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:18,152 INFO L225 Difference]: With dead ends: 193969 [2025-03-03 15:11:18,152 INFO L226 Difference]: Without dead ends: 129839 [2025-03-03 15:11:18,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:18,215 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 234 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:18,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 844 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129839 states. [2025-03-03 15:11:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129839 to 129133. [2025-03-03 15:11:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129133 states, 129132 states have (on average 1.5110274757612365) internal successors, (195122), 129132 states have internal predecessors, (195122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129133 states to 129133 states and 195122 transitions. [2025-03-03 15:11:20,099 INFO L78 Accepts]: Start accepts. Automaton has 129133 states and 195122 transitions. Word has length 100 [2025-03-03 15:11:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 129133 states and 195122 transitions. [2025-03-03 15:11:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 129133 states and 195122 transitions. [2025-03-03 15:11:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:20,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:20,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:20,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:11:20,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:20,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1836285084, now seen corresponding path program 1 times [2025-03-03 15:11:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392659023] [2025-03-03 15:11:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:20,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392659023] [2025-03-03 15:11:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392659023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817037469] [2025-03-03 15:11:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:20,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:20,152 INFO L87 Difference]: Start difference. First operand 129133 states and 195122 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:20,505 INFO L93 Difference]: Finished difference Result 166076 states and 250814 transitions. [2025-03-03 15:11:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:20,691 INFO L225 Difference]: With dead ends: 166076 [2025-03-03 15:11:20,691 INFO L226 Difference]: Without dead ends: 139710 [2025-03-03 15:11:21,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:21,135 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 202 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:21,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 787 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139710 states. [2025-03-03 15:11:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139710 to 127420. [2025-03-03 15:11:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127420 states, 127419 states have (on average 1.493544918732685) internal successors, (190306), 127419 states have internal predecessors, (190306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127420 states to 127420 states and 190306 transitions. [2025-03-03 15:11:22,475 INFO L78 Accepts]: Start accepts. Automaton has 127420 states and 190306 transitions. Word has length 100 [2025-03-03 15:11:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:22,476 INFO L471 AbstractCegarLoop]: Abstraction has 127420 states and 190306 transitions. [2025-03-03 15:11:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 127420 states and 190306 transitions. [2025-03-03 15:11:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:22,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:22,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:11:22,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1027956682, now seen corresponding path program 1 times [2025-03-03 15:11:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533322027] [2025-03-03 15:11:22,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:22,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:22,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:22,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533322027] [2025-03-03 15:11:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533322027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626913183] [2025-03-03 15:11:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:22,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:22,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:22,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:22,532 INFO L87 Difference]: Start difference. First operand 127420 states and 190306 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:23,298 INFO L93 Difference]: Finished difference Result 190918 states and 285690 transitions. [2025-03-03 15:11:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:23,504 INFO L225 Difference]: With dead ends: 190918 [2025-03-03 15:11:23,504 INFO L226 Difference]: Without dead ends: 142088 [2025-03-03 15:11:23,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:23,556 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 208 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:23,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 712 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142088 states. [2025-03-03 15:11:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142088 to 140998. [2025-03-03 15:11:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140998 states, 140997 states have (on average 1.4763009142038483) internal successors, (208154), 140997 states have internal predecessors, (208154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140998 states to 140998 states and 208154 transitions. [2025-03-03 15:11:25,714 INFO L78 Accepts]: Start accepts. Automaton has 140998 states and 208154 transitions. Word has length 100 [2025-03-03 15:11:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:25,714 INFO L471 AbstractCegarLoop]: Abstraction has 140998 states and 208154 transitions. [2025-03-03 15:11:25,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 140998 states and 208154 transitions. [2025-03-03 15:11:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:25,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:25,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:25,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:11:25,722 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -793937493, now seen corresponding path program 1 times [2025-03-03 15:11:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301517558] [2025-03-03 15:11:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:25,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:25,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:25,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:25,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:25,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:25,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301517558] [2025-03-03 15:11:25,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301517558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:25,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:25,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:25,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561113318] [2025-03-03 15:11:25,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:25,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:25,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:25,768 INFO L87 Difference]: Start difference. First operand 140998 states and 208154 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:26,273 INFO L93 Difference]: Finished difference Result 251638 states and 372106 transitions. [2025-03-03 15:11:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 15:11:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:26,493 INFO L225 Difference]: With dead ends: 251638 [2025-03-03 15:11:26,493 INFO L226 Difference]: Without dead ends: 165724 [2025-03-03 15:11:26,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:26,580 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 218 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:26,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 655 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165724 states. [2025-03-03 15:11:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165724 to 164538. [2025-03-03 15:11:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164538 states, 164537 states have (on average 1.4570826014817335) internal successors, (239744), 164537 states have internal predecessors, (239744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164538 states to 164538 states and 239744 transitions. [2025-03-03 15:11:28,833 INFO L78 Accepts]: Start accepts. Automaton has 164538 states and 239744 transitions. Word has length 100 [2025-03-03 15:11:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 164538 states and 239744 transitions. [2025-03-03 15:11:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 164538 states and 239744 transitions. [2025-03-03 15:11:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:11:28,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:28,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:28,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:11:28,846 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:11:28,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1128451882, now seen corresponding path program 1 times [2025-03-03 15:11:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453149915] [2025-03-03 15:11:28,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:11:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:11:28,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:28,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453149915] [2025-03-03 15:11:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453149915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432124641] [2025-03-03 15:11:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:28,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:28,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:28,908 INFO L87 Difference]: Start difference. First operand 164538 states and 239744 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)