./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.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.3.1.ufo.UNBOUNDED.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 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:05:05,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:05:05,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:05:05,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:05:05,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:05:05,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:05:05,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:05:05,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:05:05,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:05:05,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:05:05,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:05:05,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:05:05,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:05:05,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:05:05,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:05:05,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:05:05,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:05:05,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:05:05,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:05:05,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:05:05,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:05:05,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:05:05,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:05:05,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:05:05,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:05:05,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:05:05,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:05:05,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:05:05,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:05:05,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:05:05,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:05:05,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:05:05,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:05:05,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:05:05,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:05:05,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:05:05,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:05:05,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:05:05,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:05:05,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:05:05,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:05:05,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:05:05,155 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 -> 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 [2024-11-10 00:05:05,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:05:05,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:05:05,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:05:05,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:05:05,493 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:05:05,494 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.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:05:07,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:05:07,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:05:07,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:05:07,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a69b1c6/634b420c1f854599abe00b471ba93864/FLAG254336ca3 [2024-11-10 00:05:07,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a69b1c6/634b420c1f854599abe00b471ba93864 [2024-11-10 00:05:07,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:05:07,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:05:07,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:05:07,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:05:07,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:05:07,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:05:07" (1/1) ... [2024-11-10 00:05:07,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697450ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:07, skipping insertion in model container [2024-11-10 00:05:07,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:05:07" (1/1) ... [2024-11-10 00:05:07,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:05:08,090 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.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2024-11-10 00:05:08,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:05:08,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:05:08,201 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.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2024-11-10 00:05:08,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:05:08,248 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:05:08,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08 WrapperNode [2024-11-10 00:05:08,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:05:08,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:05:08,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:05:08,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:05:08,257 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:05:08" (1/1) ... [2024-11-10 00:05:08,269 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:05:08" (1/1) ... [2024-11-10 00:05:08,322 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 670 [2024-11-10 00:05:08,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:05:08,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:05:08,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:05:08,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:05:08,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,372 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:05:08,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:05:08,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:05:08,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:05:08,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:05:08,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (1/1) ... [2024-11-10 00:05:08,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:05:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:05:08,455 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:05:08,458 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:05:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:05:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:05:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:05:08,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:05:08,681 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:05:08,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:05:09,423 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,424 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,424 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,424 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L316: havoc main_~node3__newmax~0#1;havoc main_~node2__newmax~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,427 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,427 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,427 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,427 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,427 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,428 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,429 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,430 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,430 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,430 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,432 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,433 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L547: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L547: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L547: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,434 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L547: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:05:09,497 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-10 00:05:09,497 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:05:09,522 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:05:09,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:05:09,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:05:09 BoogieIcfgContainer [2024-11-10 00:05:09,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:05:09,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:05:09,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:05:09,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:05:09,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:05:07" (1/3) ... [2024-11-10 00:05:09,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5212b2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:05:09, skipping insertion in model container [2024-11-10 00:05:09,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:05:08" (2/3) ... [2024-11-10 00:05:09,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5212b2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:05:09, skipping insertion in model container [2024-11-10 00:05:09,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:05:09" (3/3) ... [2024-11-10 00:05:09,535 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:05:09,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:05:09,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:05:09,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:05:09,722 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;@c98f5ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:05:09,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:05:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 170 states have (on average 1.6352941176470588) internal successors, (278), 171 states have internal predecessors, (278), 0 states have call successors, (0), 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:05:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:05:09,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:09,746 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] [2024-11-10 00:05:09,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1874822071, now seen corresponding path program 1 times [2024-11-10 00:05:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122021620] [2024-11-10 00:05:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:10,332 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:05:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122021620] [2024-11-10 00:05:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122021620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521874711] [2024-11-10 00:05:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:10,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:10,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:10,380 INFO L87 Difference]: Start difference. First operand has 172 states, 170 states have (on average 1.6352941176470588) internal successors, (278), 171 states have internal predecessors, (278), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:10,526 INFO L93 Difference]: Finished difference Result 389 states and 613 transitions. [2024-11-10 00:05:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 00:05:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:10,546 INFO L225 Difference]: With dead ends: 389 [2024-11-10 00:05:10,547 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 00:05:10,550 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:05:10,556 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 166 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:10,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 493 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 00:05:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-11-10 00:05:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5) internal successors, (396), 264 states have internal predecessors, (396), 0 states have call successors, (0), 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:05:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2024-11-10 00:05:10,616 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 56 [2024-11-10 00:05:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:10,616 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2024-11-10 00:05:10,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2024-11-10 00:05:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:05:10,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:10,619 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] [2024-11-10 00:05:10,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:05:10,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1712349228, now seen corresponding path program 1 times [2024-11-10 00:05:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936422317] [2024-11-10 00:05:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:10,880 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:05:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936422317] [2024-11-10 00:05:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936422317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:10,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250199443] [2024-11-10 00:05:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:10,885 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:05:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:10,941 INFO L93 Difference]: Finished difference Result 663 states and 1008 transitions. [2024-11-10 00:05:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:10,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-10 00:05:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:10,948 INFO L225 Difference]: With dead ends: 663 [2024-11-10 00:05:10,951 INFO L226 Difference]: Without dead ends: 455 [2024-11-10 00:05:10,952 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:05:10,954 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 147 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:10,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 468 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-10 00:05:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 451. [2024-11-10 00:05:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 0 states have call successors, (0), 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:05:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 680 transitions. [2024-11-10 00:05:10,988 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 680 transitions. Word has length 59 [2024-11-10 00:05:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:10,988 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 680 transitions. [2024-11-10 00:05:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:05:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 680 transitions. [2024-11-10 00:05:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:05:10,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:10,992 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] [2024-11-10 00:05:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:05:10,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:10,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash 200222147, now seen corresponding path program 1 times [2024-11-10 00:05:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821109329] [2024-11-10 00:05:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:11,182 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:05:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821109329] [2024-11-10 00:05:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821109329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104482161] [2024-11-10 00:05:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:11,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:11,187 INFO L87 Difference]: Start difference. First operand 451 states and 680 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:11,239 INFO L93 Difference]: Finished difference Result 1203 states and 1830 transitions. [2024-11-10 00:05:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:05:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:11,245 INFO L225 Difference]: With dead ends: 1203 [2024-11-10 00:05:11,246 INFO L226 Difference]: Without dead ends: 809 [2024-11-10 00:05:11,248 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:05:11,249 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 140 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:11,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 469 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-10 00:05:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 803. [2024-11-10 00:05:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.5112219451371571) internal successors, (1212), 802 states have internal predecessors, (1212), 0 states have call successors, (0), 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:05:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1212 transitions. [2024-11-10 00:05:11,278 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1212 transitions. Word has length 62 [2024-11-10 00:05:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1212 transitions. [2024-11-10 00:05:11,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1212 transitions. [2024-11-10 00:05:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:05:11,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:11,282 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] [2024-11-10 00:05:11,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:05:11,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:11,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -306136299, now seen corresponding path program 1 times [2024-11-10 00:05:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578247434] [2024-11-10 00:05:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:11,475 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:05:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578247434] [2024-11-10 00:05:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578247434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:11,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742041361] [2024-11-10 00:05:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:11,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:11,478 INFO L87 Difference]: Start difference. First operand 803 states and 1212 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:11,700 INFO L93 Difference]: Finished difference Result 3487 states and 5362 transitions. [2024-11-10 00:05:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:05:11,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-10 00:05:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:11,714 INFO L225 Difference]: With dead ends: 3487 [2024-11-10 00:05:11,714 INFO L226 Difference]: Without dead ends: 2741 [2024-11-10 00:05:11,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:05:11,722 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1007 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:11,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1864 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2024-11-10 00:05:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1440. [2024-11-10 00:05:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.5232800555941626) internal successors, (2192), 1439 states have internal predecessors, (2192), 0 states have call successors, (0), 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:05:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2192 transitions. [2024-11-10 00:05:11,780 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2192 transitions. Word has length 65 [2024-11-10 00:05:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2192 transitions. [2024-11-10 00:05:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2192 transitions. [2024-11-10 00:05:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:05:11,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:11,793 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] [2024-11-10 00:05:11,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:05:11,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2062461369, now seen corresponding path program 1 times [2024-11-10 00:05:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459549372] [2024-11-10 00:05:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:11,981 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:05:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459549372] [2024-11-10 00:05:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459549372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:11,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:11,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:05:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635940777] [2024-11-10 00:05:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:11,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:05:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:05:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:05:11,988 INFO L87 Difference]: Start difference. First operand 1440 states and 2192 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:12,115 INFO L93 Difference]: Finished difference Result 4233 states and 6501 transitions. [2024-11-10 00:05:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:05:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:05:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:12,127 INFO L225 Difference]: With dead ends: 4233 [2024-11-10 00:05:12,127 INFO L226 Difference]: Without dead ends: 2850 [2024-11-10 00:05:12,131 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:05:12,132 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 501 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 859 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:05:12,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 859 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2024-11-10 00:05:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2136. [2024-11-10 00:05:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 1.526463700234192) internal successors, (3259), 2135 states have internal predecessors, (3259), 0 states have call successors, (0), 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:05:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 3259 transitions. [2024-11-10 00:05:12,209 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 3259 transitions. Word has length 67 [2024-11-10 00:05:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 3259 transitions. [2024-11-10 00:05:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 3259 transitions. [2024-11-10 00:05:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:05:12,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:12,214 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] [2024-11-10 00:05:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:05:12,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 649822817, now seen corresponding path program 1 times [2024-11-10 00:05:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171944978] [2024-11-10 00:05:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:12,344 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:05:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:12,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171944978] [2024-11-10 00:05:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171944978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866389118] [2024-11-10 00:05:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:12,348 INFO L87 Difference]: Start difference. First operand 2136 states and 3259 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:12,396 INFO L93 Difference]: Finished difference Result 4736 states and 7261 transitions. [2024-11-10 00:05:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:05:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:12,410 INFO L225 Difference]: With dead ends: 4736 [2024-11-10 00:05:12,411 INFO L226 Difference]: Without dead ends: 3245 [2024-11-10 00:05:12,415 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:05:12,418 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 153 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 581 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:05:12,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 581 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2024-11-10 00:05:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3243. [2024-11-10 00:05:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 3242 states have (on average 1.5225169648365207) internal successors, (4936), 3242 states have internal predecessors, (4936), 0 states have call successors, (0), 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:05:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4936 transitions. [2024-11-10 00:05:12,496 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4936 transitions. Word has length 69 [2024-11-10 00:05:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:12,497 INFO L471 AbstractCegarLoop]: Abstraction has 3243 states and 4936 transitions. [2024-11-10 00:05:12,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4936 transitions. [2024-11-10 00:05:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:05:12,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:12,499 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] [2024-11-10 00:05:12,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:05:12,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:12,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 311859397, now seen corresponding path program 1 times [2024-11-10 00:05:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125096790] [2024-11-10 00:05:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:12,595 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:05:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125096790] [2024-11-10 00:05:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125096790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756373189] [2024-11-10 00:05:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:12,598 INFO L87 Difference]: Start difference. First operand 3243 states and 4936 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:12,647 INFO L93 Difference]: Finished difference Result 6345 states and 9669 transitions. [2024-11-10 00:05:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:05:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:12,664 INFO L225 Difference]: With dead ends: 6345 [2024-11-10 00:05:12,665 INFO L226 Difference]: Without dead ends: 4542 [2024-11-10 00:05:12,670 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:05:12,673 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 146 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 566 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:05:12,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 566 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-11-10 00:05:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4540. [2024-11-10 00:05:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 4539 states have (on average 1.5142101784534039) internal successors, (6873), 4539 states have internal predecessors, (6873), 0 states have call successors, (0), 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:05:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 6873 transitions. [2024-11-10 00:05:12,806 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 6873 transitions. Word has length 69 [2024-11-10 00:05:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:12,807 INFO L471 AbstractCegarLoop]: Abstraction has 4540 states and 6873 transitions. [2024-11-10 00:05:12,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 6873 transitions. [2024-11-10 00:05:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:05:12,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:12,809 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] [2024-11-10 00:05:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:05:12,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1246466655, now seen corresponding path program 1 times [2024-11-10 00:05:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414200537] [2024-11-10 00:05:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:12,920 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:05:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414200537] [2024-11-10 00:05:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414200537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132200630] [2024-11-10 00:05:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:12,924 INFO L87 Difference]: Start difference. First operand 4540 states and 6873 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:12,974 INFO L93 Difference]: Finished difference Result 8762 states and 13278 transitions. [2024-11-10 00:05:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:05:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:13,000 INFO L225 Difference]: With dead ends: 8762 [2024-11-10 00:05:13,000 INFO L226 Difference]: Without dead ends: 6269 [2024-11-10 00:05:13,007 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:05:13,007 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 139 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 542 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:05:13,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 542 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6269 states. [2024-11-10 00:05:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6269 to 6267. [2024-11-10 00:05:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6267 states, 6266 states have (on average 1.5043089690392595) internal successors, (9426), 6266 states have internal predecessors, (9426), 0 states have call successors, (0), 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:05:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 9426 transitions. [2024-11-10 00:05:13,212 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 9426 transitions. Word has length 69 [2024-11-10 00:05:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:13,219 INFO L471 AbstractCegarLoop]: Abstraction has 6267 states and 9426 transitions. [2024-11-10 00:05:13,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 9426 transitions. [2024-11-10 00:05:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:05:13,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:13,221 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] [2024-11-10 00:05:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:05:13,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 189562266, now seen corresponding path program 1 times [2024-11-10 00:05:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111402105] [2024-11-10 00:05:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:13,365 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:05:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111402105] [2024-11-10 00:05:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111402105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:05:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873088504] [2024-11-10 00:05:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:13,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:05:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:05:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:05:13,369 INFO L87 Difference]: Start difference. First operand 6267 states and 9426 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:13,510 INFO L93 Difference]: Finished difference Result 20009 states and 30157 transitions. [2024-11-10 00:05:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:05:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:05:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:13,574 INFO L225 Difference]: With dead ends: 20009 [2024-11-10 00:05:13,574 INFO L226 Difference]: Without dead ends: 13835 [2024-11-10 00:05:13,590 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:05:13,591 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 501 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:13,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 779 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2024-11-10 00:05:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 10022. [2024-11-10 00:05:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10022 states, 10021 states have (on average 1.497455343778066) internal successors, (15006), 10021 states have internal predecessors, (15006), 0 states have call successors, (0), 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:05:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10022 states to 10022 states and 15006 transitions. [2024-11-10 00:05:13,863 INFO L78 Accepts]: Start accepts. Automaton has 10022 states and 15006 transitions. Word has length 69 [2024-11-10 00:05:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:13,863 INFO L471 AbstractCegarLoop]: Abstraction has 10022 states and 15006 transitions. [2024-11-10 00:05:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10022 states and 15006 transitions. [2024-11-10 00:05:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:05:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:13,865 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] [2024-11-10 00:05:13,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:05:13,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:13,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2091797886, now seen corresponding path program 1 times [2024-11-10 00:05:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683971161] [2024-11-10 00:05:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:13,991 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:05:13,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:13,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683971161] [2024-11-10 00:05:13,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683971161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:13,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:13,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:05:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556548737] [2024-11-10 00:05:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:13,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:05:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:13,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:05:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:05:13,994 INFO L87 Difference]: Start difference. First operand 10022 states and 15006 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:05:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:14,236 INFO L93 Difference]: Finished difference Result 31411 states and 47105 transitions. [2024-11-10 00:05:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:05:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:05:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:14,286 INFO L225 Difference]: With dead ends: 31411 [2024-11-10 00:05:14,286 INFO L226 Difference]: Without dead ends: 21482 [2024-11-10 00:05:14,302 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:05:14,302 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 499 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 849 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:05:14,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 849 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21482 states. [2024-11-10 00:05:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21482 to 15709. [2024-11-10 00:05:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15709 states, 15708 states have (on average 1.490323402088108) internal successors, (23410), 15708 states have internal predecessors, (23410), 0 states have call successors, (0), 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:05:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 23410 transitions. [2024-11-10 00:05:14,634 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 23410 transitions. Word has length 71 [2024-11-10 00:05:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 15709 states and 23410 transitions. [2024-11-10 00:05:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:05:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 23410 transitions. [2024-11-10 00:05:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:05:14,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:14,636 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] [2024-11-10 00:05:14,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:05:14,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1904522869, now seen corresponding path program 1 times [2024-11-10 00:05:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886742416] [2024-11-10 00:05:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:15,000 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:05:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886742416] [2024-11-10 00:05:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886742416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652414159] [2024-11-10 00:05:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:15,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:15,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:15,003 INFO L87 Difference]: Start difference. First operand 15709 states and 23410 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:15,223 INFO L93 Difference]: Finished difference Result 31327 states and 46694 transitions. [2024-11-10 00:05:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-10 00:05:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:15,263 INFO L225 Difference]: With dead ends: 31327 [2024-11-10 00:05:15,263 INFO L226 Difference]: Without dead ends: 15711 [2024-11-10 00:05:15,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:05:15,289 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 283 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:15,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 684 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15711 states. [2024-11-10 00:05:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15711 to 15709. [2024-11-10 00:05:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15709 states, 15708 states have (on average 1.4823656735421442) internal successors, (23285), 15708 states have internal predecessors, (23285), 0 states have call successors, (0), 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:05:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 23285 transitions. [2024-11-10 00:05:15,665 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 23285 transitions. Word has length 74 [2024-11-10 00:05:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 15709 states and 23285 transitions. [2024-11-10 00:05:15,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 23285 transitions. [2024-11-10 00:05:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:05:15,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:15,667 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] [2024-11-10 00:05:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:05:15,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:15,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2086966483, now seen corresponding path program 1 times [2024-11-10 00:05:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:15,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388956039] [2024-11-10 00:05:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:15,985 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:05:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388956039] [2024-11-10 00:05:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388956039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:15,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:15,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195974174] [2024-11-10 00:05:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:15,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:15,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:15,988 INFO L87 Difference]: Start difference. First operand 15709 states and 23285 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:16,224 INFO L93 Difference]: Finished difference Result 44967 states and 66808 transitions. [2024-11-10 00:05:16,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:16,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:05:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:16,283 INFO L225 Difference]: With dead ends: 44967 [2024-11-10 00:05:16,283 INFO L226 Difference]: Without dead ends: 29351 [2024-11-10 00:05:16,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:05:16,314 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 412 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:16,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 688 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29351 states. [2024-11-10 00:05:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29351 to 29349. [2024-11-10 00:05:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29349 states, 29348 states have (on average 1.4740357094180183) internal successors, (43260), 29348 states have internal predecessors, (43260), 0 states have call successors, (0), 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:05:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29349 states to 29349 states and 43260 transitions. [2024-11-10 00:05:16,976 INFO L78 Accepts]: Start accepts. Automaton has 29349 states and 43260 transitions. Word has length 81 [2024-11-10 00:05:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:16,977 INFO L471 AbstractCegarLoop]: Abstraction has 29349 states and 43260 transitions. [2024-11-10 00:05:16,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29349 states and 43260 transitions. [2024-11-10 00:05:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 00:05:16,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:16,978 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] [2024-11-10 00:05:16,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:05:16,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1296565579, now seen corresponding path program 1 times [2024-11-10 00:05:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064557289] [2024-11-10 00:05:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:17,562 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:05:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064557289] [2024-11-10 00:05:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064557289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484271881] [2024-11-10 00:05:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:17,565 INFO L87 Difference]: Start difference. First operand 29349 states and 43260 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:17,701 INFO L93 Difference]: Finished difference Result 32539 states and 46811 transitions. [2024-11-10 00:05:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-10 00:05:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:17,758 INFO L225 Difference]: With dead ends: 32539 [2024-11-10 00:05:17,758 INFO L226 Difference]: Without dead ends: 32537 [2024-11-10 00:05:17,776 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:05:17,777 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:17,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32537 states. [2024-11-10 00:05:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32537 to 32537. [2024-11-10 00:05:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32537 states, 32536 states have (on average 1.427311285960167) internal successors, (46439), 32536 states have internal predecessors, (46439), 0 states have call successors, (0), 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:05:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32537 states to 32537 states and 46439 transitions. [2024-11-10 00:05:18,264 INFO L78 Accepts]: Start accepts. Automaton has 32537 states and 46439 transitions. Word has length 84 [2024-11-10 00:05:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:18,265 INFO L471 AbstractCegarLoop]: Abstraction has 32537 states and 46439 transitions. [2024-11-10 00:05:18,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32537 states and 46439 transitions. [2024-11-10 00:05:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 00:05:18,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:18,268 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:05:18,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1265184450, now seen corresponding path program 1 times [2024-11-10 00:05:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704543372] [2024-11-10 00:05:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:18,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 00:05:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704543372] [2024-11-10 00:05:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704543372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623366580] [2024-11-10 00:05:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:18,696 INFO L87 Difference]: Start difference. First operand 32537 states and 46439 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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:05:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:19,202 INFO L93 Difference]: Finished difference Result 80135 states and 114471 transitions. [2024-11-10 00:05:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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 113 [2024-11-10 00:05:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:19,341 INFO L225 Difference]: With dead ends: 80135 [2024-11-10 00:05:19,341 INFO L226 Difference]: Without dead ends: 64173 [2024-11-10 00:05:19,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:05:19,371 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 633 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:19,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1169 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64173 states. [2024-11-10 00:05:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64173 to 50083. [2024-11-10 00:05:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50083 states, 50082 states have (on average 1.4247234535362006) internal successors, (71353), 50082 states have internal predecessors, (71353), 0 states have call successors, (0), 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:05:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50083 states to 50083 states and 71353 transitions. [2024-11-10 00:05:20,382 INFO L78 Accepts]: Start accepts. Automaton has 50083 states and 71353 transitions. Word has length 113 [2024-11-10 00:05:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:20,382 INFO L471 AbstractCegarLoop]: Abstraction has 50083 states and 71353 transitions. [2024-11-10 00:05:20,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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:05:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 50083 states and 71353 transitions. [2024-11-10 00:05:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 00:05:20,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:20,386 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:20,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:05:20,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:20,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash 927221030, now seen corresponding path program 1 times [2024-11-10 00:05:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:20,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964454151] [2024-11-10 00:05:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:05:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964454151] [2024-11-10 00:05:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964454151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612651857] [2024-11-10 00:05:20,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:20,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:20,563 INFO L87 Difference]: Start difference. First operand 50083 states and 71353 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:05:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:21,210 INFO L93 Difference]: Finished difference Result 89685 states and 128207 transitions. [2024-11-10 00:05:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 113 [2024-11-10 00:05:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:21,376 INFO L225 Difference]: With dead ends: 89685 [2024-11-10 00:05:21,377 INFO L226 Difference]: Without dead ends: 74349 [2024-11-10 00:05:21,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:05:21,425 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 626 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:21,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1209 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74349 states. [2024-11-10 00:05:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74349 to 67991. [2024-11-10 00:05:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67991 states, 67990 states have (on average 1.4249595528754229) internal successors, (96883), 67990 states have internal predecessors, (96883), 0 states have call successors, (0), 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:05:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67991 states to 67991 states and 96883 transitions. [2024-11-10 00:05:22,831 INFO L78 Accepts]: Start accepts. Automaton has 67991 states and 96883 transitions. Word has length 113 [2024-11-10 00:05:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 67991 states and 96883 transitions. [2024-11-10 00:05:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:05:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 67991 states and 96883 transitions. [2024-11-10 00:05:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 00:05:22,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:22,833 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:05:22,834 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:22,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash -631105022, now seen corresponding path program 1 times [2024-11-10 00:05:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873578334] [2024-11-10 00:05:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 00:05:22,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873578334] [2024-11-10 00:05:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873578334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:05:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176634817] [2024-11-10 00:05:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:23,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:05:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:05:23,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:05:23,003 INFO L87 Difference]: Start difference. First operand 67991 states and 96883 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:23,412 INFO L93 Difference]: Finished difference Result 95795 states and 136957 transitions. [2024-11-10 00:05:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:05:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-10 00:05:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:23,588 INFO L225 Difference]: With dead ends: 95795 [2024-11-10 00:05:23,589 INFO L226 Difference]: Without dead ends: 80453 [2024-11-10 00:05:24,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:05:24,019 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 639 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:24,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1176 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:05:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80453 states. [2024-11-10 00:05:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80453 to 77919. [2024-11-10 00:05:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77919 states, 77918 states have (on average 1.4261531353474166) internal successors, (111123), 77918 states have internal predecessors, (111123), 0 states have call successors, (0), 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:05:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77919 states to 77919 states and 111123 transitions. [2024-11-10 00:05:25,181 INFO L78 Accepts]: Start accepts. Automaton has 77919 states and 111123 transitions. Word has length 113 [2024-11-10 00:05:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:25,182 INFO L471 AbstractCegarLoop]: Abstraction has 77919 states and 111123 transitions. [2024-11-10 00:05:25,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:05:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 77919 states and 111123 transitions. [2024-11-10 00:05:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 00:05:25,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:25,185 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:05:25,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 443257524, now seen corresponding path program 1 times [2024-11-10 00:05:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667034595] [2024-11-10 00:05:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 00:05:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667034595] [2024-11-10 00:05:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667034595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:25,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:05:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730797562] [2024-11-10 00:05:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:25,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:05:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:05:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:05:25,368 INFO L87 Difference]: Start difference. First operand 77919 states and 111123 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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:05:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:25,926 INFO L93 Difference]: Finished difference Result 127442 states and 182182 transitions. [2024-11-10 00:05:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:05:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 115 [2024-11-10 00:05:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:26,120 INFO L225 Difference]: With dead ends: 127442 [2024-11-10 00:05:26,121 INFO L226 Difference]: Without dead ends: 101304 [2024-11-10 00:05:26,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:05:26,183 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 284 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:26,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 799 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101304 states. [2024-11-10 00:05:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101304 to 98772. [2024-11-10 00:05:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98772 states, 98771 states have (on average 1.4253880187504429) internal successors, (140787), 98771 states have internal predecessors, (140787), 0 states have call successors, (0), 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:05:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98772 states to 98772 states and 140787 transitions. [2024-11-10 00:05:28,039 INFO L78 Accepts]: Start accepts. Automaton has 98772 states and 140787 transitions. Word has length 115 [2024-11-10 00:05:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 98772 states and 140787 transitions. [2024-11-10 00:05:28,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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:05:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 98772 states and 140787 transitions. [2024-11-10 00:05:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 00:05:28,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:28,043 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:05:28,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1362180810, now seen corresponding path program 1 times [2024-11-10 00:05:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435057143] [2024-11-10 00:05:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 00:05:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435057143] [2024-11-10 00:05:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435057143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824318968] [2024-11-10 00:05:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:28,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:28,138 INFO L87 Difference]: Start difference. First operand 98772 states and 140787 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:05:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:29,403 INFO L93 Difference]: Finished difference Result 214214 states and 305570 transitions. [2024-11-10 00:05:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 115 [2024-11-10 00:05:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:29,726 INFO L225 Difference]: With dead ends: 214214 [2024-11-10 00:05:29,726 INFO L226 Difference]: Without dead ends: 167392 [2024-11-10 00:05:29,777 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:05:29,778 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:29,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 460 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167392 states. [2024-11-10 00:05:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167392 to 167114. [2024-11-10 00:05:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167114 states, 167113 states have (on average 1.423270481650141) internal successors, (237847), 167113 states have internal predecessors, (237847), 0 states have call successors, (0), 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:05:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167114 states to 167114 states and 237847 transitions. [2024-11-10 00:05:32,998 INFO L78 Accepts]: Start accepts. Automaton has 167114 states and 237847 transitions. Word has length 115 [2024-11-10 00:05:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:32,998 INFO L471 AbstractCegarLoop]: Abstraction has 167114 states and 237847 transitions. [2024-11-10 00:05:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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:05:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 167114 states and 237847 transitions. [2024-11-10 00:05:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:05:33,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:33,002 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:33,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:05:33,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1948194244, now seen corresponding path program 1 times [2024-11-10 00:05:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:33,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418938379] [2024-11-10 00:05:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:05:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418938379] [2024-11-10 00:05:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418938379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:33,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:33,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756509214] [2024-11-10 00:05:33,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:33,103 INFO L87 Difference]: Start difference. First operand 167114 states and 237847 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:05:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:35,376 INFO L93 Difference]: Finished difference Result 494162 states and 701676 transitions. [2024-11-10 00:05:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-10 00:05:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:36,086 INFO L225 Difference]: With dead ends: 494162 [2024-11-10 00:05:36,086 INFO L226 Difference]: Without dead ends: 327126 [2024-11-10 00:05:36,215 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:05:36,216 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 159 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:36,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 552 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327126 states. [2024-11-10 00:05:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327126 to 327124. [2024-11-10 00:05:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327124 states, 327123 states have (on average 1.4114690804376335) internal successors, (461724), 327123 states have internal predecessors, (461724), 0 states have call successors, (0), 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:05:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327124 states to 327124 states and 461724 transitions. [2024-11-10 00:05:42,888 INFO L78 Accepts]: Start accepts. Automaton has 327124 states and 461724 transitions. Word has length 116 [2024-11-10 00:05:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:05:42,888 INFO L471 AbstractCegarLoop]: Abstraction has 327124 states and 461724 transitions. [2024-11-10 00:05:42,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:05:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 327124 states and 461724 transitions. [2024-11-10 00:05:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 00:05:42,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:05:42,893 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:05:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:05:42,894 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:05:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:05:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 549193097, now seen corresponding path program 1 times [2024-11-10 00:05:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:05:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692015032] [2024-11-10 00:05:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:05:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:05:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:05:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:05:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:05:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692015032] [2024-11-10 00:05:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692015032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:05:42,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:05:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:05:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289766176] [2024-11-10 00:05:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:05:42,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:05:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:05:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:05:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:05:42,981 INFO L87 Difference]: Start difference. First operand 327124 states and 461724 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:05:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:05:47,921 INFO L93 Difference]: Finished difference Result 967057 states and 1361519 transitions. [2024-11-10 00:05:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:05:47,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-10 00:05:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:05:49,638 INFO L225 Difference]: With dead ends: 967057 [2024-11-10 00:05:49,639 INFO L226 Difference]: Without dead ends: 640089 [2024-11-10 00:05:49,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:05:49,959 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 180 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:05:49,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 592 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:05:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640089 states. [2024-11-10 00:05:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640089 to 640087. [2024-11-10 00:06:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640087 states, 640086 states have (on average 1.399160425317848) internal successors, (895583), 640086 states have internal predecessors, (895583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)