./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-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 bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:07:14,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:07:14,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:07:14,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:07:14,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:07:14,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:07:14,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:07:14,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:07:14,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:07:14,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:07:14,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:07:14,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:07:14,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:07:14,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:07:14,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:07:14,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:07:14,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:07:14,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:07:14,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:07:14,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:07:14,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:07:14,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:07:14,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:07:14,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:07:14,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:07:14,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:07:14,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:07:14,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:07:14,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:07:14,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:07:14,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:07:14,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:07:14,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:07:14,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:07:14,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:07:14,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:07:14,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:07:14,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:07:14,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:07:14,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:07:14,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:07:14,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:07:14,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a [2024-11-10 00:07:14,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:07:14,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:07:14,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:07:14,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:07:14,641 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:07:14,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-10 00:07:16,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:07:16,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:07:16,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-10 00:07:16,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff94cea1/eb3982b861e54bd5b7891aa54ae8a25b/FLAG122f88a0b [2024-11-10 00:07:16,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff94cea1/eb3982b861e54bd5b7891aa54ae8a25b [2024-11-10 00:07:16,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:07:16,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:07:16,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:07:16,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:07:16,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:07:16,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:16" (1/1) ... [2024-11-10 00:07:16,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab9b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:16, skipping insertion in model container [2024-11-10 00:07:16,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:07:16" (1/1) ... [2024-11-10 00:07:16,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:07:17,178 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687] [2024-11-10 00:07:17,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:07:17,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:07:17,374 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687] [2024-11-10 00:07:17,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:07:17,453 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:07:17,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17 WrapperNode [2024-11-10 00:07:17,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:07:17,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:07:17,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:07:17,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:07:17,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,568 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1447 [2024-11-10 00:07:17,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:07:17,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:07:17,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:07:17,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:07:17,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,648 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]. [2024-11-10 00:07:17,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:07:17,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:07:17,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:07:17,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:07:17,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (1/1) ... [2024-11-10 00:07:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:07:17,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:07:17,758 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) [2024-11-10 00:07:17,762 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 [2024-11-10 00:07:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:07:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:07:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:07:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:07:18,011 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:07:18,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:07:19,307 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L862: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:07:19,308 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1368: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1368: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1368: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1368: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,310 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,310 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,310 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,310 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,310 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;havoc main_~node3__newmax~0#1; [2024-11-10 00:07:19,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1342: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:07:19,312 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,312 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,313 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,313 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,313 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:07:19,314 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,314 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,315 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,316 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,317 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;havoc main_~node1__newmax~0#1; [2024-11-10 00:07:19,317 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2024-11-10 00:07:19,473 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-10 00:07:19,474 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:07:19,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:07:19,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:07:19,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:07:19 BoogieIcfgContainer [2024-11-10 00:07:19,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:07:19,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:07:19,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:07:19,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:07:19,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:07:16" (1/3) ... [2024-11-10 00:07:19,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379236a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:07:19, skipping insertion in model container [2024-11-10 00:07:19,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:07:17" (2/3) ... [2024-11-10 00:07:19,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379236a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:07:19, skipping insertion in model container [2024-11-10 00:07:19,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:07:19" (3/3) ... [2024-11-10 00:07:19,521 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-10 00:07:19,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:07:19,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:07:19,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:07:19,664 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;@7fbc4257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:07:19,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:07:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 419 states, 417 states have (on average 1.6498800959232613) internal successors, (688), 418 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 00:07:19,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:19,695 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:19,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1595103936, now seen corresponding path program 1 times [2024-11-10 00:07:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238778985] [2024-11-10 00:07:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:20,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238778985] [2024-11-10 00:07:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238778985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:20,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382981974] [2024-11-10 00:07:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:20,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:20,706 INFO L87 Difference]: Start difference. First operand has 419 states, 417 states have (on average 1.6498800959232613) internal successors, (688), 418 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:20,887 INFO L93 Difference]: Finished difference Result 759 states and 1222 transitions. [2024-11-10 00:07:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-10 00:07:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:20,910 INFO L225 Difference]: With dead ends: 759 [2024-11-10 00:07:20,911 INFO L226 Difference]: Without dead ends: 575 [2024-11-10 00:07:20,916 INFO L431 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 [2024-11-10 00:07:20,921 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 281 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:20,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1290 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-10 00:07:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2024-11-10 00:07:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.5402097902097902) internal successors, (881), 572 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 881 transitions. [2024-11-10 00:07:21,030 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 881 transitions. Word has length 119 [2024-11-10 00:07:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:21,031 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 881 transitions. [2024-11-10 00:07:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 881 transitions. [2024-11-10 00:07:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 00:07:21,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:21,041 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:07:21,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:21,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 213477374, now seen corresponding path program 1 times [2024-11-10 00:07:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569421836] [2024-11-10 00:07:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569421836] [2024-11-10 00:07:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569421836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933547191] [2024-11-10 00:07:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:21,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:21,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:21,425 INFO L87 Difference]: Start difference. First operand 573 states and 881 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:21,500 INFO L93 Difference]: Finished difference Result 1213 states and 1881 transitions. [2024-11-10 00:07:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-10 00:07:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:21,508 INFO L225 Difference]: With dead ends: 1213 [2024-11-10 00:07:21,508 INFO L226 Difference]: Without dead ends: 881 [2024-11-10 00:07:21,513 INFO L431 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 [2024-11-10 00:07:21,515 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 241 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:21,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1227 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-10 00:07:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-11-10 00:07:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.5466970387243735) internal successors, (1358), 878 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1358 transitions. [2024-11-10 00:07:21,574 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1358 transitions. Word has length 124 [2024-11-10 00:07:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:21,577 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1358 transitions. [2024-11-10 00:07:21,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1358 transitions. [2024-11-10 00:07:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 00:07:21,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:21,583 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:07:21,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1344085335, now seen corresponding path program 1 times [2024-11-10 00:07:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553357027] [2024-11-10 00:07:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553357027] [2024-11-10 00:07:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553357027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125929809] [2024-11-10 00:07:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:21,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:21,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:21,889 INFO L87 Difference]: Start difference. First operand 879 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:21,945 INFO L93 Difference]: Finished difference Result 2107 states and 3272 transitions. [2024-11-10 00:07:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-10 00:07:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:21,955 INFO L225 Difference]: With dead ends: 2107 [2024-11-10 00:07:21,956 INFO L226 Difference]: Without dead ends: 1469 [2024-11-10 00:07:21,958 INFO L431 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 [2024-11-10 00:07:21,961 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 232 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:21,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1228 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:07:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2024-11-10 00:07:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1467. [2024-11-10 00:07:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 1.548431105047749) internal successors, (2270), 1466 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2270 transitions. [2024-11-10 00:07:22,011 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2270 transitions. Word has length 129 [2024-11-10 00:07:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2270 transitions. [2024-11-10 00:07:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2270 transitions. [2024-11-10 00:07:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:07:22,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:22,016 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:22,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:07:22,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -271901843, now seen corresponding path program 1 times [2024-11-10 00:07:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417316553] [2024-11-10 00:07:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417316553] [2024-11-10 00:07:22,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417316553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695736511] [2024-11-10 00:07:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:22,302 INFO L87 Difference]: Start difference. First operand 1467 states and 2270 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:22,369 INFO L93 Difference]: Finished difference Result 3823 states and 5928 transitions. [2024-11-10 00:07:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:22,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-10 00:07:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:22,382 INFO L225 Difference]: With dead ends: 3823 [2024-11-10 00:07:22,383 INFO L226 Difference]: Without dead ends: 2597 [2024-11-10 00:07:22,386 INFO L431 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 [2024-11-10 00:07:22,388 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 223 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:22,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1229 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:07:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-11-10 00:07:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2595. [2024-11-10 00:07:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2594 states have (on average 1.5458750963762529) internal successors, (4010), 2594 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4010 transitions. [2024-11-10 00:07:22,461 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4010 transitions. Word has length 134 [2024-11-10 00:07:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:22,461 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 4010 transitions. [2024-11-10 00:07:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4010 transitions. [2024-11-10 00:07:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 00:07:22,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:22,466 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:22,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:07:22,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:22,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:22,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2029728622, now seen corresponding path program 1 times [2024-11-10 00:07:22,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386563313] [2024-11-10 00:07:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:22,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386563313] [2024-11-10 00:07:22,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386563313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:22,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:22,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:07:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197851313] [2024-11-10 00:07:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:07:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:22,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:07:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:07:22,820 INFO L87 Difference]: Start difference. First operand 2595 states and 4010 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:23,301 INFO L93 Difference]: Finished difference Result 13427 states and 20954 transitions. [2024-11-10 00:07:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:07:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-10 00:07:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:23,343 INFO L225 Difference]: With dead ends: 13427 [2024-11-10 00:07:23,344 INFO L226 Difference]: Without dead ends: 11073 [2024-11-10 00:07:23,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:07:23,357 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 2343 mSDsluCounter, 5312 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 5954 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:23,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2343 Valid, 5954 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:07:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11073 states. [2024-11-10 00:07:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11073 to 4755. [2024-11-10 00:07:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4754 states have (on average 1.5513251998317206) internal successors, (7375), 4754 states have internal predecessors, (7375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 7375 transitions. [2024-11-10 00:07:23,575 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 7375 transitions. Word has length 139 [2024-11-10 00:07:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:23,577 INFO L471 AbstractCegarLoop]: Abstraction has 4755 states and 7375 transitions. [2024-11-10 00:07:23,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 7375 transitions. [2024-11-10 00:07:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 00:07:23,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:23,582 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:07:23,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1457731245, now seen corresponding path program 1 times [2024-11-10 00:07:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841964854] [2024-11-10 00:07:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841964854] [2024-11-10 00:07:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841964854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948397620] [2024-11-10 00:07:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:23,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:23,758 INFO L87 Difference]: Start difference. First operand 4755 states and 7375 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:23,835 INFO L93 Difference]: Finished difference Result 9146 states and 14229 transitions. [2024-11-10 00:07:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-10 00:07:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:23,860 INFO L225 Difference]: With dead ends: 9146 [2024-11-10 00:07:23,861 INFO L226 Difference]: Without dead ends: 6680 [2024-11-10 00:07:23,868 INFO L431 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 [2024-11-10 00:07:23,869 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 251 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:23,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1430 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:07:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2024-11-10 00:07:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6678. [2024-11-10 00:07:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6678 states, 6677 states have (on average 1.549498277669612) internal successors, (10346), 6677 states have internal predecessors, (10346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6678 states to 6678 states and 10346 transitions. [2024-11-10 00:07:24,068 INFO L78 Accepts]: Start accepts. Automaton has 6678 states and 10346 transitions. Word has length 141 [2024-11-10 00:07:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:24,069 INFO L471 AbstractCegarLoop]: Abstraction has 6678 states and 10346 transitions. [2024-11-10 00:07:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6678 states and 10346 transitions. [2024-11-10 00:07:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 00:07:24,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:24,073 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:07:24,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1143139323, now seen corresponding path program 1 times [2024-11-10 00:07:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659368899] [2024-11-10 00:07:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659368899] [2024-11-10 00:07:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659368899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:24,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589704957] [2024-11-10 00:07:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:24,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:24,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:24,232 INFO L87 Difference]: Start difference. First operand 6678 states and 10346 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:24,378 INFO L93 Difference]: Finished difference Result 12722 states and 19721 transitions. [2024-11-10 00:07:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-10 00:07:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:24,415 INFO L225 Difference]: With dead ends: 12722 [2024-11-10 00:07:24,415 INFO L226 Difference]: Without dead ends: 9304 [2024-11-10 00:07:24,428 INFO L431 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 [2024-11-10 00:07:24,429 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 242 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1403 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2024-11-10 00:07:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 9302. [2024-11-10 00:07:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9302 states, 9301 states have (on average 1.544565100526825) internal successors, (14366), 9301 states have internal predecessors, (14366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9302 states to 9302 states and 14366 transitions. [2024-11-10 00:07:24,698 INFO L78 Accepts]: Start accepts. Automaton has 9302 states and 14366 transitions. Word has length 141 [2024-11-10 00:07:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:24,699 INFO L471 AbstractCegarLoop]: Abstraction has 9302 states and 14366 transitions. [2024-11-10 00:07:24,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9302 states and 14366 transitions. [2024-11-10 00:07:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 00:07:24,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:24,702 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:24,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:07:24,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 735418821, now seen corresponding path program 1 times [2024-11-10 00:07:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373753810] [2024-11-10 00:07:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373753810] [2024-11-10 00:07:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373753810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:24,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:07:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652622694] [2024-11-10 00:07:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:24,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:07:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:07:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:07:24,974 INFO L87 Difference]: Start difference. First operand 9302 states and 14366 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:25,197 INFO L93 Difference]: Finished difference Result 30120 states and 46642 transitions. [2024-11-10 00:07:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:07:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-10 00:07:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:25,252 INFO L225 Difference]: With dead ends: 30120 [2024-11-10 00:07:25,252 INFO L226 Difference]: Without dead ends: 21086 [2024-11-10 00:07:25,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:07:25,277 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 793 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:25,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2100 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21086 states. [2024-11-10 00:07:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21086 to 15169. [2024-11-10 00:07:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15169 states, 15168 states have (on average 1.5430511603375527) internal successors, (23405), 15168 states have internal predecessors, (23405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15169 states to 15169 states and 23405 transitions. [2024-11-10 00:07:25,751 INFO L78 Accepts]: Start accepts. Automaton has 15169 states and 23405 transitions. Word has length 141 [2024-11-10 00:07:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 15169 states and 23405 transitions. [2024-11-10 00:07:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15169 states and 23405 transitions. [2024-11-10 00:07:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 00:07:25,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:25,755 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:25,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:07:25,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 937723589, now seen corresponding path program 1 times [2024-11-10 00:07:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:25,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315954679] [2024-11-10 00:07:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315954679] [2024-11-10 00:07:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315954679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:25,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626912757] [2024-11-10 00:07:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:25,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:25,935 INFO L87 Difference]: Start difference. First operand 15169 states and 23405 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:26,111 INFO L93 Difference]: Finished difference Result 29166 states and 45004 transitions. [2024-11-10 00:07:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-10 00:07:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:26,164 INFO L225 Difference]: With dead ends: 29166 [2024-11-10 00:07:26,164 INFO L226 Difference]: Without dead ends: 21180 [2024-11-10 00:07:26,186 INFO L431 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 [2024-11-10 00:07:26,188 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 224 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:26,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:07:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21180 states. [2024-11-10 00:07:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21180 to 21178. [2024-11-10 00:07:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21178 states, 21177 states have (on average 1.5366199178353874) internal successors, (32541), 21177 states have internal predecessors, (32541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21178 states to 21178 states and 32541 transitions. [2024-11-10 00:07:26,808 INFO L78 Accepts]: Start accepts. Automaton has 21178 states and 32541 transitions. Word has length 141 [2024-11-10 00:07:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:26,809 INFO L471 AbstractCegarLoop]: Abstraction has 21178 states and 32541 transitions. [2024-11-10 00:07:26,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21178 states and 32541 transitions. [2024-11-10 00:07:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 00:07:26,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:26,816 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:07:26,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -311127149, now seen corresponding path program 1 times [2024-11-10 00:07:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218954868] [2024-11-10 00:07:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218954868] [2024-11-10 00:07:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218954868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:27,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:07:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82407274] [2024-11-10 00:07:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:27,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:07:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:07:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:07:27,204 INFO L87 Difference]: Start difference. First operand 21178 states and 32541 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:27,641 INFO L93 Difference]: Finished difference Result 40394 states and 62057 transitions. [2024-11-10 00:07:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:07:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-10 00:07:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:27,723 INFO L225 Difference]: With dead ends: 40394 [2024-11-10 00:07:27,723 INFO L226 Difference]: Without dead ends: 29239 [2024-11-10 00:07:27,746 INFO L431 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 [2024-11-10 00:07:27,747 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 233 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:27,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29239 states. [2024-11-10 00:07:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29239 to 29237. [2024-11-10 00:07:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29237 states, 29236 states have (on average 1.5291763579148994) internal successors, (44707), 29236 states have internal predecessors, (44707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29237 states to 29237 states and 44707 transitions. [2024-11-10 00:07:28,640 INFO L78 Accepts]: Start accepts. Automaton has 29237 states and 44707 transitions. Word has length 141 [2024-11-10 00:07:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 29237 states and 44707 transitions. [2024-11-10 00:07:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 29237 states and 44707 transitions. [2024-11-10 00:07:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 00:07:28,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:28,647 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:07:28,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash 446045331, now seen corresponding path program 1 times [2024-11-10 00:07:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010686904] [2024-11-10 00:07:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:28,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010686904] [2024-11-10 00:07:28,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010686904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:28,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:07:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061782812] [2024-11-10 00:07:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:28,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:07:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:07:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:07:28,916 INFO L87 Difference]: Start difference. First operand 29237 states and 44707 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:29,660 INFO L93 Difference]: Finished difference Result 95250 states and 145748 transitions. [2024-11-10 00:07:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:07:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-11-10 00:07:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:29,880 INFO L225 Difference]: With dead ends: 95250 [2024-11-10 00:07:29,881 INFO L226 Difference]: Without dead ends: 66329 [2024-11-10 00:07:29,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:07:29,943 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 791 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:29,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:07:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66329 states. [2024-11-10 00:07:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66329 to 47694. [2024-11-10 00:07:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47694 states, 47693 states have (on average 1.5237875579225464) internal successors, (72674), 47693 states have internal predecessors, (72674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47694 states to 47694 states and 72674 transitions. [2024-11-10 00:07:31,285 INFO L78 Accepts]: Start accepts. Automaton has 47694 states and 72674 transitions. Word has length 143 [2024-11-10 00:07:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 47694 states and 72674 transitions. [2024-11-10 00:07:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 47694 states and 72674 transitions. [2024-11-10 00:07:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 00:07:31,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:31,287 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:31,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:07:31,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:31,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash -282155168, now seen corresponding path program 1 times [2024-11-10 00:07:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035390106] [2024-11-10 00:07:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035390106] [2024-11-10 00:07:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035390106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:31,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:31,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:07:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861884070] [2024-11-10 00:07:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:31,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:07:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:07:31,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:07:31,744 INFO L87 Difference]: Start difference. First operand 47694 states and 72674 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:32,666 INFO L93 Difference]: Finished difference Result 154720 states and 235894 transitions. [2024-11-10 00:07:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:07:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-11-10 00:07:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:33,054 INFO L225 Difference]: With dead ends: 154720 [2024-11-10 00:07:33,055 INFO L226 Difference]: Without dead ends: 107342 [2024-11-10 00:07:33,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:07:33,168 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 789 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:33,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107342 states. [2024-11-10 00:07:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107342 to 77375. [2024-11-10 00:07:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77375 states, 77374 states have (on average 1.5183007211724868) internal successors, (117477), 77374 states have internal predecessors, (117477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77375 states to 77375 states and 117477 transitions. [2024-11-10 00:07:35,287 INFO L78 Accepts]: Start accepts. Automaton has 77375 states and 117477 transitions. Word has length 145 [2024-11-10 00:07:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:35,288 INFO L471 AbstractCegarLoop]: Abstraction has 77375 states and 117477 transitions. [2024-11-10 00:07:35,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 77375 states and 117477 transitions. [2024-11-10 00:07:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 00:07:35,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:35,290 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:35,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:07:35,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash -357832904, now seen corresponding path program 1 times [2024-11-10 00:07:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840401123] [2024-11-10 00:07:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840401123] [2024-11-10 00:07:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840401123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:35,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:07:35,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287448319] [2024-11-10 00:07:35,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:35,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:07:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:35,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:07:35,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:07:35,516 INFO L87 Difference]: Start difference. First operand 77375 states and 117477 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:37,100 INFO L93 Difference]: Finished difference Result 248206 states and 377056 transitions. [2024-11-10 00:07:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:07:37,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-10 00:07:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:37,621 INFO L225 Difference]: With dead ends: 248206 [2024-11-10 00:07:37,622 INFO L226 Difference]: Without dead ends: 171147 [2024-11-10 00:07:37,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:07:37,779 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 787 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:37,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2106 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171147 states. [2024-11-10 00:07:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171147 to 124036. [2024-11-10 00:07:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124036 states, 124035 states have (on average 1.5128633047123796) internal successors, (187648), 124035 states have internal predecessors, (187648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124036 states to 124036 states and 187648 transitions. [2024-11-10 00:07:40,806 INFO L78 Accepts]: Start accepts. Automaton has 124036 states and 187648 transitions. Word has length 147 [2024-11-10 00:07:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 124036 states and 187648 transitions. [2024-11-10 00:07:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 124036 states and 187648 transitions. [2024-11-10 00:07:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 00:07:40,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:40,810 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:07:40,810 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -211326771, now seen corresponding path program 1 times [2024-11-10 00:07:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856073347] [2024-11-10 00:07:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856073347] [2024-11-10 00:07:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856073347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:07:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255567614] [2024-11-10 00:07:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:07:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:07:42,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:07:42,022 INFO L87 Difference]: Start difference. First operand 124036 states and 187648 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:42,963 INFO L93 Difference]: Finished difference Result 247758 states and 374825 transitions. [2024-11-10 00:07:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:07:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-10 00:07:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:43,790 INFO L225 Difference]: With dead ends: 247758 [2024-11-10 00:07:43,790 INFO L226 Difference]: Without dead ends: 124038 [2024-11-10 00:07:43,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:07:43,896 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 899 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:43,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 2427 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:07:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124038 states. [2024-11-10 00:07:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124038 to 124036. [2024-11-10 00:07:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124036 states, 124035 states have (on average 1.5078244044019833) internal successors, (187023), 124035 states have internal predecessors, (187023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124036 states to 124036 states and 187023 transitions. [2024-11-10 00:07:45,884 INFO L78 Accepts]: Start accepts. Automaton has 124036 states and 187023 transitions. Word has length 150 [2024-11-10 00:07:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:45,885 INFO L471 AbstractCegarLoop]: Abstraction has 124036 states and 187023 transitions. [2024-11-10 00:07:45,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 124036 states and 187023 transitions. [2024-11-10 00:07:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 00:07:45,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:45,887 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:45,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:07:45,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:45,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -423859539, now seen corresponding path program 1 times [2024-11-10 00:07:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983886250] [2024-11-10 00:07:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983886250] [2024-11-10 00:07:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983886250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:07:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321275922] [2024-11-10 00:07:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:07:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:07:46,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:07:46,400 INFO L87 Difference]: Start difference. First operand 124036 states and 187023 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:48,297 INFO L93 Difference]: Finished difference Result 362380 states and 546925 transitions. [2024-11-10 00:07:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:07:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-10 00:07:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:48,864 INFO L225 Difference]: With dead ends: 362380 [2024-11-10 00:07:48,865 INFO L226 Difference]: Without dead ends: 238660 [2024-11-10 00:07:49,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:07:49,039 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 443 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:49,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 2438 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:07:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238660 states. [2024-11-10 00:07:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238660 to 238658. [2024-11-10 00:07:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238658 states, 238657 states have (on average 1.5015524371797182) internal successors, (358356), 238657 states have internal predecessors, (358356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238658 states to 238658 states and 358356 transitions. [2024-11-10 00:07:54,011 INFO L78 Accepts]: Start accepts. Automaton has 238658 states and 358356 transitions. Word has length 157 [2024-11-10 00:07:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:07:54,012 INFO L471 AbstractCegarLoop]: Abstraction has 238658 states and 358356 transitions. [2024-11-10 00:07:54,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 238658 states and 358356 transitions. [2024-11-10 00:07:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 00:07:54,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:07:54,014 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:07:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:07:54,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:07:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:07:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2119908899, now seen corresponding path program 1 times [2024-11-10 00:07:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:07:54,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19538316] [2024-11-10 00:07:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:07:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:07:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:07:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:07:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:07:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19538316] [2024-11-10 00:07:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19538316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:07:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:07:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:07:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123109966] [2024-11-10 00:07:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:07:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:07:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:07:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:07:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:07:55,921 INFO L87 Difference]: Start difference. First operand 238658 states and 358356 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:07:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:07:56,806 INFO L93 Difference]: Finished difference Result 257562 states and 379195 transitions. [2024-11-10 00:07:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:07:56,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-10 00:07:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:07:57,374 INFO L225 Difference]: With dead ends: 257562 [2024-11-10 00:07:57,374 INFO L226 Difference]: Without dead ends: 257560 [2024-11-10 00:07:57,481 INFO L431 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 [2024-11-10 00:07:57,481 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 0 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:07:57,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:07:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257560 states. [2024-11-10 00:08:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257560 to 257560. [2024-11-10 00:08:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257560 states, 257559 states have (on average 1.46463917005424) internal successors, (377231), 257559 states have internal predecessors, (377231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:08:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257560 states to 257560 states and 377231 transitions. [2024-11-10 00:08:02,670 INFO L78 Accepts]: Start accepts. Automaton has 257560 states and 377231 transitions. Word has length 160 [2024-11-10 00:08:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:08:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 257560 states and 377231 transitions. [2024-11-10 00:08:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:08:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 257560 states and 377231 transitions. [2024-11-10 00:08:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 00:08:02,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:08:02,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:08:02,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:08:02,684 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:08:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:08:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1902367098, now seen corresponding path program 1 times [2024-11-10 00:08:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:08:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310394528] [2024-11-10 00:08:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:08:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:08:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:08:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:08:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:08:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310394528] [2024-11-10 00:08:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310394528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:08:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:08:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:08:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601904174] [2024-11-10 00:08:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:08:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:08:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:08:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:08:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:08:03,926 INFO L87 Difference]: Start difference. First operand 257560 states and 377231 transitions. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:08:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:08:07,305 INFO L93 Difference]: Finished difference Result 706886 states and 1035630 transitions. [2024-11-10 00:08:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:08:07,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 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 203 [2024-11-10 00:08:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:08:08,794 INFO L225 Difference]: With dead ends: 706886 [2024-11-10 00:08:08,795 INFO L226 Difference]: Without dead ends: 590484 [2024-11-10 00:08:08,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:08:08,991 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 1769 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:08:08,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 3521 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:08:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590484 states. [2024-11-10 00:08:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590484 to 415316. [2024-11-10 00:08:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415316 states, 415315 states have (on average 1.4618614786366975) internal successors, (607133), 415315 states have internal predecessors, (607133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:08:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415316 states to 415316 states and 607133 transitions. [2024-11-10 00:08:18,939 INFO L78 Accepts]: Start accepts. Automaton has 415316 states and 607133 transitions. Word has length 203 [2024-11-10 00:08:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:08:18,939 INFO L471 AbstractCegarLoop]: Abstraction has 415316 states and 607133 transitions. [2024-11-10 00:08:18,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:08:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 415316 states and 607133 transitions. [2024-11-10 00:08:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 00:08:18,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:08:18,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:08:18,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:08:18,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:08:18,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:08:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2078008276, now seen corresponding path program 1 times [2024-11-10 00:08:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:08:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036673414] [2024-11-10 00:08:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:08:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:08:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:08:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 00:08:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:08:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036673414] [2024-11-10 00:08:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036673414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:08:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:08:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:08:19,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024304858] [2024-11-10 00:08:19,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:08:19,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:08:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:08:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:08:19,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:08:19,283 INFO L87 Difference]: Start difference. First operand 415316 states and 607133 transitions. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)