./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 789c6269b6c837c39e5b0813dd594e0c19ce69080695551f96da6c745d9ba590 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:27:05,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:27:05,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:27:05,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:27:05,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:27:05,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:27:05,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:27:05,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:27:05,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:27:05,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:27:05,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:27:05,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:27:05,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:27:05,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:27:05,908 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:27:05,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:27:05,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:27:05,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:27:05,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:27:05,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:27:05,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:27:05,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:27:05,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:27:05,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:27:05,911 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 789c6269b6c837c39e5b0813dd594e0c19ce69080695551f96da6c745d9ba590 [2025-02-05 16:27:06,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:27:06,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:27:06,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:27:06,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:27:06,182 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:27:06,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:27:07,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123343317/b0bcc2a233a34ecdbdb3630351a39129/FLAG6e6e1cef1 [2025-02-05 16:27:07,835 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:27:07,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:27:07,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123343317/b0bcc2a233a34ecdbdb3630351a39129/FLAG6e6e1cef1 [2025-02-05 16:27:08,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123343317/b0bcc2a233a34ecdbdb3630351a39129 [2025-02-05 16:27:08,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:27:08,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:27:08,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:27:08,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:27:08,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:27:08,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5c4ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08, skipping insertion in model container [2025-02-05 16:27:08,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:27:08,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14148,14161] [2025-02-05 16:27:08,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15124,15137] [2025-02-05 16:27:08,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26469,26482] [2025-02-05 16:27:08,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27116,27129] [2025-02-05 16:27:08,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28392,28405] [2025-02-05 16:27:08,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:27:08,441 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:27:08,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14148,14161] [2025-02-05 16:27:08,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15124,15137] [2025-02-05 16:27:08,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26469,26482] [2025-02-05 16:27:08,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27116,27129] [2025-02-05 16:27:08,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28392,28405] [2025-02-05 16:27:08,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:27:08,598 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:27:08,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08 WrapperNode [2025-02-05 16:27:08,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:27:08,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:27:08,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:27:08,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:27:08,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,711 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1639 [2025-02-05 16:27:08,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:27:08,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:27:08,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:27:08,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:27:08,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:27:08,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:27:08,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:27:08,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:27:08,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:27:08,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (1/1) ... [2025-02-05 16:27:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:27:08,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:27:08,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:27:08,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:27:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:27:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:27:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:27:08,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:27:08,951 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:27:08,953 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:27:10,153 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L895: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1391: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L830: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~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_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~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; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694: havoc main_~check__tmp~7#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2063: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2097: havoc main_~check__tmp~11#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1179: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:10,154 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015: havoc main_~check__tmp~5#1; [2025-02-05 16:27:10,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-02-05 16:27:10,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:10,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587: havoc main_~check__tmp~6#1; [2025-02-05 16:27:10,213 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-02-05 16:27:10,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:27:10,230 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:27:10,230 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:27:10,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:27:10 BoogieIcfgContainer [2025-02-05 16:27:10,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:27:10,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:27:10,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:27:10,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:27:10,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:27:08" (1/3) ... [2025-02-05 16:27:10,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b5a2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:27:10, skipping insertion in model container [2025-02-05 16:27:10,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:08" (2/3) ... [2025-02-05 16:27:10,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b5a2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:27:10, skipping insertion in model container [2025-02-05 16:27:10,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:27:10" (3/3) ... [2025-02-05 16:27:10,237 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:27:10,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:27:10,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 388 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-02-05 16:27:10,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:27:10,309 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;@7083ba38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:27:10,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-05 16:27:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 16:27:10,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:10,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:10,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1630287152, now seen corresponding path program 1 times [2025-02-05 16:27:10,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309137896] [2025-02-05 16:27:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:10,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 16:27:10,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 16:27:10,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:10,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:10,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309137896] [2025-02-05 16:27:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309137896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460414016] [2025-02-05 16:27:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:10,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:10,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:10,866 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:11,037 INFO L93 Difference]: Finished difference Result 696 states and 1231 transitions. [2025-02-05 16:27:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-02-05 16:27:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:11,053 INFO L225 Difference]: With dead ends: 696 [2025-02-05 16:27:11,054 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 16:27:11,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:11,062 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 427 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:11,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1088 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 16:27:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2025-02-05 16:27:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4744525547445255) internal successors, (808), 552 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 808 transitions. [2025-02-05 16:27:11,124 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 808 transitions. Word has length 141 [2025-02-05 16:27:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:11,126 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 808 transitions. [2025-02-05 16:27:11,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 808 transitions. [2025-02-05 16:27:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 16:27:11,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:11,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:27:11,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash -655954000, now seen corresponding path program 1 times [2025-02-05 16:27:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487871666] [2025-02-05 16:27:11,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 16:27:11,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 16:27:11,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:11,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487871666] [2025-02-05 16:27:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487871666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:11,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010691013] [2025-02-05 16:27:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:11,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:11,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:11,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:11,660 INFO L87 Difference]: Start difference. First operand 553 states and 808 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:11,823 INFO L93 Difference]: Finished difference Result 2680 states and 3901 transitions. [2025-02-05 16:27:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-02-05 16:27:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:11,832 INFO L225 Difference]: With dead ends: 2680 [2025-02-05 16:27:11,833 INFO L226 Difference]: Without dead ends: 2136 [2025-02-05 16:27:11,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:11,839 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1577 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:11,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 2428 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-02-05 16:27:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1048. [2025-02-05 16:27:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1043 states have (on average 1.4621284755512944) internal successors, (1525), 1047 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1525 transitions. [2025-02-05 16:27:11,890 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1525 transitions. Word has length 141 [2025-02-05 16:27:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1525 transitions. [2025-02-05 16:27:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1525 transitions. [2025-02-05 16:27:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 16:27:11,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:11,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:11,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:27:11,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:11,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1063432246, now seen corresponding path program 1 times [2025-02-05 16:27:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374025115] [2025-02-05 16:27:11,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 16:27:11,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 16:27:11,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:11,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374025115] [2025-02-05 16:27:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374025115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505027521] [2025-02-05 16:27:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:12,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:12,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:12,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:12,020 INFO L87 Difference]: Start difference. First operand 1048 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:12,042 INFO L93 Difference]: Finished difference Result 2070 states and 3007 transitions. [2025-02-05 16:27:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 16:27:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:12,046 INFO L225 Difference]: With dead ends: 2070 [2025-02-05 16:27:12,046 INFO L226 Difference]: Without dead ends: 1050 [2025-02-05 16:27:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:12,050 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 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 [2025-02-05 16:27:12,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-02-05 16:27:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2025-02-05 16:27:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1045 states have (on average 1.461244019138756) internal successors, (1527), 1049 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1527 transitions. [2025-02-05 16:27:12,079 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1527 transitions. Word has length 142 [2025-02-05 16:27:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:12,079 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1527 transitions. [2025-02-05 16:27:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1527 transitions. [2025-02-05 16:27:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:27:12,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:12,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:12,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:27:12,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:12,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1360818792, now seen corresponding path program 1 times [2025-02-05 16:27:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999426726] [2025-02-05 16:27:12,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:12,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:27:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:27:12,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:12,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999426726] [2025-02-05 16:27:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999426726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669555097] [2025-02-05 16:27:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:12,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:12,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:12,567 INFO L87 Difference]: Start difference. First operand 1050 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:12,594 INFO L93 Difference]: Finished difference Result 2086 states and 3033 transitions. [2025-02-05 16:27:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:12,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:27:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:12,599 INFO L225 Difference]: With dead ends: 2086 [2025-02-05 16:27:12,599 INFO L226 Difference]: Without dead ends: 1050 [2025-02-05 16:27:12,601 INFO L434 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 [2025-02-05 16:27:12,602 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 20 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1718 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 [2025-02-05 16:27:12,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1718 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-02-05 16:27:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1049. [2025-02-05 16:27:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1044 states have (on average 1.4597701149425288) internal successors, (1524), 1048 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1524 transitions. [2025-02-05 16:27:12,623 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1524 transitions. Word has length 143 [2025-02-05 16:27:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:12,623 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1524 transitions. [2025-02-05 16:27:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1524 transitions. [2025-02-05 16:27:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:27:12,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:12,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:12,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:27:12,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -819236269, now seen corresponding path program 1 times [2025-02-05 16:27:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342112404] [2025-02-05 16:27:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:12,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:27:12,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:27:12,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:12,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:12,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342112404] [2025-02-05 16:27:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342112404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135817932] [2025-02-05 16:27:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:12,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:12,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:12,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:12,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:12,735 INFO L87 Difference]: Start difference. First operand 1049 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:12,782 INFO L93 Difference]: Finished difference Result 2911 states and 4239 transitions. [2025-02-05 16:27:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:27:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:12,788 INFO L225 Difference]: With dead ends: 2911 [2025-02-05 16:27:12,788 INFO L226 Difference]: Without dead ends: 2037 [2025-02-05 16:27:12,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:12,790 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 476 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:12,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1514 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2025-02-05 16:27:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2011. [2025-02-05 16:27:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 2006 states have (on average 1.4471585244267198) internal successors, (2903), 2010 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2903 transitions. [2025-02-05 16:27:12,831 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2903 transitions. Word has length 143 [2025-02-05 16:27:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2903 transitions. [2025-02-05 16:27:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2903 transitions. [2025-02-05 16:27:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:27:12,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:12,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:12,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:27:12,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:12,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1687861205, now seen corresponding path program 1 times [2025-02-05 16:27:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997480924] [2025-02-05 16:27:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:12,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:27:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:27:12,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:12,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997480924] [2025-02-05 16:27:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997480924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:13,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:13,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997549457] [2025-02-05 16:27:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:13,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:13,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:13,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:13,146 INFO L87 Difference]: Start difference. First operand 2011 states and 2903 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:13,234 INFO L93 Difference]: Finished difference Result 4881 states and 7025 transitions. [2025-02-05 16:27:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:27:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:13,243 INFO L225 Difference]: With dead ends: 4881 [2025-02-05 16:27:13,244 INFO L226 Difference]: Without dead ends: 2899 [2025-02-05 16:27:13,246 INFO L434 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 [2025-02-05 16:27:13,247 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 491 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2292 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:13,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2292 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2025-02-05 16:27:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2877. [2025-02-05 16:27:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2872 states have (on average 1.4258356545961002) internal successors, (4095), 2876 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 4095 transitions. [2025-02-05 16:27:13,306 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 4095 transitions. Word has length 143 [2025-02-05 16:27:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:13,307 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 4095 transitions. [2025-02-05 16:27:13,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 4095 transitions. [2025-02-05 16:27:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:27:13,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:13,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:13,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:27:13,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:13,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1767682710, now seen corresponding path program 1 times [2025-02-05 16:27:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:13,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101779613] [2025-02-05 16:27:13,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:13,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:27:13,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:27:13,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:13,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101779613] [2025-02-05 16:27:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101779613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630761116] [2025-02-05 16:27:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:13,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:13,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:13,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:13,399 INFO L87 Difference]: Start difference. First operand 2877 states and 4095 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:13,497 INFO L93 Difference]: Finished difference Result 6983 states and 9986 transitions. [2025-02-05 16:27:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 16:27:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:13,511 INFO L225 Difference]: With dead ends: 6983 [2025-02-05 16:27:13,511 INFO L226 Difference]: Without dead ends: 4564 [2025-02-05 16:27:13,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:13,515 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 469 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:13,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1501 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2025-02-05 16:27:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4544. [2025-02-05 16:27:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4539 states have (on average 1.41044282881692) internal successors, (6402), 4543 states have internal predecessors, (6402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6402 transitions. [2025-02-05 16:27:13,608 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6402 transitions. Word has length 151 [2025-02-05 16:27:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 4544 states and 6402 transitions. [2025-02-05 16:27:13,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6402 transitions. [2025-02-05 16:27:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:27:13,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:13,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:27:13,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash -928851177, now seen corresponding path program 1 times [2025-02-05 16:27:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53617578] [2025-02-05 16:27:13,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:13,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:27:13,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:27:13,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:13,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53617578] [2025-02-05 16:27:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53617578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:27:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10653884] [2025-02-05 16:27:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:27:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:14,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:27:14,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:14,234 INFO L87 Difference]: Start difference. First operand 4544 states and 6402 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:14,554 INFO L93 Difference]: Finished difference Result 9344 states and 13669 transitions. [2025-02-05 16:27:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 16:27:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:14,578 INFO L225 Difference]: With dead ends: 9344 [2025-02-05 16:27:14,578 INFO L226 Difference]: Without dead ends: 7720 [2025-02-05 16:27:14,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:14,584 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 2297 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:14,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 2752 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:27:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7720 states. [2025-02-05 16:27:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7720 to 7718. [2025-02-05 16:27:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 7713 states have (on average 1.4257746661480617) internal successors, (10997), 7717 states have internal predecessors, (10997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 10997 transitions. [2025-02-05 16:27:14,743 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 10997 transitions. Word has length 151 [2025-02-05 16:27:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:14,743 INFO L471 AbstractCegarLoop]: Abstraction has 7718 states and 10997 transitions. [2025-02-05 16:27:14,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 10997 transitions. [2025-02-05 16:27:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:27:14,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:14,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:14,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:27:14,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:14,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -840023653, now seen corresponding path program 1 times [2025-02-05 16:27:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651518282] [2025-02-05 16:27:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:14,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:27:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:27:14,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651518282] [2025-02-05 16:27:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651518282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010793508] [2025-02-05 16:27:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:15,025 INFO L87 Difference]: Start difference. First operand 7718 states and 10997 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:15,178 INFO L93 Difference]: Finished difference Result 29725 states and 42181 transitions. [2025-02-05 16:27:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:15,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 16:27:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:15,228 INFO L225 Difference]: With dead ends: 29725 [2025-02-05 16:27:15,228 INFO L226 Difference]: Without dead ends: 22074 [2025-02-05 16:27:15,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:15,242 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 1034 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:15,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1942 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22074 states. [2025-02-05 16:27:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22074 to 14852. [2025-02-05 16:27:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14852 states, 14847 states have (on average 1.4088368020475517) internal successors, (20917), 14851 states have internal predecessors, (20917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14852 states to 14852 states and 20917 transitions. [2025-02-05 16:27:15,616 INFO L78 Accepts]: Start accepts. Automaton has 14852 states and 20917 transitions. Word has length 151 [2025-02-05 16:27:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:15,617 INFO L471 AbstractCegarLoop]: Abstraction has 14852 states and 20917 transitions. [2025-02-05 16:27:15,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 14852 states and 20917 transitions. [2025-02-05 16:27:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 16:27:15,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:15,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:27:15,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:15,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 6165851, now seen corresponding path program 1 times [2025-02-05 16:27:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101888259] [2025-02-05 16:27:15,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:15,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 16:27:15,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 16:27:15,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:15,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101888259] [2025-02-05 16:27:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101888259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918102922] [2025-02-05 16:27:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:15,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:15,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:15,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:15,698 INFO L87 Difference]: Start difference. First operand 14852 states and 20917 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:15,790 INFO L93 Difference]: Finished difference Result 29592 states and 41679 transitions. [2025-02-05 16:27:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 16:27:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:15,821 INFO L225 Difference]: With dead ends: 29592 [2025-02-05 16:27:15,822 INFO L226 Difference]: Without dead ends: 14860 [2025-02-05 16:27:15,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:15,839 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1094 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 [2025-02-05 16:27:15,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1094 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14860 states. [2025-02-05 16:27:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14860 to 14860. [2025-02-05 16:27:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14860 states, 14855 states have (on average 1.4086166273981824) internal successors, (20925), 14859 states have internal predecessors, (20925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 20925 transitions. [2025-02-05 16:27:16,210 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 20925 transitions. Word has length 152 [2025-02-05 16:27:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:16,210 INFO L471 AbstractCegarLoop]: Abstraction has 14860 states and 20925 transitions. [2025-02-05 16:27:16,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 20925 transitions. [2025-02-05 16:27:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:27:16,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:16,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:27:16,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1719386179, now seen corresponding path program 1 times [2025-02-05 16:27:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159056926] [2025-02-05 16:27:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:16,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:27:16,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:27:16,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:16,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159056926] [2025-02-05 16:27:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159056926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365474607] [2025-02-05 16:27:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:16,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:16,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:16,534 INFO L87 Difference]: Start difference. First operand 14860 states and 20925 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:16,659 INFO L93 Difference]: Finished difference Result 29669 states and 41775 transitions. [2025-02-05 16:27:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 16:27:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:16,685 INFO L225 Difference]: With dead ends: 29669 [2025-02-05 16:27:16,685 INFO L226 Difference]: Without dead ends: 14852 [2025-02-05 16:27:16,698 INFO L434 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 [2025-02-05 16:27:16,698 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 14 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1700 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 [2025-02-05 16:27:16,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1700 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14852 states. [2025-02-05 16:27:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14852 to 14852. [2025-02-05 16:27:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14852 states, 14847 states have (on average 1.4082979726544083) internal successors, (20909), 14851 states have internal predecessors, (20909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14852 states to 14852 states and 20909 transitions. [2025-02-05 16:27:16,952 INFO L78 Accepts]: Start accepts. Automaton has 14852 states and 20909 transitions. Word has length 153 [2025-02-05 16:27:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 14852 states and 20909 transitions. [2025-02-05 16:27:16,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14852 states and 20909 transitions. [2025-02-05 16:27:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:27:16,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:16,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:16,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:27:16,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:16,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:16,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1568878722, now seen corresponding path program 1 times [2025-02-05 16:27:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686481689] [2025-02-05 16:27:16,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:27:16,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:27:16,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:16,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686481689] [2025-02-05 16:27:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686481689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896220091] [2025-02-05 16:27:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:17,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:17,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:17,055 INFO L87 Difference]: Start difference. First operand 14852 states and 20909 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:17,182 INFO L93 Difference]: Finished difference Result 36093 states and 50794 transitions. [2025-02-05 16:27:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 16:27:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:17,236 INFO L225 Difference]: With dead ends: 36093 [2025-02-05 16:27:17,236 INFO L226 Difference]: Without dead ends: 22071 [2025-02-05 16:27:17,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:17,259 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 469 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:17,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1502 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22071 states. [2025-02-05 16:27:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22071 to 22021. [2025-02-05 16:27:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22016 states have (on average 1.3853561046511629) internal successors, (30500), 22020 states have internal predecessors, (30500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 30500 transitions. [2025-02-05 16:27:17,668 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 30500 transitions. Word has length 153 [2025-02-05 16:27:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:17,668 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 30500 transitions. [2025-02-05 16:27:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 30500 transitions. [2025-02-05 16:27:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:27:17,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:17,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:27:17,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 5277685, now seen corresponding path program 1 times [2025-02-05 16:27:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935767843] [2025-02-05 16:27:17,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:17,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:27:17,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:27:17,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:17,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:18,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:18,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935767843] [2025-02-05 16:27:18,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935767843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:18,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:18,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363545766] [2025-02-05 16:27:18,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:18,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:18,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:18,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:18,182 INFO L87 Difference]: Start difference. First operand 22021 states and 30500 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:18,267 INFO L93 Difference]: Finished difference Result 39447 states and 54647 transitions. [2025-02-05 16:27:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 16:27:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:18,307 INFO L225 Difference]: With dead ends: 39447 [2025-02-05 16:27:18,307 INFO L226 Difference]: Without dead ends: 17903 [2025-02-05 16:27:18,327 INFO L434 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 [2025-02-05 16:27:18,328 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 21 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1712 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 [2025-02-05 16:27:18,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1712 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17903 states. [2025-02-05 16:27:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17903 to 17903. [2025-02-05 16:27:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17903 states, 17898 states have (on average 1.3819421164375907) internal successors, (24734), 17902 states have internal predecessors, (24734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17903 states to 17903 states and 24734 transitions. [2025-02-05 16:27:18,611 INFO L78 Accepts]: Start accepts. Automaton has 17903 states and 24734 transitions. Word has length 159 [2025-02-05 16:27:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 17903 states and 24734 transitions. [2025-02-05 16:27:18,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 17903 states and 24734 transitions. [2025-02-05 16:27:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 16:27:18,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:18,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:27:18,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1300180365, now seen corresponding path program 1 times [2025-02-05 16:27:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401538899] [2025-02-05 16:27:18,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 16:27:18,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 16:27:18,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:18,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401538899] [2025-02-05 16:27:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401538899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088194163] [2025-02-05 16:27:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:18,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:18,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:18,763 INFO L87 Difference]: Start difference. First operand 17903 states and 24734 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:19,174 INFO L93 Difference]: Finished difference Result 48473 states and 67729 transitions. [2025-02-05 16:27:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-05 16:27:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:19,228 INFO L225 Difference]: With dead ends: 48473 [2025-02-05 16:27:19,229 INFO L226 Difference]: Without dead ends: 33758 [2025-02-05 16:27:19,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:19,242 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 397 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:19,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1140 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:27:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33758 states. [2025-02-05 16:27:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33758 to 33708. [2025-02-05 16:27:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33708 states, 33703 states have (on average 1.3805299231522417) internal successors, (46528), 33707 states have internal predecessors, (46528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33708 states to 33708 states and 46528 transitions. [2025-02-05 16:27:19,655 INFO L78 Accepts]: Start accepts. Automaton has 33708 states and 46528 transitions. Word has length 165 [2025-02-05 16:27:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:19,655 INFO L471 AbstractCegarLoop]: Abstraction has 33708 states and 46528 transitions. [2025-02-05 16:27:19,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33708 states and 46528 transitions. [2025-02-05 16:27:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 16:27:19,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:19,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:27:19,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1587664146, now seen corresponding path program 1 times [2025-02-05 16:27:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663661164] [2025-02-05 16:27:19,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:19,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 16:27:19,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 16:27:19,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:19,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663661164] [2025-02-05 16:27:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663661164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:27:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891710956] [2025-02-05 16:27:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:27:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:20,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:27:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:27:20,072 INFO L87 Difference]: Start difference. First operand 33708 states and 46528 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:20,404 INFO L93 Difference]: Finished difference Result 68633 states and 96763 transitions. [2025-02-05 16:27:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-05 16:27:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:20,505 INFO L225 Difference]: With dead ends: 68633 [2025-02-05 16:27:20,505 INFO L226 Difference]: Without dead ends: 53543 [2025-02-05 16:27:20,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:20,534 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 2046 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:20,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 1210 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53543 states. [2025-02-05 16:27:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53543 to 53541. [2025-02-05 16:27:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53541 states, 53536 states have (on average 1.3610467722653916) internal successors, (72865), 53540 states have internal predecessors, (72865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53541 states to 53541 states and 72865 transitions. [2025-02-05 16:27:21,426 INFO L78 Accepts]: Start accepts. Automaton has 53541 states and 72865 transitions. Word has length 165 [2025-02-05 16:27:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:21,426 INFO L471 AbstractCegarLoop]: Abstraction has 53541 states and 72865 transitions. [2025-02-05 16:27:21,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53541 states and 72865 transitions. [2025-02-05 16:27:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 16:27:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:21,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:27:21,470 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 576546896, now seen corresponding path program 1 times [2025-02-05 16:27:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356300215] [2025-02-05 16:27:21,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 16:27:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 16:27:21,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:21,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356300215] [2025-02-05 16:27:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356300215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:27:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125355114] [2025-02-05 16:27:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:27:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:27:22,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:27:22,656 INFO L87 Difference]: Start difference. First operand 53541 states and 72865 transitions. Second operand has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:24,214 INFO L93 Difference]: Finished difference Result 90753 states and 126623 transitions. [2025-02-05 16:27:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:27:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-05 16:27:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:24,356 INFO L225 Difference]: With dead ends: 90753 [2025-02-05 16:27:24,356 INFO L226 Difference]: Without dead ends: 79159 [2025-02-05 16:27:24,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:27:24,389 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 5230 mSDsluCounter, 5680 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 6379 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:24,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 6379 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:27:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79159 states. [2025-02-05 16:27:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79159 to 58009. [2025-02-05 16:27:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58009 states, 58004 states have (on average 1.3499758637335355) internal successors, (78304), 58008 states have internal predecessors, (78304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58009 states to 58009 states and 78304 transitions. [2025-02-05 16:27:25,493 INFO L78 Accepts]: Start accepts. Automaton has 58009 states and 78304 transitions. Word has length 165 [2025-02-05 16:27:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:25,493 INFO L471 AbstractCegarLoop]: Abstraction has 58009 states and 78304 transitions. [2025-02-05 16:27:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 58009 states and 78304 transitions. [2025-02-05 16:27:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 16:27:25,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:25,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:25,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:27:25,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:25,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1943413038, now seen corresponding path program 1 times [2025-02-05 16:27:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680420812] [2025-02-05 16:27:25,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 16:27:25,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 16:27:25,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:25,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680420812] [2025-02-05 16:27:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680420812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:25,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849091184] [2025-02-05 16:27:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:25,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:25,785 INFO L87 Difference]: Start difference. First operand 58009 states and 78304 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:26,144 INFO L93 Difference]: Finished difference Result 108729 states and 146773 transitions. [2025-02-05 16:27:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-05 16:27:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:26,226 INFO L225 Difference]: With dead ends: 108729 [2025-02-05 16:27:26,226 INFO L226 Difference]: Without dead ends: 51188 [2025-02-05 16:27:26,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:26,267 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 477 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:26,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 2273 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51188 states. [2025-02-05 16:27:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51188 to 51073. [2025-02-05 16:27:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51073 states, 51068 states have (on average 1.3488094305631706) internal successors, (68881), 51072 states have internal predecessors, (68881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51073 states to 51073 states and 68881 transitions. [2025-02-05 16:27:27,195 INFO L78 Accepts]: Start accepts. Automaton has 51073 states and 68881 transitions. Word has length 165 [2025-02-05 16:27:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 51073 states and 68881 transitions. [2025-02-05 16:27:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51073 states and 68881 transitions. [2025-02-05 16:27:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 16:27:27,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:27,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:27,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:27:27,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1779144420, now seen corresponding path program 1 times [2025-02-05 16:27:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300993292] [2025-02-05 16:27:27,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:27,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 16:27:27,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 16:27:27,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:27,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300993292] [2025-02-05 16:27:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300993292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025540380] [2025-02-05 16:27:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:27,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:27,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:27,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:27,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:27,299 INFO L87 Difference]: Start difference. First operand 51073 states and 68881 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:27,529 INFO L93 Difference]: Finished difference Result 100630 states and 135566 transitions. [2025-02-05 16:27:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 16:27:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:27,617 INFO L225 Difference]: With dead ends: 100630 [2025-02-05 16:27:27,617 INFO L226 Difference]: Without dead ends: 70837 [2025-02-05 16:27:27,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:27,658 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 507 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:27,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70837 states. [2025-02-05 16:27:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70837 to 51073. [2025-02-05 16:27:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51073 states, 51068 states have (on average 1.3487702670948538) internal successors, (68879), 51072 states have internal predecessors, (68879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51073 states to 51073 states and 68879 transitions. [2025-02-05 16:27:28,955 INFO L78 Accepts]: Start accepts. Automaton has 51073 states and 68879 transitions. Word has length 166 [2025-02-05 16:27:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:28,956 INFO L471 AbstractCegarLoop]: Abstraction has 51073 states and 68879 transitions. [2025-02-05 16:27:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51073 states and 68879 transitions. [2025-02-05 16:27:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:28,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:28,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:28,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:27:28,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:28,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash -271872003, now seen corresponding path program 1 times [2025-02-05 16:27:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:28,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602747995] [2025-02-05 16:27:28,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:28,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:29,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:29,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:29,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:30,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602747995] [2025-02-05 16:27:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602747995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 16:27:30,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295841250] [2025-02-05 16:27:30,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 16:27:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 16:27:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:27:30,566 INFO L87 Difference]: Start difference. First operand 51073 states and 68879 transitions. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:33,211 INFO L93 Difference]: Finished difference Result 85741 states and 119004 transitions. [2025-02-05 16:27:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:27:33,212 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:33,297 INFO L225 Difference]: With dead ends: 85741 [2025-02-05 16:27:33,297 INFO L226 Difference]: Without dead ends: 68567 [2025-02-05 16:27:33,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:27:33,326 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 2854 mSDsluCounter, 11860 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2854 SdHoareTripleChecker+Valid, 13092 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:33,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2854 Valid, 13092 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:27:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68567 states. [2025-02-05 16:27:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68567 to 56102. [2025-02-05 16:27:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56102 states, 56097 states have (on average 1.3454017148867141) internal successors, (75473), 56101 states have internal predecessors, (75473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56102 states to 56102 states and 75473 transitions. [2025-02-05 16:27:34,212 INFO L78 Accepts]: Start accepts. Automaton has 56102 states and 75473 transitions. Word has length 167 [2025-02-05 16:27:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:34,212 INFO L471 AbstractCegarLoop]: Abstraction has 56102 states and 75473 transitions. [2025-02-05 16:27:34,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56102 states and 75473 transitions. [2025-02-05 16:27:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:34,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:34,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:27:34,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 82830657, now seen corresponding path program 1 times [2025-02-05 16:27:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912106839] [2025-02-05 16:27:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:34,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:34,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:34,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912106839] [2025-02-05 16:27:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912106839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 16:27:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007915618] [2025-02-05 16:27:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:35,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 16:27:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:35,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 16:27:35,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:27:35,070 INFO L87 Difference]: Start difference. First operand 56102 states and 75473 transitions. Second operand has 15 states, 15 states have (on average 11.133333333333333) internal successors, (167), 15 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:36,340 INFO L93 Difference]: Finished difference Result 91986 states and 124717 transitions. [2025-02-05 16:27:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:27:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.133333333333333) internal successors, (167), 15 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:36,439 INFO L225 Difference]: With dead ends: 91986 [2025-02-05 16:27:36,439 INFO L226 Difference]: Without dead ends: 83608 [2025-02-05 16:27:36,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:27:36,467 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 4297 mSDsluCounter, 5327 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 6035 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:36,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 6035 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:27:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83608 states. [2025-02-05 16:27:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83608 to 62239. [2025-02-05 16:27:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62239 states, 62234 states have (on average 1.329530481730244) internal successors, (82742), 62238 states have internal predecessors, (82742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62239 states to 62239 states and 82742 transitions. [2025-02-05 16:27:37,709 INFO L78 Accepts]: Start accepts. Automaton has 62239 states and 82742 transitions. Word has length 167 [2025-02-05 16:27:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:37,709 INFO L471 AbstractCegarLoop]: Abstraction has 62239 states and 82742 transitions. [2025-02-05 16:27:37,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.133333333333333) internal successors, (167), 15 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62239 states and 82742 transitions. [2025-02-05 16:27:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:37,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:37,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:27:37,741 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:37,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash 699323298, now seen corresponding path program 1 times [2025-02-05 16:27:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:37,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998252772] [2025-02-05 16:27:37,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:37,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:37,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:37,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:37,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998252772] [2025-02-05 16:27:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998252772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138228825] [2025-02-05 16:27:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:37,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:37,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:37,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:37,799 INFO L87 Difference]: Start difference. First operand 62239 states and 82742 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:38,544 INFO L93 Difference]: Finished difference Result 158993 states and 214218 transitions. [2025-02-05 16:27:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:38,682 INFO L225 Difference]: With dead ends: 158993 [2025-02-05 16:27:38,682 INFO L226 Difference]: Without dead ends: 112919 [2025-02-05 16:27:38,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:38,706 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 421 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1269 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112919 states. [2025-02-05 16:27:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112919 to 112801. [2025-02-05 16:27:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112801 states, 112796 states have (on average 1.329373382034824) internal successors, (149948), 112800 states have internal predecessors, (149948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112801 states to 112801 states and 149948 transitions. [2025-02-05 16:27:40,241 INFO L78 Accepts]: Start accepts. Automaton has 112801 states and 149948 transitions. Word has length 167 [2025-02-05 16:27:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 112801 states and 149948 transitions. [2025-02-05 16:27:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112801 states and 149948 transitions. [2025-02-05 16:27:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:40,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:40,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:40,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:27:40,307 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:40,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1222763901, now seen corresponding path program 1 times [2025-02-05 16:27:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462819363] [2025-02-05 16:27:40,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:40,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462819363] [2025-02-05 16:27:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462819363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:27:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434213484] [2025-02-05 16:27:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:40,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:27:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:40,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:27:40,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:27:40,804 INFO L87 Difference]: Start difference. First operand 112801 states and 149948 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:41,280 INFO L93 Difference]: Finished difference Result 148090 states and 197510 transitions. [2025-02-05 16:27:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:41,356 INFO L225 Difference]: With dead ends: 148090 [2025-02-05 16:27:41,356 INFO L226 Difference]: Without dead ends: 62239 [2025-02-05 16:27:41,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:27:41,413 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 2337 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:41,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 695 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62239 states. [2025-02-05 16:27:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62239 to 62239. [2025-02-05 16:27:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62239 states, 62234 states have (on average 1.3098467075874924) internal successors, (81517), 62238 states have internal predecessors, (81517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62239 states to 62239 states and 81517 transitions. [2025-02-05 16:27:42,437 INFO L78 Accepts]: Start accepts. Automaton has 62239 states and 81517 transitions. Word has length 167 [2025-02-05 16:27:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 62239 states and 81517 transitions. [2025-02-05 16:27:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62239 states and 81517 transitions. [2025-02-05 16:27:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:42,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:42,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:42,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:27:42,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:42,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -741232036, now seen corresponding path program 1 times [2025-02-05 16:27:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398075825] [2025-02-05 16:27:42,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:42,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:42,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:42,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398075825] [2025-02-05 16:27:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398075825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:42,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:42,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:27:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428273301] [2025-02-05 16:27:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:42,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:27:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:42,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:27:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:27:42,901 INFO L87 Difference]: Start difference. First operand 62239 states and 81517 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:43,227 INFO L93 Difference]: Finished difference Result 102869 states and 137793 transitions. [2025-02-05 16:27:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:43,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:43,290 INFO L225 Difference]: With dead ends: 102869 [2025-02-05 16:27:43,291 INFO L226 Difference]: Without dead ends: 49992 [2025-02-05 16:27:43,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:27:43,331 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1441 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:43,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 744 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49992 states. [2025-02-05 16:27:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49992 to 36814. [2025-02-05 16:27:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36814 states, 36809 states have (on average 1.28452280692222) internal successors, (47282), 36813 states have internal predecessors, (47282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36814 states to 36814 states and 47282 transitions. [2025-02-05 16:27:43,940 INFO L78 Accepts]: Start accepts. Automaton has 36814 states and 47282 transitions. Word has length 167 [2025-02-05 16:27:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:43,940 INFO L471 AbstractCegarLoop]: Abstraction has 36814 states and 47282 transitions. [2025-02-05 16:27:43,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36814 states and 47282 transitions. [2025-02-05 16:27:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:43,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:43,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:27:43,964 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2146612475, now seen corresponding path program 1 times [2025-02-05 16:27:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228389486] [2025-02-05 16:27:43,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:43,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:43,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:44,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:44,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228389486] [2025-02-05 16:27:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228389486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:27:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415990541] [2025-02-05 16:27:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:27:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:44,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:27:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:27:44,513 INFO L87 Difference]: Start difference. First operand 36814 states and 47282 transitions. Second operand has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:45,280 INFO L93 Difference]: Finished difference Result 61024 states and 81447 transitions. [2025-02-05 16:27:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:27:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:45,354 INFO L225 Difference]: With dead ends: 61024 [2025-02-05 16:27:45,355 INFO L226 Difference]: Without dead ends: 51762 [2025-02-05 16:27:45,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:27:45,384 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 2387 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 6514 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:45,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 6514 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:27:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51762 states. [2025-02-05 16:27:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51762 to 39768. [2025-02-05 16:27:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39768 states, 39763 states have (on average 1.275381636194452) internal successors, (50713), 39767 states have internal predecessors, (50713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39768 states to 39768 states and 50713 transitions. [2025-02-05 16:27:46,042 INFO L78 Accepts]: Start accepts. Automaton has 39768 states and 50713 transitions. Word has length 167 [2025-02-05 16:27:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:46,042 INFO L471 AbstractCegarLoop]: Abstraction has 39768 states and 50713 transitions. [2025-02-05 16:27:46,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39768 states and 50713 transitions. [2025-02-05 16:27:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:46,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:46,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:46,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:27:46,074 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1725652995, now seen corresponding path program 1 times [2025-02-05 16:27:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:46,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929879257] [2025-02-05 16:27:46,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:46,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929879257] [2025-02-05 16:27:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929879257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:27:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503497475] [2025-02-05 16:27:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:46,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:27:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:46,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:27:46,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:27:46,936 INFO L87 Difference]: Start difference. First operand 39768 states and 50713 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:48,814 INFO L93 Difference]: Finished difference Result 81702 states and 108719 transitions. [2025-02-05 16:27:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 16:27:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:48,897 INFO L225 Difference]: With dead ends: 81702 [2025-02-05 16:27:48,897 INFO L226 Difference]: Without dead ends: 76189 [2025-02-05 16:27:48,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:27:48,931 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 4762 mSDsluCounter, 6790 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4762 SdHoareTripleChecker+Valid, 7699 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:48,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4762 Valid, 7699 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:27:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76189 states. [2025-02-05 16:27:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76189 to 46832. [2025-02-05 16:27:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46832 states, 46827 states have (on average 1.263437760266513) internal successors, (59163), 46831 states have internal predecessors, (59163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46832 states to 46832 states and 59163 transitions. [2025-02-05 16:27:49,695 INFO L78 Accepts]: Start accepts. Automaton has 46832 states and 59163 transitions. Word has length 167 [2025-02-05 16:27:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 46832 states and 59163 transitions. [2025-02-05 16:27:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46832 states and 59163 transitions. [2025-02-05 16:27:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:27:49,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:49,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:27:49,725 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1668394693, now seen corresponding path program 1 times [2025-02-05 16:27:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869071060] [2025-02-05 16:27:49,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:49,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:27:49,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:27:49,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:49,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869071060] [2025-02-05 16:27:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869071060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:49,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863077807] [2025-02-05 16:27:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:49,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:49,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:49,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:49,967 INFO L87 Difference]: Start difference. First operand 46832 states and 59163 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:50,221 INFO L93 Difference]: Finished difference Result 141591 states and 178797 transitions. [2025-02-05 16:27:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:50,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:27:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:50,324 INFO L225 Difference]: With dead ends: 141591 [2025-02-05 16:27:50,324 INFO L226 Difference]: Without dead ends: 94908 [2025-02-05 16:27:50,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:50,373 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 1477 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:50,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2286 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94908 states. [2025-02-05 16:27:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94908 to 47091. [2025-02-05 16:27:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47091 states, 47086 states have (on average 1.2624984071698595) internal successors, (59446), 47090 states have internal predecessors, (59446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47091 states to 47091 states and 59446 transitions. [2025-02-05 16:27:51,273 INFO L78 Accepts]: Start accepts. Automaton has 47091 states and 59446 transitions. Word has length 167 [2025-02-05 16:27:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:51,273 INFO L471 AbstractCegarLoop]: Abstraction has 47091 states and 59446 transitions. [2025-02-05 16:27:51,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 47091 states and 59446 transitions. [2025-02-05 16:27:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 16:27:51,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:51,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:51,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:27:51,304 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1997635471, now seen corresponding path program 1 times [2025-02-05 16:27:51,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:51,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633528454] [2025-02-05 16:27:51,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:51,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 16:27:51,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 16:27:51,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:51,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633528454] [2025-02-05 16:27:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633528454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171947070] [2025-02-05 16:27:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:51,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:51,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:51,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:51,362 INFO L87 Difference]: Start difference. First operand 47091 states and 59446 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:51,496 INFO L93 Difference]: Finished difference Result 84029 states and 106038 transitions. [2025-02-05 16:27:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-05 16:27:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:51,547 INFO L225 Difference]: With dead ends: 84029 [2025-02-05 16:27:51,547 INFO L226 Difference]: Without dead ends: 47101 [2025-02-05 16:27:51,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:51,579 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1056 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 [2025-02-05 16:27:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1056 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2025-02-05 16:27:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 47101. [2025-02-05 16:27:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47101 states, 47096 states have (on average 1.2624426702904705) internal successors, (59456), 47100 states have internal predecessors, (59456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47101 states to 47101 states and 59456 transitions. [2025-02-05 16:27:52,323 INFO L78 Accepts]: Start accepts. Automaton has 47101 states and 59456 transitions. Word has length 168 [2025-02-05 16:27:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 47101 states and 59456 transitions. [2025-02-05 16:27:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 47101 states and 59456 transitions. [2025-02-05 16:27:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 16:27:52,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:52,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:52,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:27:52,366 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1960155549, now seen corresponding path program 1 times [2025-02-05 16:27:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527277875] [2025-02-05 16:27:52,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:52,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 16:27:52,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 16:27:52,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:52,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527277875] [2025-02-05 16:27:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527277875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125122872] [2025-02-05 16:27:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:52,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:52,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:52,969 INFO L87 Difference]: Start difference. First operand 47101 states and 59456 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:53,195 INFO L93 Difference]: Finished difference Result 88446 states and 111598 transitions. [2025-02-05 16:27:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-05 16:27:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:53,251 INFO L225 Difference]: With dead ends: 88446 [2025-02-05 16:27:53,251 INFO L226 Difference]: Without dead ends: 47101 [2025-02-05 16:27:53,294 INFO L434 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 [2025-02-05 16:27:53,295 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1609 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 [2025-02-05 16:27:53,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1609 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2025-02-05 16:27:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 47096. [2025-02-05 16:27:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47096 states, 47091 states have (on average 1.2623006519292435) internal successors, (59443), 47095 states have internal predecessors, (59443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47096 states to 47096 states and 59443 transitions. [2025-02-05 16:27:53,879 INFO L78 Accepts]: Start accepts. Automaton has 47096 states and 59443 transitions. Word has length 169 [2025-02-05 16:27:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:53,879 INFO L471 AbstractCegarLoop]: Abstraction has 47096 states and 59443 transitions. [2025-02-05 16:27:53,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47096 states and 59443 transitions. [2025-02-05 16:27:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 16:27:53,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:53,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:53,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:27:53,911 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1933538590, now seen corresponding path program 1 times [2025-02-05 16:27:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733204367] [2025-02-05 16:27:53,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:53,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 16:27:53,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 16:27:53,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:53,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733204367] [2025-02-05 16:27:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733204367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515271701] [2025-02-05 16:27:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:54,120 INFO L87 Difference]: Start difference. First operand 47096 states and 59443 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:54,425 INFO L93 Difference]: Finished difference Result 77642 states and 97976 transitions. [2025-02-05 16:27:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:54,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-05 16:27:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:54,461 INFO L225 Difference]: With dead ends: 77642 [2025-02-05 16:27:54,461 INFO L226 Difference]: Without dead ends: 41890 [2025-02-05 16:27:54,475 INFO L434 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 [2025-02-05 16:27:54,475 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 480 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:54,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2669 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41890 states. [2025-02-05 16:27:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41890 to 41030. [2025-02-05 16:27:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41030 states, 41025 states have (on average 1.2624497257769653) internal successors, (51792), 41029 states have internal predecessors, (51792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41030 states to 41030 states and 51792 transitions. [2025-02-05 16:27:55,000 INFO L78 Accepts]: Start accepts. Automaton has 41030 states and 51792 transitions. Word has length 169 [2025-02-05 16:27:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:55,001 INFO L471 AbstractCegarLoop]: Abstraction has 41030 states and 51792 transitions. [2025-02-05 16:27:55,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41030 states and 51792 transitions. [2025-02-05 16:27:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 16:27:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:55,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:55,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:27:55,024 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:27:55,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 692363481, now seen corresponding path program 1 times [2025-02-05 16:27:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481439081] [2025-02-05 16:27:55,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:55,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 16:27:55,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 16:27:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:55,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:27:55,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 16:27:55,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 16:27:55,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 16:27:55,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:27:55,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 16:27:55,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 16:27:55,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-05 16:27:55,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-05 16:27:55,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-05 16:27:55,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-05 16:27:55,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-05 16:27:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:27:55,209 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:55,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 16:27:55,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 04:27:55 BoogieIcfgContainer [2025-02-05 16:27:55,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 16:27:55,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 16:27:55,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 16:27:55,363 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 16:27:55,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:27:10" (3/4) ... [2025-02-05 16:27:55,364 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 16:27:55,553 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 151. [2025-02-05 16:27:55,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 16:27:55,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 16:27:55,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 16:27:55,637 INFO L158 Benchmark]: Toolchain (without parser) took 47575.68ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 121.6MB in the beginning and 1.1GB in the end (delta: -957.1MB). Peak memory consumption was 922.5MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,637 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:27:55,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.22ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 87.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.07ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 79.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,638 INFO L158 Benchmark]: Boogie Preprocessor took 87.00ms. Allocated memory is still 167.8MB. Free memory was 79.6MB in the beginning and 74.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,638 INFO L158 Benchmark]: IcfgBuilder took 1430.78ms. Allocated memory is still 167.8MB. Free memory was 74.1MB in the beginning and 100.4MB in the end (delta: -26.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,638 INFO L158 Benchmark]: TraceAbstraction took 45130.28ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 99.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 831.5MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,638 INFO L158 Benchmark]: Witness Printer took 272.84ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-05 16:27:55,639 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.90ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.22ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 87.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.07ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 79.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.00ms. Allocated memory is still 167.8MB. Free memory was 79.6MB in the beginning and 74.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1430.78ms. Allocated memory is still 167.8MB. Free memory was 74.1MB in the beginning and 100.4MB in the end (delta: -26.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45130.28ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 99.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 831.5MB. Max. memory is 16.1GB. * Witness Printer took 272.84ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. 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: 1960]: 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] char id2 = '\x0'; [L59] unsigned char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] char id3 = '\x0'; [L66] unsigned char r3 = '\x0'; [L67] char st3 = '\x0'; [L68] char nl3 = '\x0'; [L69] char m3 = '\x0'; [L70] char max3 = '\x0'; [L71] _Bool mode3 = 0; [L75] void (*nodes[3])() = { &node1, &node2, &node3 }; [L79] int __return_1742; [L80] int __return_1870; [L81] int __return_1988; [L82] int __return_2106; [L83] int __return_2840; [L84] int __return_2806; [L85] int __return_2345; [L86] int __return_2726; [L87] int __return_2683; [L88] int __return_2584; [L89] int __return_2553; [L90] int __return_2494; [L91] int __return_2235; VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=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, 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] [L94] int main__c1; [L95] int main__i2; [L96] main__c1 = 0 [L97] ep12 = __VERIFIER_nondet_bool() [L98] ep13 = __VERIFIER_nondet_bool() [L99] ep21 = __VERIFIER_nondet_bool() [L100] ep23 = __VERIFIER_nondet_bool() [L101] ep31 = __VERIFIER_nondet_bool() [L102] ep32 = __VERIFIER_nondet_bool() [L103] id1 = __VERIFIER_nondet_char() [L104] r1 = __VERIFIER_nondet_uchar() [L105] st1 = __VERIFIER_nondet_char() [L106] nl1 = __VERIFIER_nondet_char() [L107] m1 = __VERIFIER_nondet_char() [L108] max1 = __VERIFIER_nondet_char() [L109] mode1 = __VERIFIER_nondet_bool() [L110] id2 = __VERIFIER_nondet_char() [L111] r2 = __VERIFIER_nondet_uchar() [L112] st2 = __VERIFIER_nondet_char() [L113] nl2 = __VERIFIER_nondet_char() [L114] m2 = __VERIFIER_nondet_char() [L115] max2 = __VERIFIER_nondet_char() [L116] mode2 = __VERIFIER_nondet_bool() [L117] id3 = __VERIFIER_nondet_char() [L118] r3 = __VERIFIER_nondet_uchar() [L119] st3 = __VERIFIER_nondet_char() [L120] nl3 = __VERIFIER_nondet_char() [L121] m3 = __VERIFIER_nondet_char() [L122] max3 = __VERIFIER_nondet_char() [L123] mode3 = __VERIFIER_nondet_bool() [L125] _Bool init__r121; [L126] _Bool init__r131; [L127] _Bool init__r211; [L128] _Bool init__r231; [L129] _Bool init__r311; [L130] _Bool init__r321; [L131] _Bool init__r122; [L132] int init__tmp; [L133] _Bool init__r132; [L134] int init__tmp___0; [L135] _Bool init__r212; [L136] int init__tmp___1; [L137] _Bool init__r232; [L138] int init__tmp___2; [L139] _Bool init__r312; [L140] int init__tmp___3; [L141] _Bool init__r322; [L142] int init__tmp___4; [L143] int init__tmp___5; [L144] init__r121 = ep12 [L145] init__r131 = ep13 [L146] init__r211 = ep21 [L147] init__r231 = ep23 [L148] init__r311 = ep31 [L149] init__r321 = ep32 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L150] COND TRUE !(init__r121 == 0) [L152] init__tmp = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L154] init__r122 = (_Bool)init__tmp VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(init__r131 == 0)) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r121=1, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2986] COND TRUE !(init__r121 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2988] COND TRUE !(ep23 == 0) [L2990] init__tmp___0 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___0=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L159] init__r132 = (_Bool)init__tmp___0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L160] COND FALSE !(!(init__r211 == 0)) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2963] COND TRUE !(init__r231 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2965] COND TRUE !(ep31 == 0) [L2967] init__tmp___1 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___1=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L164] init__r212 = (_Bool)init__tmp___1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L165] COND TRUE !(init__r231 == 0) [L167] init__tmp___2 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r311=1, init__r321=0, init__tmp___2=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L169] init__r232 = (_Bool)init__tmp___2 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L170] COND TRUE !(init__r311 == 0) [L172] init__tmp___3 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, init__tmp___3=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L174] init__r312 = (_Bool)init__tmp___3 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(init__r321 == 0)) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2894] COND TRUE !(init__r311 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L2896] COND TRUE !(ep12 == 0) [L2898] init__tmp___4 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L179] init__r322 = (_Bool)init__tmp___4 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)id1) >= 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)id2) >= 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)id3) >= 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r1) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)r2) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)r3) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L198] COND TRUE !(init__r122 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L200] COND TRUE !(init__r132 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L202] COND TRUE !(init__r212 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L204] COND TRUE !(init__r232 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L206] COND TRUE !(init__r312 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L208] COND TRUE !(init__r322 == 0) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L210] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L212] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L214] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L216] COND TRUE ((int)st1) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L218] COND TRUE ((int)st2) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L220] COND TRUE ((int)st3) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L222] COND TRUE ((int)nl1) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L224] COND TRUE ((int)nl2) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L226] COND TRUE ((int)nl3) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L228] COND TRUE ((int)mode1) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L230] COND TRUE ((int)mode2) == 0 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L232] COND TRUE ((int)mode3) == 0 [L234] init__tmp___5 = 1 [L235] __return_1742 = init__tmp___5 [L236] main__i2 = __return_1742 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=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] [L237] COND TRUE main__i2 != 0 [L239] p12_old = nomsg [L240] p12_new = nomsg [L241] p13_old = nomsg [L242] p13_new = nomsg [L243] p21_old = nomsg [L244] p21_new = nomsg [L245] p23_old = nomsg [L246] p23_new = nomsg [L247] p31_old = nomsg [L248] p31_new = nomsg [L249] p32_old = nomsg [L250] p32_new = nomsg [L251] main__i2 = 0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, 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] [L253] COND FALSE !(!(mode1 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, 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] [L259] COND TRUE ((int)r1) < 2 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, 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] [L261] COND TRUE !(ep12 == 0) [L263] int node1____CPAchecker_TMP_0; VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, 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 max1 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, 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 TRUE p12_new == nomsg [L268] node1____CPAchecker_TMP_0 = max1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, 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] [L270] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L272] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L283] mode1 = 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L285] COND FALSE !(!(mode2 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L291] COND TRUE ((int)r2) < 2 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L293] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L304] COND TRUE !(ep23 == 0) [L306] int node2____CPAchecker_TMP_1; VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L307] COND TRUE max2 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L309] COND TRUE p23_new == nomsg [L311] node2____CPAchecker_TMP_1 = max2 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=6, nomsg=-1, p12=0, p12_new=4, 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] [L313] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] mode2 = 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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 !(!(mode3 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] [L323] COND TRUE ((int)r3) < 2 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] [L325] COND TRUE !(ep31 == 0) [L327] int node3____CPAchecker_TMP_0; VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] [L328] COND TRUE max3 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] COND TRUE p31_new == nomsg [L332] node3____CPAchecker_TMP_0 = max3 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=5, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, p23_old=-1, p31=0, p31_new=5, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L336] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, p23_old=-1, p31=0, p31_new=5, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] mode3 = 1 [L348] p12_old = p12_new [L349] p12_new = nomsg [L350] p13_old = p13_new [L351] p13_new = nomsg [L352] p21_old = p21_new [L353] p21_new = nomsg [L354] p23_old = p23_new [L355] p23_new = nomsg [L356] p31_old = p31_new [L357] p31_new = nomsg [L358] p32_old = p32_new [L359] p32_new = nomsg [L361] int check__tmp; VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L364] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND TRUE ((int)r1) < 2 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE ((int)r1) < 2 [L390] check__tmp = 1 [L391] __return_1870 = check__tmp [L392] main__c1 = __return_1870 [L394] _Bool __tmp_1; [L395] __tmp_1 = main__c1 [L396] _Bool assert__arg; [L397] assert__arg = __tmp_1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND FALSE !(assert__arg == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND TRUE !(mode1 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND FALSE !(r1 == 255) [L413] r1 = r1 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND TRUE !(ep31 == 0) [L424] m1 = p31_old [L425] p31_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=4, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE ((int)m1) > ((int)max1) [L428] max1 = m1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=6, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND FALSE !(((int)r1) == 2) [L436] mode1 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE !(mode2 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !(r2 == 255) [L446] r2 = r2 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE !(ep12 == 0) [L449] m2 = p12_old [L450] p12_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L451] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L463] COND FALSE !(((int)r2) == 2) [L469] mode2 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE !(mode3 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !(r3 == 255) [L479] r3 = r3 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=6, max3=5, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE !(ep23 == 0) [L490] m3 = p23_old [L491] p23_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=5, mode1=0, mode2=0, mode3=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=0, st2=0, st3=0] [L492] COND TRUE ((int)m3) > ((int)max3) [L494] max3 = m3 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=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=0, st2=0, st3=0] [L496] COND FALSE !(((int)r3) == 2) [L502] mode3 = 0 [L503] p12_old = p12_new [L504] p12_new = nomsg [L505] p13_old = p13_new [L506] p13_new = nomsg [L507] p21_old = p21_new [L508] p21_new = nomsg [L509] p23_old = p23_new [L510] p23_new = nomsg [L511] p31_old = p31_new [L512] p31_new = nomsg [L513] p32_old = p32_new [L514] p32_new = nomsg [L516] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L517] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L519] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L521] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L523] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L525] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L531] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L533] COND TRUE ((int)r1) < 2 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L535] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L541] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L543] COND TRUE ((int)r1) < 2 [L545] check__tmp = 1 [L546] __return_1988 = check__tmp [L547] main__c1 = __return_1988 [L549] _Bool __tmp_2; [L550] __tmp_2 = main__c1 [L551] _Bool assert__arg; [L552] assert__arg = __tmp_2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L553] COND FALSE !(assert__arg == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L560] COND FALSE !(!(mode1 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L566] COND TRUE ((int)r1) < 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L568] COND TRUE !(ep12 == 0) [L570] int node1____CPAchecker_TMP_0; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L571] COND TRUE max1 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, 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=0, st2=0, st3=0] [L573] COND TRUE p12_new == nomsg [L575] node1____CPAchecker_TMP_0 = max1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=5, 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=0, st2=0, st3=0] [L577] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L579] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L590] mode1 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L592] COND FALSE !(!(mode2 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L598] COND TRUE ((int)r2) < 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L600] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L611] COND TRUE !(ep23 == 0) [L613] int node2____CPAchecker_TMP_1; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L614] COND TRUE max2 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L616] COND TRUE p23_new == nomsg [L618] node2____CPAchecker_TMP_1 = max2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=6, nomsg=-1, p12=0, p12_new=5, 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=0, st2=0, st3=0] [L620] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L622] mode2 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L624] COND FALSE !(!(mode3 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L630] COND TRUE ((int)r3) < 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L632] COND TRUE !(ep31 == 0) [L634] int node3____CPAchecker_TMP_0; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L635] COND TRUE max3 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L637] COND TRUE p31_new == nomsg [L639] node3____CPAchecker_TMP_0 = max3 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=6, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, 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=0, st2=0, st3=0] [L641] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, p23_old=-1, p31=0, p31_new=6, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L643] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=6, p23_old=-1, p31=0, p31_new=6, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L654] mode3 = 1 [L655] p12_old = p12_new [L656] p12_new = nomsg [L657] p13_old = p13_new [L658] p13_new = nomsg [L659] p21_old = p21_new [L660] p21_new = nomsg [L661] p23_old = p23_new [L662] p23_new = nomsg [L663] p31_old = p31_new [L664] p31_new = nomsg [L665] p32_old = p32_new [L666] p32_new = nomsg [L668] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L669] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L671] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L673] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L675] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L677] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L683] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L685] COND TRUE ((int)r1) < 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L687] COND FALSE !(((int)r1) >= 2) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L693] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L695] COND TRUE ((int)r1) < 2 [L697] check__tmp = 1 [L698] __return_2106 = check__tmp [L699] main__c1 = __return_2106 [L701] _Bool __tmp_3; [L702] __tmp_3 = main__c1 [L703] _Bool assert__arg; [L704] assert__arg = __tmp_3 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L705] COND FALSE !(assert__arg == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L712] COND TRUE !(mode1 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L714] COND FALSE !(r1 == 255) [L720] r1 = r1 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L721] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=5, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L729] COND TRUE !(ep31 == 0) [L731] m1 = p31_old [L732] p31_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=5, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L733] COND TRUE ((int)m1) > ((int)max1) [L735] max1 = m1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=6, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L737] COND TRUE ((int)r1) == 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=6, max2=6, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L739] COND FALSE !(((int)max1) == ((int)id1)) [L1819] st1 = 1 [L1820] mode1 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=1, st2=0, st3=0] [L1822] COND TRUE !(mode2 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=1, st2=0, st3=0] [L1824] COND FALSE !(r2 == 255) [L1830] r2 = r2 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=4, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1831] COND TRUE !(ep12 == 0) [L1833] m2 = p12_old [L1834] p12_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1835] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1839] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1847] COND TRUE ((int)r2) == 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=1, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1849] COND TRUE ((int)max2) == ((int)id2) [L1851] st2 = 1 [L1852] mode2 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=1, st3=0] [L1854] COND TRUE !(mode3 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=1, st3=0] [L1856] COND FALSE !(r3 == 255) [L1862] r3 = r3 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1863] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=6, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1871] COND TRUE !(ep23 == 0) [L1873] m3 = p23_old [L1874] p23_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1875] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1879] COND TRUE ((int)r3) == 2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1881] COND FALSE !(((int)max3) == ((int)id3)) [L1928] nl3 = 1 [L1929] mode3 = 0 [L1930] p12_old = p12_new [L1931] p12_new = nomsg [L1932] p13_old = p13_new [L1933] p13_new = nomsg [L1934] p21_old = p21_new [L1935] p21_new = nomsg [L1936] p23_old = p23_new [L1937] p23_new = nomsg [L1938] p31_old = p31_new [L1939] p31_new = nomsg [L1940] p32_old = p32_new [L1941] p32_new = nomsg [L1943] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1944] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1950] check__tmp = 0 [L1951] __return_2553 = check__tmp [L1952] main__c1 = __return_2553 [L1954] _Bool __tmp_7; [L1955] __tmp_7 = main__c1 [L1956] _Bool assert__arg; [L1957] assert__arg = __tmp_7 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1958] COND TRUE assert__arg == 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L1960] reach_error() VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_2494=0, __return_2553=0, __return_2584=0, __return_2683=0, __return_2726=0, __return_2806=0, __return_2840=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=5, init__r211=0, m1=6, m2=5, m3=6, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=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=2, r2=2, r3=2, st1=1, st2=1, st3=0] - UnprovableResult [Line: 837]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1915]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 2070]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 388 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 44.9s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36408 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36408 mSDsluCounter, 78168 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56552 mSDsCounter, 859 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9766 IncrementalHoareTripleChecker+Invalid, 10625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 859 mSolverCounterUnsat, 21616 mSDtfsCounter, 9766 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112801occurred in iteration=21, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 186677 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 4762 NumberOfCodeBlocks, 4762 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4562 ConstructedInterpolants, 0 QuantifiedInterpolants, 18151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 16:27:55,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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