./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:46:13,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:46:13,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:46:13,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:46:13,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:46:13,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:46:13,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:46:13,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:46:13,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:46:13,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:46:13,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:46:13,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:46:13,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:46:13,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:46:13,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:46:13,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:46:13,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:46:13,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:46:13,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:46:13,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:46:13,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:46:13,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:46:13,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:46:13,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:46:13,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:46:13,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:46:13,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:46:13,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:46:13,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:46:13,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:46:13,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:46:13,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:46:13,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:46:13,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:46:13,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:46:13,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:46:13,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:46:13,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:46:13,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:46:13,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:46:13,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:46:13,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:46:13,373 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 -> 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb [2024-11-16 08:46:13,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:46:13,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:46:13,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:46:13,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:46:13,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:46:13,620 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-16 08:46:15,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:46:15,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:46:15,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-16 08:46:15,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3614c107/265dedef88cf4bc8969bd76bc1c9edf9/FLAG0a5d3a80f [2024-11-16 08:46:15,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3614c107/265dedef88cf4bc8969bd76bc1c9edf9 [2024-11-16 08:46:15,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:46:15,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:46:15,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:46:15,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:46:15,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:46:15,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:15,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60dfd524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15, skipping insertion in model container [2024-11-16 08:46:15,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:15,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:46:15,750 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2024-11-16 08:46:15,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:46:15,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:46:15,888 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2024-11-16 08:46:15,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:46:15,941 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:46:15,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15 WrapperNode [2024-11-16 08:46:15,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:46:15,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:46:15,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:46:15,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:46:15,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:15,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,023 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1020 [2024-11-16 08:46:16,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:46:16,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:46:16,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:46:16,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:46:16,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,074 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-16 08:46:16,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:46:16,116 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:46:16,116 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:46:16,116 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:46:16,117 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (1/1) ... [2024-11-16 08:46:16,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:46:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:46:16,155 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-16 08:46:16,159 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-16 08:46:16,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:46:16,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:46:16,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:46:16,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:46:16,315 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:46:16,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:46:17,061 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;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-16 08:46:17,062 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1131: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-16 08:46:17,062 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc main_~node2__newmax~2#1; [2024-11-16 08:46:17,062 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node3__newmax~2#1; [2024-11-16 08:46:17,063 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1011: havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-16 08:46:17,063 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~check__tmp~2#1; [2024-11-16 08:46:17,063 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-16 08:46:17,176 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-16 08:46:17,176 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:46:17,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:46:17,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:46:17,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:46:17 BoogieIcfgContainer [2024-11-16 08:46:17,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:46:17,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:46:17,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:46:17,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:46:17,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:46:15" (1/3) ... [2024-11-16 08:46:17,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a009042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:46:17, skipping insertion in model container [2024-11-16 08:46:17,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:46:15" (2/3) ... [2024-11-16 08:46:17,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a009042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:46:17, skipping insertion in model container [2024-11-16 08:46:17,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:46:17" (3/3) ... [2024-11-16 08:46:17,209 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-16 08:46:17,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:46:17,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:46:17,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:46:17,304 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;@4c7d02ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:46:17,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:46:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 276 states, 274 states have (on average 1.6788321167883211) internal successors, (460), 275 states have internal predecessors, (460), 0 states have call successors, (0), 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-16 08:46:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 08:46:17,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:17,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:17,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:17,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 845483583, now seen corresponding path program 1 times [2024-11-16 08:46:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106411748] [2024-11-16 08:46:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:18,195 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-16 08:46:18,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:18,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106411748] [2024-11-16 08:46:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106411748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:18,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896344452] [2024-11-16 08:46:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:18,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:18,227 INFO L87 Difference]: Start difference. First operand has 276 states, 274 states have (on average 1.6788321167883211) internal successors, (460), 275 states have internal predecessors, (460), 0 states have call successors, (0), 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 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 08:46:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:18,444 INFO L93 Difference]: Finished difference Result 1307 states and 2191 transitions. [2024-11-16 08:46:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:18,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-16 08:46:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:18,466 INFO L225 Difference]: With dead ends: 1307 [2024-11-16 08:46:18,467 INFO L226 Difference]: Without dead ends: 1034 [2024-11-16 08:46:18,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:18,473 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 1335 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:18,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2016 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:46:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-16 08:46:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 522. [2024-11-16 08:46:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4261036468330135) internal successors, (743), 521 states have internal predecessors, (743), 0 states have call successors, (0), 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-16 08:46:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 743 transitions. [2024-11-16 08:46:18,524 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 743 transitions. Word has length 107 [2024-11-16 08:46:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:18,525 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 743 transitions. [2024-11-16 08:46:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 08:46:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 743 transitions. [2024-11-16 08:46:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 08:46:18,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:18,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:46:18,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1849757994, now seen corresponding path program 1 times [2024-11-16 08:46:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352465146] [2024-11-16 08:46:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:18,594 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-16 08:46:18,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:18,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352465146] [2024-11-16 08:46:18,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352465146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331977670] [2024-11-16 08:46:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:18,597 INFO L87 Difference]: Start difference. First operand 522 states and 743 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 08:46:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:18,624 INFO L93 Difference]: Finished difference Result 1013 states and 1438 transitions. [2024-11-16 08:46:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-16 08:46:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:18,626 INFO L225 Difference]: With dead ends: 1013 [2024-11-16 08:46:18,627 INFO L226 Difference]: Without dead ends: 524 [2024-11-16 08:46:18,628 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-16 08:46:18,631 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:18,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 778 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-16 08:46:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2024-11-16 08:46:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.4244741873804971) internal successors, (745), 523 states have internal predecessors, (745), 0 states have call successors, (0), 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-16 08:46:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 745 transitions. [2024-11-16 08:46:18,655 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 745 transitions. Word has length 108 [2024-11-16 08:46:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:18,656 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 745 transitions. [2024-11-16 08:46:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 08:46:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 745 transitions. [2024-11-16 08:46:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 08:46:18,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:18,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:46:18,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -688458520, now seen corresponding path program 1 times [2024-11-16 08:46:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586168035] [2024-11-16 08:46:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:19,041 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-16 08:46:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586168035] [2024-11-16 08:46:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586168035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572049930] [2024-11-16 08:46:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:19,046 INFO L87 Difference]: Start difference. First operand 524 states and 745 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 08:46:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:19,070 INFO L93 Difference]: Finished difference Result 1038 states and 1476 transitions. [2024-11-16 08:46:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:46:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-16 08:46:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:19,072 INFO L225 Difference]: With dead ends: 1038 [2024-11-16 08:46:19,072 INFO L226 Difference]: Without dead ends: 522 [2024-11-16 08:46:19,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:19,074 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 30 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:19,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1260 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-16 08:46:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-16 08:46:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4222648752399232) internal successors, (741), 521 states have internal predecessors, (741), 0 states have call successors, (0), 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-16 08:46:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 741 transitions. [2024-11-16 08:46:19,087 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 741 transitions. Word has length 109 [2024-11-16 08:46:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:19,087 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 741 transitions. [2024-11-16 08:46:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 08:46:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 741 transitions. [2024-11-16 08:46:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 08:46:19,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:19,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:46:19,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1035325058, now seen corresponding path program 1 times [2024-11-16 08:46:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523899036] [2024-11-16 08:46:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:19,169 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-16 08:46:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523899036] [2024-11-16 08:46:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523899036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:19,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715914353] [2024-11-16 08:46:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:19,173 INFO L87 Difference]: Start difference. First operand 522 states and 741 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 08:46:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:19,205 INFO L93 Difference]: Finished difference Result 1104 states and 1617 transitions. [2024-11-16 08:46:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:19,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-16 08:46:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:19,207 INFO L225 Difference]: With dead ends: 1104 [2024-11-16 08:46:19,208 INFO L226 Difference]: Without dead ends: 718 [2024-11-16 08:46:19,208 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-16 08:46:19,212 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 253 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:19,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 809 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-16 08:46:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 700. [2024-11-16 08:46:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.452074391988555) internal successors, (1015), 699 states have internal predecessors, (1015), 0 states have call successors, (0), 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-16 08:46:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1015 transitions. [2024-11-16 08:46:19,225 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1015 transitions. Word has length 109 [2024-11-16 08:46:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1015 transitions. [2024-11-16 08:46:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 08:46:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1015 transitions. [2024-11-16 08:46:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 08:46:19,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:19,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:19,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:46:19,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:19,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:19,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1820473430, now seen corresponding path program 1 times [2024-11-16 08:46:19,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:19,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873690158] [2024-11-16 08:46:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:19,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:19,330 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-16 08:46:19,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:19,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873690158] [2024-11-16 08:46:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873690158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:19,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066348437] [2024-11-16 08:46:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:19,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:19,335 INFO L87 Difference]: Start difference. First operand 700 states and 1015 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-16 08:46:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:19,368 INFO L93 Difference]: Finished difference Result 1528 states and 2233 transitions. [2024-11-16 08:46:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-16 08:46:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:19,371 INFO L225 Difference]: With dead ends: 1528 [2024-11-16 08:46:19,372 INFO L226 Difference]: Without dead ends: 1035 [2024-11-16 08:46:19,373 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-16 08:46:19,374 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 318 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:19,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 812 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-16 08:46:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1033. [2024-11-16 08:46:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.435077519379845) internal successors, (1481), 1032 states have internal predecessors, (1481), 0 states have call successors, (0), 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-16 08:46:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1481 transitions. [2024-11-16 08:46:19,391 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1481 transitions. Word has length 110 [2024-11-16 08:46:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:19,391 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1481 transitions. [2024-11-16 08:46:19,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-16 08:46:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1481 transitions. [2024-11-16 08:46:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 08:46:19,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:19,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:19,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:46:19,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1280262142, now seen corresponding path program 1 times [2024-11-16 08:46:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871208513] [2024-11-16 08:46:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:19,481 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-16 08:46:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871208513] [2024-11-16 08:46:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871208513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366296313] [2024-11-16 08:46:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:19,486 INFO L87 Difference]: Start difference. First operand 1033 states and 1481 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-16 08:46:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:19,524 INFO L93 Difference]: Finished difference Result 2300 states and 3389 transitions. [2024-11-16 08:46:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:19,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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 112 [2024-11-16 08:46:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:19,530 INFO L225 Difference]: With dead ends: 2300 [2024-11-16 08:46:19,530 INFO L226 Difference]: Without dead ends: 1554 [2024-11-16 08:46:19,531 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-16 08:46:19,532 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 266 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:19,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 780 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2024-11-16 08:46:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1504. [2024-11-16 08:46:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 1.4577511643379908) internal successors, (2191), 1503 states have internal predecessors, (2191), 0 states have call successors, (0), 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-16 08:46:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2191 transitions. [2024-11-16 08:46:19,559 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2191 transitions. Word has length 112 [2024-11-16 08:46:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:19,559 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2191 transitions. [2024-11-16 08:46:19,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-16 08:46:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2191 transitions. [2024-11-16 08:46:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 08:46:19,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:19,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:19,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:46:19,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:19,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -974217825, now seen corresponding path program 1 times [2024-11-16 08:46:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411741620] [2024-11-16 08:46:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:19,812 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-16 08:46:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411741620] [2024-11-16 08:46:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411741620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502519663] [2024-11-16 08:46:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:19,815 INFO L87 Difference]: Start difference. First operand 1504 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-16 08:46:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:19,897 INFO L93 Difference]: Finished difference Result 3835 states and 5593 transitions. [2024-11-16 08:46:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 112 [2024-11-16 08:46:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:19,904 INFO L225 Difference]: With dead ends: 3835 [2024-11-16 08:46:19,904 INFO L226 Difference]: Without dead ends: 2353 [2024-11-16 08:46:19,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:19,907 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 321 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:19,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1525 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2024-11-16 08:46:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2351. [2024-11-16 08:46:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 2350 states have (on average 1.4493617021276595) internal successors, (3406), 2350 states have internal predecessors, (3406), 0 states have call successors, (0), 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-16 08:46:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3406 transitions. [2024-11-16 08:46:20,005 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3406 transitions. Word has length 112 [2024-11-16 08:46:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:20,009 INFO L471 AbstractCegarLoop]: Abstraction has 2351 states and 3406 transitions. [2024-11-16 08:46:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-16 08:46:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3406 transitions. [2024-11-16 08:46:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 08:46:20,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:20,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:46:20,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 860178913, now seen corresponding path program 1 times [2024-11-16 08:46:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:20,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244859205] [2024-11-16 08:46:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:20,339 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-16 08:46:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244859205] [2024-11-16 08:46:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244859205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:20,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564156500] [2024-11-16 08:46:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:20,341 INFO L87 Difference]: Start difference. First operand 2351 states and 3406 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:20,373 INFO L93 Difference]: Finished difference Result 4118 states and 5987 transitions. [2024-11-16 08:46:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:46:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:20,379 INFO L225 Difference]: With dead ends: 4118 [2024-11-16 08:46:20,379 INFO L226 Difference]: Without dead ends: 2351 [2024-11-16 08:46:20,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:20,383 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 23 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:20,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1224 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-11-16 08:46:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2351. [2024-11-16 08:46:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 2350 states have (on average 1.4489361702127659) internal successors, (3405), 2350 states have internal predecessors, (3405), 0 states have call successors, (0), 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-16 08:46:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3405 transitions. [2024-11-16 08:46:20,428 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3405 transitions. Word has length 115 [2024-11-16 08:46:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 2351 states and 3405 transitions. [2024-11-16 08:46:20,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3405 transitions. [2024-11-16 08:46:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 08:46:20,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:20,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:20,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:46:20,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:20,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1898763487, now seen corresponding path program 1 times [2024-11-16 08:46:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806358978] [2024-11-16 08:46:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:20,526 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-16 08:46:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806358978] [2024-11-16 08:46:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806358978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194233683] [2024-11-16 08:46:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:20,530 INFO L87 Difference]: Start difference. First operand 2351 states and 3405 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:20,577 INFO L93 Difference]: Finished difference Result 5565 states and 8132 transitions. [2024-11-16 08:46:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:20,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:20,589 INFO L225 Difference]: With dead ends: 5565 [2024-11-16 08:46:20,590 INFO L226 Difference]: Without dead ends: 3595 [2024-11-16 08:46:20,593 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-16 08:46:20,595 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 309 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:20,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 845 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2024-11-16 08:46:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3593. [2024-11-16 08:46:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3592 states have (on average 1.4387527839643652) internal successors, (5168), 3592 states have internal predecessors, (5168), 0 states have call successors, (0), 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-16 08:46:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5168 transitions. [2024-11-16 08:46:20,656 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5168 transitions. Word has length 115 [2024-11-16 08:46:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 5168 transitions. [2024-11-16 08:46:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 08:46:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5168 transitions. [2024-11-16 08:46:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 08:46:20,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:20,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:20,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:46:20,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:20,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -60232126, now seen corresponding path program 1 times [2024-11-16 08:46:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30621295] [2024-11-16 08:46:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:20,732 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-16 08:46:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30621295] [2024-11-16 08:46:20,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30621295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:20,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:20,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305593034] [2024-11-16 08:46:20,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:20,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:20,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:20,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:20,735 INFO L87 Difference]: Start difference. First operand 3593 states and 5168 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 08:46:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:20,795 INFO L93 Difference]: Finished difference Result 9235 states and 13509 transitions. [2024-11-16 08:46:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-16 08:46:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:20,812 INFO L225 Difference]: With dead ends: 9235 [2024-11-16 08:46:20,812 INFO L226 Difference]: Without dead ends: 5997 [2024-11-16 08:46:20,817 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-16 08:46:20,818 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 253 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:20,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 786 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2024-11-16 08:46:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 5759. [2024-11-16 08:46:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 5758 states have (on average 1.4551927752691907) internal successors, (8379), 5758 states have internal predecessors, (8379), 0 states have call successors, (0), 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-16 08:46:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 8379 transitions. [2024-11-16 08:46:20,926 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 8379 transitions. Word has length 117 [2024-11-16 08:46:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:20,928 INFO L471 AbstractCegarLoop]: Abstraction has 5759 states and 8379 transitions. [2024-11-16 08:46:20,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 08:46:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 8379 transitions. [2024-11-16 08:46:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 08:46:20,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:20,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:20,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:46:20,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1879937491, now seen corresponding path program 1 times [2024-11-16 08:46:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33349404] [2024-11-16 08:46:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:21,143 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-16 08:46:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:21,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33349404] [2024-11-16 08:46:21,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33349404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:21,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:21,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231801550] [2024-11-16 08:46:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:21,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:21,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:21,145 INFO L87 Difference]: Start difference. First operand 5759 states and 8379 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 08:46:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:21,298 INFO L93 Difference]: Finished difference Result 26370 states and 38292 transitions. [2024-11-16 08:46:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-16 08:46:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:21,350 INFO L225 Difference]: With dead ends: 26370 [2024-11-16 08:46:21,350 INFO L226 Difference]: Without dead ends: 20659 [2024-11-16 08:46:21,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:21,364 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 1032 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:21,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1631 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:46:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20659 states. [2024-11-16 08:46:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20659 to 10380. [2024-11-16 08:46:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10380 states, 10379 states have (on average 1.439637730031795) internal successors, (14942), 10379 states have internal predecessors, (14942), 0 states have call successors, (0), 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-16 08:46:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 14942 transitions. [2024-11-16 08:46:21,657 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 14942 transitions. Word has length 117 [2024-11-16 08:46:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:21,657 INFO L471 AbstractCegarLoop]: Abstraction has 10380 states and 14942 transitions. [2024-11-16 08:46:21,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 08:46:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 14942 transitions. [2024-11-16 08:46:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 08:46:21,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:21,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:46:21,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -488495786, now seen corresponding path program 1 times [2024-11-16 08:46:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187618196] [2024-11-16 08:46:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:21,714 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-16 08:46:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187618196] [2024-11-16 08:46:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187618196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536764645] [2024-11-16 08:46:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:21,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:21,717 INFO L87 Difference]: Start difference. First operand 10380 states and 14942 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-16 08:46:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:21,777 INFO L93 Difference]: Finished difference Result 20649 states and 29743 transitions. [2024-11-16 08:46:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-16 08:46:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:21,792 INFO L225 Difference]: With dead ends: 20649 [2024-11-16 08:46:21,792 INFO L226 Difference]: Without dead ends: 10386 [2024-11-16 08:46:21,803 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-16 08:46:21,804 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:21,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2024-11-16 08:46:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 10386. [2024-11-16 08:46:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10386 states, 10385 states have (on average 1.439383726528647) internal successors, (14948), 10385 states have internal predecessors, (14948), 0 states have call successors, (0), 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-16 08:46:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10386 states to 10386 states and 14948 transitions. [2024-11-16 08:46:22,044 INFO L78 Accepts]: Start accepts. Automaton has 10386 states and 14948 transitions. Word has length 118 [2024-11-16 08:46:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:22,044 INFO L471 AbstractCegarLoop]: Abstraction has 10386 states and 14948 transitions. [2024-11-16 08:46:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-16 08:46:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 10386 states and 14948 transitions. [2024-11-16 08:46:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 08:46:22,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:22,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:22,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:46:22,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:22,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -551981994, now seen corresponding path program 1 times [2024-11-16 08:46:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:22,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149196558] [2024-11-16 08:46:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:22,336 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-16 08:46:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149196558] [2024-11-16 08:46:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149196558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:22,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400402484] [2024-11-16 08:46:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:22,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:22,339 INFO L87 Difference]: Start difference. First operand 10386 states and 14948 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:46:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:22,412 INFO L93 Difference]: Finished difference Result 20732 states and 29842 transitions. [2024-11-16 08:46:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:46:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-16 08:46:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:22,429 INFO L225 Difference]: With dead ends: 20732 [2024-11-16 08:46:22,429 INFO L226 Difference]: Without dead ends: 10380 [2024-11-16 08:46:22,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:22,443 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 18 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:22,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1202 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10380 states. [2024-11-16 08:46:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10380 to 10380. [2024-11-16 08:46:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10380 states, 10379 states have (on average 1.4390596396569997) internal successors, (14936), 10379 states have internal predecessors, (14936), 0 states have call successors, (0), 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-16 08:46:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 14936 transitions. [2024-11-16 08:46:22,692 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 14936 transitions. Word has length 119 [2024-11-16 08:46:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:22,693 INFO L471 AbstractCegarLoop]: Abstraction has 10380 states and 14936 transitions. [2024-11-16 08:46:22,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:46:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 14936 transitions. [2024-11-16 08:46:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 08:46:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:22,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:22,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:46:22,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -421847914, now seen corresponding path program 1 times [2024-11-16 08:46:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205634581] [2024-11-16 08:46:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:22,775 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-16 08:46:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205634581] [2024-11-16 08:46:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205634581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345264946] [2024-11-16 08:46:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:22,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:22,777 INFO L87 Difference]: Start difference. First operand 10380 states and 14936 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-16 08:46:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:22,862 INFO L93 Difference]: Finished difference Result 24639 states and 35550 transitions. [2024-11-16 08:46:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:22,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-16 08:46:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:22,885 INFO L225 Difference]: With dead ends: 24639 [2024-11-16 08:46:22,885 INFO L226 Difference]: Without dead ends: 15043 [2024-11-16 08:46:22,899 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-16 08:46:22,900 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 293 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:22,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15043 states. [2024-11-16 08:46:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15043 to 15041. [2024-11-16 08:46:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15041 states, 15040 states have (on average 1.419813829787234) internal successors, (21354), 15040 states have internal predecessors, (21354), 0 states have call successors, (0), 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-16 08:46:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 21354 transitions. [2024-11-16 08:46:23,136 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 21354 transitions. Word has length 120 [2024-11-16 08:46:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 15041 states and 21354 transitions. [2024-11-16 08:46:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-16 08:46:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 21354 transitions. [2024-11-16 08:46:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 08:46:23,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:23,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:46:23,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:23,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 269534112, now seen corresponding path program 1 times [2024-11-16 08:46:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717068632] [2024-11-16 08:46:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:23,230 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-16 08:46:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717068632] [2024-11-16 08:46:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717068632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809577914] [2024-11-16 08:46:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:46:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:46:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:23,232 INFO L87 Difference]: Start difference. First operand 15041 states and 21354 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:23,377 INFO L93 Difference]: Finished difference Result 28060 states and 40057 transitions. [2024-11-16 08:46:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-16 08:46:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:23,398 INFO L225 Difference]: With dead ends: 28060 [2024-11-16 08:46:23,399 INFO L226 Difference]: Without dead ends: 15041 [2024-11-16 08:46:23,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:46:23,415 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 950 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:23,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 406 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:46:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15041 states. [2024-11-16 08:46:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15041 to 15041. [2024-11-16 08:46:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15041 states, 15040 states have (on average 1.4107712765957447) internal successors, (21218), 15040 states have internal predecessors, (21218), 0 states have call successors, (0), 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-16 08:46:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 21218 transitions. [2024-11-16 08:46:23,811 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 21218 transitions. Word has length 122 [2024-11-16 08:46:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:23,811 INFO L471 AbstractCegarLoop]: Abstraction has 15041 states and 21218 transitions. [2024-11-16 08:46:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 21218 transitions. [2024-11-16 08:46:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 08:46:23,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:23,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 08:46:23,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -444544863, now seen corresponding path program 1 times [2024-11-16 08:46:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056739709] [2024-11-16 08:46:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:24,085 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-16 08:46:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056739709] [2024-11-16 08:46:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056739709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:46:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819190330] [2024-11-16 08:46:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:46:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:46:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:46:24,088 INFO L87 Difference]: Start difference. First operand 15041 states and 21218 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:24,372 INFO L93 Difference]: Finished difference Result 41657 states and 59628 transitions. [2024-11-16 08:46:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:46:24,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-16 08:46:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:24,419 INFO L225 Difference]: With dead ends: 41657 [2024-11-16 08:46:24,420 INFO L226 Difference]: Without dead ends: 28405 [2024-11-16 08:46:24,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:46:24,437 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1178 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:24,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 912 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:46:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28405 states. [2024-11-16 08:46:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28405 to 28403. [2024-11-16 08:46:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28403 states, 28402 states have (on average 1.4220829519047955) internal successors, (40390), 28402 states have internal predecessors, (40390), 0 states have call successors, (0), 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-16 08:46:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28403 states to 28403 states and 40390 transitions. [2024-11-16 08:46:25,105 INFO L78 Accepts]: Start accepts. Automaton has 28403 states and 40390 transitions. Word has length 122 [2024-11-16 08:46:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 28403 states and 40390 transitions. [2024-11-16 08:46:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28403 states and 40390 transitions. [2024-11-16 08:46:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 08:46:25,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:25,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:25,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:46:25,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -954017953, now seen corresponding path program 1 times [2024-11-16 08:46:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260875552] [2024-11-16 08:46:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:25,280 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-16 08:46:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260875552] [2024-11-16 08:46:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260875552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:46:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294940675] [2024-11-16 08:46:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:46:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:46:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:25,282 INFO L87 Difference]: Start difference. First operand 28403 states and 40390 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:25,630 INFO L93 Difference]: Finished difference Result 78791 states and 113640 transitions. [2024-11-16 08:46:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-16 08:46:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:25,725 INFO L225 Difference]: With dead ends: 78791 [2024-11-16 08:46:25,725 INFO L226 Difference]: Without dead ends: 53597 [2024-11-16 08:46:25,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:46:25,754 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 220 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:25,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1262 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:46:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53597 states. [2024-11-16 08:46:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53597 to 53595. [2024-11-16 08:46:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53595 states, 53594 states have (on average 1.4177333283576519) internal successors, (75982), 53594 states have internal predecessors, (75982), 0 states have call successors, (0), 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-16 08:46:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53595 states to 53595 states and 75982 transitions. [2024-11-16 08:46:26,635 INFO L78 Accepts]: Start accepts. Automaton has 53595 states and 75982 transitions. Word has length 122 [2024-11-16 08:46:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:26,636 INFO L471 AbstractCegarLoop]: Abstraction has 53595 states and 75982 transitions. [2024-11-16 08:46:26,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53595 states and 75982 transitions. [2024-11-16 08:46:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 08:46:26,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:26,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:26,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 08:46:26,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -516931421, now seen corresponding path program 1 times [2024-11-16 08:46:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448410171] [2024-11-16 08:46:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:26,959 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-16 08:46:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448410171] [2024-11-16 08:46:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448410171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319769287] [2024-11-16 08:46:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:26,961 INFO L87 Difference]: Start difference. First operand 53595 states and 75982 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:27,338 INFO L93 Difference]: Finished difference Result 102975 states and 145975 transitions. [2024-11-16 08:46:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:27,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-16 08:46:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:27,438 INFO L225 Difference]: With dead ends: 102975 [2024-11-16 08:46:27,438 INFO L226 Difference]: Without dead ends: 49699 [2024-11-16 08:46:27,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:27,468 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 305 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:27,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1090 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49699 states. [2024-11-16 08:46:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49699 to 49654. [2024-11-16 08:46:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49654 states, 49653 states have (on average 1.4158056914990031) internal successors, (70299), 49653 states have internal predecessors, (70299), 0 states have call successors, (0), 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-16 08:46:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49654 states to 49654 states and 70299 transitions. [2024-11-16 08:46:28,223 INFO L78 Accepts]: Start accepts. Automaton has 49654 states and 70299 transitions. Word has length 122 [2024-11-16 08:46:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:28,224 INFO L471 AbstractCegarLoop]: Abstraction has 49654 states and 70299 transitions. [2024-11-16 08:46:28,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-16 08:46:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49654 states and 70299 transitions. [2024-11-16 08:46:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 08:46:28,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:28,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 08:46:28,230 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:28,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1915009538, now seen corresponding path program 1 times [2024-11-16 08:46:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:28,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320280248] [2024-11-16 08:46:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:28,681 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-16 08:46:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320280248] [2024-11-16 08:46:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320280248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987152583] [2024-11-16 08:46:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:28,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:28,682 INFO L87 Difference]: Start difference. First operand 49654 states and 70299 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 08:46:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:29,100 INFO L93 Difference]: Finished difference Result 148876 states and 210786 transitions. [2024-11-16 08:46:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-16 08:46:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:29,263 INFO L225 Difference]: With dead ends: 148876 [2024-11-16 08:46:29,263 INFO L226 Difference]: Without dead ends: 99396 [2024-11-16 08:46:29,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:29,323 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 975 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:29,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1546 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:46:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99396 states. [2024-11-16 08:46:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99396 to 49752. [2024-11-16 08:46:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49752 states, 49751 states have (on average 1.4150469337299754) internal successors, (70400), 49751 states have internal predecessors, (70400), 0 states have call successors, (0), 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-16 08:46:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49752 states to 49752 states and 70400 transitions. [2024-11-16 08:46:30,511 INFO L78 Accepts]: Start accepts. Automaton has 49752 states and 70400 transitions. Word has length 125 [2024-11-16 08:46:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:30,513 INFO L471 AbstractCegarLoop]: Abstraction has 49752 states and 70400 transitions. [2024-11-16 08:46:30,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 08:46:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49752 states and 70400 transitions. [2024-11-16 08:46:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 08:46:30,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:30,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 08:46:30,692 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:30,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1639858973, now seen corresponding path program 1 times [2024-11-16 08:46:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531725760] [2024-11-16 08:46:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:30,798 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-16 08:46:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531725760] [2024-11-16 08:46:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531725760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:30,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:46:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573634048] [2024-11-16 08:46:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:46:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:46:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:46:30,800 INFO L87 Difference]: Start difference. First operand 49752 states and 70400 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 08:46:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:31,033 INFO L93 Difference]: Finished difference Result 86494 states and 122460 transitions. [2024-11-16 08:46:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:46:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-16 08:46:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:31,106 INFO L225 Difference]: With dead ends: 86494 [2024-11-16 08:46:31,106 INFO L226 Difference]: Without dead ends: 49762 [2024-11-16 08:46:31,143 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-16 08:46:31,144 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:31,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 740 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49762 states. [2024-11-16 08:46:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49762 to 49762. [2024-11-16 08:46:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49762 states, 49761 states have (on average 1.4149635256526196) internal successors, (70410), 49761 states have internal predecessors, (70410), 0 states have call successors, (0), 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-16 08:46:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49762 states to 49762 states and 70410 transitions. [2024-11-16 08:46:31,949 INFO L78 Accepts]: Start accepts. Automaton has 49762 states and 70410 transitions. Word has length 126 [2024-11-16 08:46:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:31,950 INFO L471 AbstractCegarLoop]: Abstraction has 49762 states and 70410 transitions. [2024-11-16 08:46:31,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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-16 08:46:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49762 states and 70410 transitions. [2024-11-16 08:46:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 08:46:31,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:31,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:31,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 08:46:31,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:31,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash -813880651, now seen corresponding path program 1 times [2024-11-16 08:46:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762134202] [2024-11-16 08:46:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:32,238 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-16 08:46:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762134202] [2024-11-16 08:46:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762134202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:32,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:32,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:46:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981218222] [2024-11-16 08:46:32,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:32,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:46:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:32,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:46:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:32,241 INFO L87 Difference]: Start difference. First operand 49762 states and 70410 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 08:46:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:32,759 INFO L93 Difference]: Finished difference Result 91760 states and 129866 transitions. [2024-11-16 08:46:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:46:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-16 08:46:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:32,869 INFO L225 Difference]: With dead ends: 91760 [2024-11-16 08:46:32,870 INFO L226 Difference]: Without dead ends: 49759 [2024-11-16 08:46:32,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:46:32,886 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:32,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49759 states. [2024-11-16 08:46:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49759 to 49754. [2024-11-16 08:46:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49754 states, 49753 states have (on average 1.4148694551082346) internal successors, (70394), 49753 states have internal predecessors, (70394), 0 states have call successors, (0), 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-16 08:46:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49754 states to 49754 states and 70394 transitions. [2024-11-16 08:46:33,573 INFO L78 Accepts]: Start accepts. Automaton has 49754 states and 70394 transitions. Word has length 127 [2024-11-16 08:46:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 49754 states and 70394 transitions. [2024-11-16 08:46:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 08:46:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49754 states and 70394 transitions. [2024-11-16 08:46:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 08:46:33,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:33,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:33,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 08:46:33,577 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:33,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -358463517, now seen corresponding path program 1 times [2024-11-16 08:46:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567988271] [2024-11-16 08:46:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:46:33,799 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-16 08:46:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:46:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567988271] [2024-11-16 08:46:33,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567988271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:46:33,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:46:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:46:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927283307] [2024-11-16 08:46:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:46:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:46:33,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:46:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:46:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:33,801 INFO L87 Difference]: Start difference. First operand 49754 states and 70394 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 08:46:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:46:34,015 INFO L93 Difference]: Finished difference Result 82624 states and 116921 transitions. [2024-11-16 08:46:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:46:34,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-16 08:46:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:46:34,071 INFO L225 Difference]: With dead ends: 82624 [2024-11-16 08:46:34,071 INFO L226 Difference]: Without dead ends: 46074 [2024-11-16 08:46:34,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:46:34,102 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 302 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:46:34,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1118 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:46:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2024-11-16 08:46:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 45902. [2024-11-16 08:46:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45902 states, 45901 states have (on average 1.4129103941090608) internal successors, (64854), 45901 states have internal predecessors, (64854), 0 states have call successors, (0), 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-16 08:46:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45902 states to 45902 states and 64854 transitions. [2024-11-16 08:46:34,861 INFO L78 Accepts]: Start accepts. Automaton has 45902 states and 64854 transitions. Word has length 128 [2024-11-16 08:46:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:46:34,862 INFO L471 AbstractCegarLoop]: Abstraction has 45902 states and 64854 transitions. [2024-11-16 08:46:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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-16 08:46:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45902 states and 64854 transitions. [2024-11-16 08:46:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 08:46:34,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:46:34,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:46:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 08:46:34,866 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:46:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:46:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1980323842, now seen corresponding path program 1 times [2024-11-16 08:46:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:46:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440539434] [2024-11-16 08:46:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:46:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:46:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:46:34,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:46:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:46:35,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:46:35,050 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:46:35,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:46:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 08:46:35,054 INFO L407 BasicCegarLoop]: Path program histogram: [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-16 08:46:35,201 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:46:35,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:46:35 BoogieIcfgContainer [2024-11-16 08:46:35,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:46:35,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:46:35,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:46:35,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:46:35,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:46:17" (3/4) ... [2024-11-16 08:46:35,207 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:46:35,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:46:35,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:46:35,370 INFO L158 Benchmark]: Toolchain (without parser) took 20043.90ms. Allocated memory was 184.5MB in the beginning and 11.8GB in the end (delta: 11.6GB). Free memory was 110.0MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-16 08:46:35,370 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:46:35,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.84ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 139.1MB in the end (delta: -29.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-16 08:46:35,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.73ms. Allocated memory is still 184.5MB. Free memory was 139.1MB in the beginning and 133.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 08:46:35,373 INFO L158 Benchmark]: Boogie Preprocessor took 90.50ms. Allocated memory is still 184.5MB. Free memory was 132.8MB in the beginning and 128.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 08:46:35,373 INFO L158 Benchmark]: IcfgBuilder took 1084.97ms. Allocated memory was 184.5MB in the beginning and 295.7MB in the end (delta: 111.1MB). Free memory was 128.6MB in the beginning and 254.5MB in the end (delta: -125.9MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-11-16 08:46:35,373 INFO L158 Benchmark]: TraceAbstraction took 18001.83ms. Allocated memory was 295.7MB in the beginning and 11.8GB in the end (delta: 11.5GB). Free memory was 254.5MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-16 08:46:35,373 INFO L158 Benchmark]: Witness Printer took 164.49ms. Allocated memory is still 11.8GB. Free memory was 10.4GB in the beginning and 10.3GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 08:46:35,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.84ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 139.1MB in the end (delta: -29.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.73ms. Allocated memory is still 184.5MB. Free memory was 139.1MB in the beginning and 133.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.50ms. Allocated memory is still 184.5MB. Free memory was 132.8MB in the beginning and 128.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1084.97ms. Allocated memory was 184.5MB in the beginning and 295.7MB in the end (delta: 111.1MB). Free memory was 128.6MB in the beginning and 254.5MB in the end (delta: -125.9MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18001.83ms. Allocated memory was 295.7MB in the beginning and 11.8GB in the end (delta: 11.5GB). Free memory was 254.5MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 164.49ms. Allocated memory is still 11.8GB. Free memory was 10.4GB in the beginning and 10.3GB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 595]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] port_t p12 = 0; [L28] char p12_old = '\x0'; [L29] char p12_new = '\x0'; [L30] _Bool ep12 = 0; [L31] port_t p13 = 0; [L32] char p13_old = '\x0'; [L33] char p13_new = '\x0'; [L34] _Bool ep13 = 0; [L35] port_t p21 = 0; [L36] char p21_old = '\x0'; [L37] char p21_new = '\x0'; [L38] _Bool ep21 = 0; [L39] port_t p23 = 0; [L40] char p23_old = '\x0'; [L41] char p23_new = '\x0'; [L42] _Bool ep23 = 0; [L43] port_t p31 = 0; [L44] char p31_old = '\x0'; [L45] char p31_new = '\x0'; [L46] _Bool ep31 = 0; [L47] port_t p32 = 0; [L48] char p32_old = '\x0'; [L49] char p32_new = '\x0'; [L50] _Bool ep32 = 0; [L51] char id1 = '\x0'; [L52] unsigned char r1 = '\x0'; [L53] char st1 = '\x0'; [L54] char nl1 = '\x0'; [L55] char m1 = '\x0'; [L56] char max1 = '\x0'; [L57] _Bool mode1 = 0; [L58] _Bool newmax1 = 0; [L59] char id2 = '\x0'; [L60] unsigned char r2 = '\x0'; [L61] char st2 = '\x0'; [L62] char nl2 = '\x0'; [L63] char m2 = '\x0'; [L64] char max2 = '\x0'; [L65] _Bool mode2 = 0; [L66] _Bool newmax2 = 0; [L67] char id3 = '\x0'; [L68] unsigned char r3 = '\x0'; [L69] char st3 = '\x0'; [L70] char nl3 = '\x0'; [L71] char m3 = '\x0'; [L72] char max3 = '\x0'; [L73] _Bool mode3 = 0; [L74] _Bool newmax3 = 0; [L78] void (*nodes[3])() = { &node1, &node2, &node3 }; [L82] int __return_1248; [L83] int __return_1394; [L84] int __return_1528; [L85] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L88] int main__c1; [L89] int main__i2; [L90] main__c1 = 0 [L91] ep12 = __VERIFIER_nondet_bool() [L92] ep13 = __VERIFIER_nondet_bool() [L93] ep21 = __VERIFIER_nondet_bool() [L94] ep23 = __VERIFIER_nondet_bool() [L95] ep31 = __VERIFIER_nondet_bool() [L96] ep32 = __VERIFIER_nondet_bool() [L97] id1 = __VERIFIER_nondet_char() [L98] r1 = __VERIFIER_nondet_uchar() [L99] st1 = __VERIFIER_nondet_char() [L100] nl1 = __VERIFIER_nondet_char() [L101] m1 = __VERIFIER_nondet_char() [L102] max1 = __VERIFIER_nondet_char() [L103] mode1 = __VERIFIER_nondet_bool() [L104] newmax1 = __VERIFIER_nondet_bool() [L105] id2 = __VERIFIER_nondet_char() [L106] r2 = __VERIFIER_nondet_uchar() [L107] st2 = __VERIFIER_nondet_char() [L108] nl2 = __VERIFIER_nondet_char() [L109] m2 = __VERIFIER_nondet_char() [L110] max2 = __VERIFIER_nondet_char() [L111] mode2 = __VERIFIER_nondet_bool() [L112] newmax2 = __VERIFIER_nondet_bool() [L113] id3 = __VERIFIER_nondet_char() [L114] r3 = __VERIFIER_nondet_uchar() [L115] st3 = __VERIFIER_nondet_char() [L116] nl3 = __VERIFIER_nondet_char() [L117] m3 = __VERIFIER_nondet_char() [L118] max3 = __VERIFIER_nondet_char() [L119] mode3 = __VERIFIER_nondet_bool() [L120] newmax3 = __VERIFIER_nondet_bool() [L122] _Bool init__r121; [L123] _Bool init__r131; [L124] _Bool init__r211; [L125] _Bool init__r231; [L126] _Bool init__r311; [L127] _Bool init__r321; [L128] _Bool init__r122; [L129] int init__tmp; [L130] _Bool init__r132; [L131] int init__tmp___0; [L132] _Bool init__r212; [L133] int init__tmp___1; [L134] _Bool init__r232; [L135] int init__tmp___2; [L136] _Bool init__r312; [L137] int init__tmp___3; [L138] _Bool init__r322; [L139] int init__tmp___4; [L140] int init__tmp___5; [L141] init__r121 = ep12 [L142] init__r131 = ep13 [L143] init__r211 = ep21 [L144] init__r231 = ep23 [L145] init__r311 = ep31 [L146] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L147] COND FALSE !(!(init__r121 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1796] COND TRUE !(init__r131 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1798] COND TRUE !(ep32 == 0) [L1800] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L151] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L152] COND TRUE !(init__r131 == 0) [L154] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L156] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L157] COND TRUE !(init__r211 == 0) [L159] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L161] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L162] COND FALSE !(!(init__r231 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1727] COND TRUE !(init__r211 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1729] COND TRUE !(ep13 == 0) [L1731] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L166] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] COND FALSE !(!(init__r311 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1704] COND TRUE !(init__r321 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1706] COND TRUE !(ep21 == 0) [L1708] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L171] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L172] COND TRUE !(init__r321 == 0) [L174] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L176] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L185] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L191] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L229] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND TRUE !(newmax3 == 0) [L237] init__tmp___5 = 1 [L238] __return_1248 = init__tmp___5 [L239] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L240] COND TRUE main__i2 != 0 [L242] p12_old = nomsg [L243] p12_new = nomsg [L244] p13_old = nomsg [L245] p13_new = nomsg [L246] p21_old = nomsg [L247] p21_new = nomsg [L248] p23_old = nomsg [L249] p23_new = nomsg [L250] p31_old = nomsg [L251] p31_new = nomsg [L252] p32_old = nomsg [L253] p32_new = nomsg [L254] main__i2 = 0 [L256] _Bool node1__newmax; [L257] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L281] COND TRUE !(newmax1 == 0) [L283] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE p13_new == nomsg [L288] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=6, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode1 = 1 [L294] _Bool node2__newmax; [L295] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L296] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L306] COND TRUE !(newmax2 == 0) [L308] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L309] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] COND TRUE p21_new == nomsg [L313] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L315] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L317] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L330] mode2 = 1 [L332] _Bool node3__newmax; [L333] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L334] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE !(newmax3 == 0) [L359] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND TRUE p32_new == nomsg [L364] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=5, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] mode3 = 1 [L369] p12_old = p12_new [L370] p12_new = nomsg [L371] p13_old = p13_new [L372] p13_new = nomsg [L373] p21_old = p21_new [L374] p21_new = nomsg [L375] p23_old = p23_new [L376] p23_new = nomsg [L377] p31_old = p31_new [L378] p31_new = nomsg [L379] p32_old = p32_new [L380] p32_new = nomsg [L382] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)r1) < 2 [L411] check__tmp = 1 [L412] __return_1394 = check__tmp [L413] main__c1 = __return_1394 [L415] _Bool __tmp_1; [L416] __tmp_1 = main__c1 [L417] _Bool assert__arg; [L418] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND FALSE !(assert__arg == 0) [L426] _Bool node1__newmax; [L427] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L428] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND FALSE !(r1 == 255) [L436] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE !(ep21 == 0) [L439] m1 = p21_old [L440] p21_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L446] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int)max1) == ((int)id1) [L460] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L462] mode1 = 0 [L464] _Bool node2__newmax; [L465] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L466] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L468] COND FALSE !(r2 == 255) [L474] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L475] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L484] COND TRUE !(ep32 == 0) [L486] m2 = p32_old [L487] p32_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=4, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L488] COND TRUE ((int)m2) > ((int)max2) [L490] max2 = m2 [L491] node2__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=5, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L493] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=5, max3=5, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L494] COND FALSE !(((int)r2) == 2) [L500] mode2 = 0 [L502] _Bool node3__newmax; [L503] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L504] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L506] COND FALSE !(r3 == 255) [L512] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, max1=6, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L513] COND TRUE !(ep13 == 0) [L515] m3 = p13_old [L516] p13_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] COND TRUE ((int)m3) > ((int)max3) [L519] max3 = m3 [L520] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L522] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L531] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L532] COND FALSE !(((int)r3) == 2) [L538] mode3 = 0 [L539] p12_old = p12_new [L540] p12_new = nomsg [L541] p13_old = p13_new [L542] p13_new = nomsg [L543] p21_old = p21_new [L544] p21_new = nomsg [L545] p23_old = p23_new [L546] p23_new = nomsg [L547] p31_old = p31_new [L548] p31_new = nomsg [L549] p32_old = p32_new [L550] p32_new = nomsg [L552] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L555] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L557] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L559] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L561] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L567] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1206] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L585] __return_1528 = check__tmp [L586] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main__c1=0, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L589] _Bool __tmp_2; [L590] __tmp_2 = main__c1 [L591] _Bool assert__arg; [L592] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L593] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L595] reach_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 276 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8382 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8382 mSDsluCounter, 23671 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13054 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 10617 mSDtfsCounter, 577 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53595occurred in iteration=17, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 60975 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2713 NumberOfCodeBlocks, 2713 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2560 ConstructedInterpolants, 0 QuantifiedInterpolants, 7840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 08:46:35,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE