./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+nlh-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+nlh-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 f02e9f77b882be24d50c19f50ce800eb05eecbc064c8c6c7833bfe76a90e6ee8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:27:13,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:27:13,106 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:13,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:27:13,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:27:13,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:27:13,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:27:13,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:27:13,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:27:13,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:27:13,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:27:13,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:27:13,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:27:13,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:27:13,139 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:27:13,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:27:13,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:27:13,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:27:13,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:27:13,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:27:13,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:27:13,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:27:13,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:27:13,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:27:13,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:27:13,143 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 -> f02e9f77b882be24d50c19f50ce800eb05eecbc064c8c6c7833bfe76a90e6ee8 [2025-02-05 16:27:13,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:27:13,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:27:13,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:27:13,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:27:13,480 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:27:13,481 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+nlh-reducer.c [2025-02-05 16:27:14,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80ddf0e01/cc3165d5f0604e66a0bb2929f553a718/FLAGe2f37f197 [2025-02-05 16:27:15,141 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:27:15,141 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+nlh-reducer.c [2025-02-05 16:27:15,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80ddf0e01/cc3165d5f0604e66a0bb2929f553a718/FLAGe2f37f197 [2025-02-05 16:27:15,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80ddf0e01/cc3165d5f0604e66a0bb2929f553a718 [2025-02-05 16:27:15,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:27:15,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:27:15,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:27:15,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:27:15,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:27:15,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:27:15" (1/1) ... [2025-02-05 16:27:15,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:15, skipping insertion in model container [2025-02-05 16:27:15,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:27:15" (1/1) ... [2025-02-05 16:27:15,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:27:15,476 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+nlh-reducer.c[14419,14432] [2025-02-05 16:27:15,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:27:15,543 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:27:15,622 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+nlh-reducer.c[14419,14432] [2025-02-05 16:27:15,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:27:15,683 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:27:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:15 WrapperNode [2025-02-05 16:27:15,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:27:15,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:27:15,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:27:15,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:27:15,692 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:15" (1/1) ... [2025-02-05 16:27:15,704 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:15" (1/1) ... [2025-02-05 16:27:15,758 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1244 [2025-02-05 16:27:15,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:27:15,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:27:15,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:27:15,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:27:15,769 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:15" (1/1) ... [2025-02-05 16:27:15,769 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:15" (1/1) ... [2025-02-05 16:27:15,781 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:15" (1/1) ... [2025-02-05 16:27:15,814 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:15,815 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:15" (1/1) ... [2025-02-05 16:27:15,815 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:15" (1/1) ... [2025-02-05 16:27:15,845 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:15" (1/1) ... [2025-02-05 16:27:15,852 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:15" (1/1) ... [2025-02-05 16:27:15,859 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:15" (1/1) ... [2025-02-05 16:27:15,866 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:15" (1/1) ... [2025-02-05 16:27:15,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:27:15,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:27:15,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:27:15,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:27:15,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:15" (1/1) ... [2025-02-05 16:27:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:27:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:27:15,910 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:15,919 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:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:27:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:27:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:27:15,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:27:16,052 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:27:16,053 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:27:17,197 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:17,198 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~check__tmp~4#1; [2025-02-05 16:27:17,198 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:17,198 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L848: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;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:17,198 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1344: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:27:17,262 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 16:27:17,262 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:27:17,283 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:27:17,283 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:27:17,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:27:17 BoogieIcfgContainer [2025-02-05 16:27:17,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:27:17,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:27:17,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:27:17,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:27:17,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:27:15" (1/3) ... [2025-02-05 16:27:17,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4913a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:27:17, skipping insertion in model container [2025-02-05 16:27:17,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:27:15" (2/3) ... [2025-02-05 16:27:17,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4913a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:27:17, skipping insertion in model container [2025-02-05 16:27:17,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:27:17" (3/3) ... [2025-02-05 16:27:17,298 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:27:17,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:27:17,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 312 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:27:17,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:27:17,392 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;@70884b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:27:17,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:27:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 states have internal predecessors, (552), 0 states have call successors, (0), 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,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:27:17,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:17,410 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] [2025-02-05 16:27:17,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:17,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1066727839, now seen corresponding path program 1 times [2025-02-05 16:27:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376834556] [2025-02-05 16:27:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:27:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:27:17,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:17,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:18,562 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,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376834556] [2025-02-05 16:27:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376834556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:18,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:18,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246466217] [2025-02-05 16:27:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:18,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:18,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:18,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:18,589 INFO L87 Difference]: Start difference. First operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:18,860 INFO L93 Difference]: Finished difference Result 1493 states and 2655 transitions. [2025-02-05 16:27:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 16:27:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:18,889 INFO L225 Difference]: With dead ends: 1493 [2025-02-05 16:27:18,889 INFO L226 Difference]: Without dead ends: 1182 [2025-02-05 16:27:18,896 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:18,901 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 1608 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:18,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 2379 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-02-05 16:27:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 595. [2025-02-05 16:27:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4528619528619529) internal successors, (863), 594 states have internal predecessors, (863), 0 states have call successors, (0), 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,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 863 transitions. [2025-02-05 16:27:18,989 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 863 transitions. Word has length 146 [2025-02-05 16:27:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:18,989 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 863 transitions. [2025-02-05 16:27:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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,990 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 863 transitions. [2025-02-05 16:27:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:27:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:18,995 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] [2025-02-05 16:27:18,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:27:18,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:18,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash -164505949, now seen corresponding path program 1 times [2025-02-05 16:27:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:18,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-02-05 16:27:18,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:19,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:27:19,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:27:19,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:19,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:19,167 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:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-02-05 16:27:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561244670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:19,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:19,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923741231] [2025-02-05 16:27:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:19,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:19,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:19,172 INFO L87 Difference]: Start difference. First operand 595 states and 863 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:19,207 INFO L93 Difference]: Finished difference Result 1164 states and 1683 transitions. [2025-02-05 16:27:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:19,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-02-05 16:27:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:19,210 INFO L225 Difference]: With dead ends: 1164 [2025-02-05 16:27:19,210 INFO L226 Difference]: Without dead ends: 597 [2025-02-05 16:27:19,212 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,213 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 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:19,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 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:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-05 16:27:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-02-05 16:27:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.4513422818791946) internal successors, (865), 596 states have internal predecessors, (865), 0 states have call successors, (0), 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,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 865 transitions. [2025-02-05 16:27:19,231 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 865 transitions. Word has length 147 [2025-02-05 16:27:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:19,231 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 865 transitions. [2025-02-05 16:27:19,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 865 transitions. [2025-02-05 16:27:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:27:19,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:19,234 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] [2025-02-05 16:27:19,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:27:19,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:19,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2129470215, now seen corresponding path program 1 times [2025-02-05 16:27:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42636727] [2025-02-05 16:27:19,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:19,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:27:19,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:27:19,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:19,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:19,815 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:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42636727] [2025-02-05 16:27:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42636727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687337154] [2025-02-05 16:27:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:19,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:19,817 INFO L87 Difference]: Start difference. First operand 597 states and 865 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:19,853 INFO L93 Difference]: Finished difference Result 1184 states and 1716 transitions. [2025-02-05 16:27:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-05 16:27:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:19,860 INFO L225 Difference]: With dead ends: 1184 [2025-02-05 16:27:19,860 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 16:27:19,865 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:19,866 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 24 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1434 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:19,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1434 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:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 16:27:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 16:27:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4494949494949494) internal successors, (861), 594 states have internal predecessors, (861), 0 states have call successors, (0), 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 861 transitions. [2025-02-05 16:27:19,891 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 861 transitions. Word has length 148 [2025-02-05 16:27:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:19,892 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 861 transitions. [2025-02-05 16:27:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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,893 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 861 transitions. [2025-02-05 16:27:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:27:19,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:19,896 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] [2025-02-05 16:27:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:27:19,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -986467042, now seen corresponding path program 1 times [2025-02-05 16:27:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164039450] [2025-02-05 16:27:19,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:27:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:27:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:20,046 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,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164039450] [2025-02-05 16:27:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164039450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702459060] [2025-02-05 16:27:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:20,048 INFO L87 Difference]: Start difference. First operand 595 states and 861 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:20,109 INFO L93 Difference]: Finished difference Result 1302 states and 1896 transitions. [2025-02-05 16:27:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-05 16:27:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:20,114 INFO L225 Difference]: With dead ends: 1302 [2025-02-05 16:27:20,114 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 16:27:20,115 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:20,116 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 383 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1170 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:20,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1170 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:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 16:27:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 16:27:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4316628701594534) internal successors, (1257), 878 states have internal predecessors, (1257), 0 states have call successors, (0), 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,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1257 transitions. [2025-02-05 16:27:20,149 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1257 transitions. Word has length 148 [2025-02-05 16:27:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1257 transitions. [2025-02-05 16:27:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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,150 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1257 transitions. [2025-02-05 16:27:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:20,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:20,153 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] [2025-02-05 16:27:20,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:27:20,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1309989492, now seen corresponding path program 1 times [2025-02-05 16:27:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234536042] [2025-02-05 16:27:20,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:20,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:20,292 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,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234536042] [2025-02-05 16:27:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234536042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764446060] [2025-02-05 16:27:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:20,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:20,294 INFO L87 Difference]: Start difference. First operand 879 states and 1257 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:20,547 INFO L93 Difference]: Finished difference Result 2213 states and 3211 transitions. [2025-02-05 16:27:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:20,554 INFO L225 Difference]: With dead ends: 2213 [2025-02-05 16:27:20,554 INFO L226 Difference]: Without dead ends: 1582 [2025-02-05 16:27:20,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:20,556 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 294 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:20,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 785 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-02-05 16:27:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1580. [2025-02-05 16:27:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.4344521849271692) internal successors, (2265), 1579 states have internal predecessors, (2265), 0 states have call successors, (0), 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,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2265 transitions. [2025-02-05 16:27:20,598 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2265 transitions. Word has length 154 [2025-02-05 16:27:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2265 transitions. [2025-02-05 16:27:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2265 transitions. [2025-02-05 16:27:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:20,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:20,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:27:20,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:20,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 922796211, now seen corresponding path program 1 times [2025-02-05 16:27:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528134322] [2025-02-05 16:27:20,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:20,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:20,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:20,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:20,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:20,801 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,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528134322] [2025-02-05 16:27:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528134322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97904125] [2025-02-05 16:27:20,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:20,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:20,803 INFO L87 Difference]: Start difference. First operand 1580 states and 2265 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:21,004 INFO L93 Difference]: Finished difference Result 2157 states and 3128 transitions. [2025-02-05 16:27:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:21,009 INFO L225 Difference]: With dead ends: 2157 [2025-02-05 16:27:21,009 INFO L226 Difference]: Without dead ends: 879 [2025-02-05 16:27:21,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:27:21,013 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1182 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:21,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 434 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-05 16:27:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2025-02-05 16:27:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4145785876993167) internal successors, (1242), 878 states have internal predecessors, (1242), 0 states have call successors, (0), 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1242 transitions. [2025-02-05 16:27:21,038 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1242 transitions. Word has length 154 [2025-02-05 16:27:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:21,039 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1242 transitions. [2025-02-05 16:27:21,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1242 transitions. [2025-02-05 16:27:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:21,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:21,041 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] [2025-02-05 16:27:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:27:21,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash -492520139, now seen corresponding path program 1 times [2025-02-05 16:27:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597931904] [2025-02-05 16:27:21,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:21,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:21,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:21,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:21,876 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:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597931904] [2025-02-05 16:27:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597931904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:21,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:27:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984524589] [2025-02-05 16:27:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:21,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:27:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:21,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:27:21,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:21,880 INFO L87 Difference]: Start difference. First operand 879 states and 1242 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:22,153 INFO L93 Difference]: Finished difference Result 1738 states and 2554 transitions. [2025-02-05 16:27:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:22,161 INFO L225 Difference]: With dead ends: 1738 [2025-02-05 16:27:22,162 INFO L226 Difference]: Without dead ends: 1434 [2025-02-05 16:27:22,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:22,165 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1885 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:22,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 2452 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-02-05 16:27:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2025-02-05 16:27:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.4367575122292104) internal successors, (2056), 1431 states have internal predecessors, (2056), 0 states have call successors, (0), 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:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2056 transitions. [2025-02-05 16:27:22,207 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2056 transitions. Word has length 154 [2025-02-05 16:27:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2056 transitions. [2025-02-05 16:27:22,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2056 transitions. [2025-02-05 16:27:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:22,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:22,211 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] [2025-02-05 16:27:22,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:27:22,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1503637389, now seen corresponding path program 1 times [2025-02-05 16:27:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931604370] [2025-02-05 16:27:22,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:22,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:22,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:22,471 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931604370] [2025-02-05 16:27:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931604370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808099885] [2025-02-05 16:27:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:22,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:22,475 INFO L87 Difference]: Start difference. First operand 1432 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:22,653 INFO L93 Difference]: Finished difference Result 2844 states and 4326 transitions. [2025-02-05 16:27:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:22,665 INFO L225 Difference]: With dead ends: 2844 [2025-02-05 16:27:22,666 INFO L226 Difference]: Without dead ends: 2603 [2025-02-05 16:27:22,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:27:22,668 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1002 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:22,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1494 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2025-02-05 16:27:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2059. [2025-02-05 16:27:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 2058 states have (on average 1.4805636540330418) internal successors, (3047), 2058 states have internal predecessors, (3047), 0 states have call successors, (0), 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:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3047 transitions. [2025-02-05 16:27:22,735 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3047 transitions. Word has length 154 [2025-02-05 16:27:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 3047 transitions. [2025-02-05 16:27:22,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3047 transitions. [2025-02-05 16:27:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:22,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:22,742 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] [2025-02-05 16:27:22,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:27:22,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash 271369973, now seen corresponding path program 1 times [2025-02-05 16:27:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:22,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355947796] [2025-02-05 16:27:22,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:22,860 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,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355947796] [2025-02-05 16:27:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355947796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485956346] [2025-02-05 16:27:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:22,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:22,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:22,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:22,863 INFO L87 Difference]: Start difference. First operand 2059 states and 3047 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:22,960 INFO L93 Difference]: Finished difference Result 4507 states and 6846 transitions. [2025-02-05 16:27:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:22,973 INFO L225 Difference]: With dead ends: 4507 [2025-02-05 16:27:22,973 INFO L226 Difference]: Without dead ends: 3444 [2025-02-05 16:27:22,975 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:22,979 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 262 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:22,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 722 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2025-02-05 16:27:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3442. [2025-02-05 16:27:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3441 states have (on average 1.4829991281604185) internal successors, (5103), 3441 states have internal predecessors, (5103), 0 states have call successors, (0), 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:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5103 transitions. [2025-02-05 16:27:23,099 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5103 transitions. Word has length 154 [2025-02-05 16:27:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 5103 transitions. [2025-02-05 16:27:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5103 transitions. [2025-02-05 16:27:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:23,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:23,104 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] [2025-02-05 16:27:23,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:27:23,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1284782671, now seen corresponding path program 1 times [2025-02-05 16:27:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722347921] [2025-02-05 16:27:23,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:23,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:23,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:23,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:23,220 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:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722347921] [2025-02-05 16:27:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722347921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999978189] [2025-02-05 16:27:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:23,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:23,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:23,222 INFO L87 Difference]: Start difference. First operand 3442 states and 5103 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:23,313 INFO L93 Difference]: Finished difference Result 7428 states and 11243 transitions. [2025-02-05 16:27:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:23,336 INFO L225 Difference]: With dead ends: 7428 [2025-02-05 16:27:23,337 INFO L226 Difference]: Without dead ends: 6118 [2025-02-05 16:27:23,340 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:23,341 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 277 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:23,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 752 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2025-02-05 16:27:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 6116. [2025-02-05 16:27:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 6115 states have (on average 1.4940310711365494) internal successors, (9136), 6115 states have internal predecessors, (9136), 0 states have call successors, (0), 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:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 9136 transitions. [2025-02-05 16:27:23,510 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 9136 transitions. Word has length 154 [2025-02-05 16:27:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 6116 states and 9136 transitions. [2025-02-05 16:27:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 9136 transitions. [2025-02-05 16:27:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:27:23,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:23,517 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] [2025-02-05 16:27:23,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:27:23,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:23,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash -346763591, now seen corresponding path program 1 times [2025-02-05 16:27:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:23,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608691283] [2025-02-05 16:27:23,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:27:23,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:27:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:23,867 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:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608691283] [2025-02-05 16:27:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608691283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758525421] [2025-02-05 16:27:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:23,869 INFO L87 Difference]: Start difference. First operand 6116 states and 9136 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:24,049 INFO L93 Difference]: Finished difference Result 15978 states and 23861 transitions. [2025-02-05 16:27:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 16:27:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:24,098 INFO L225 Difference]: With dead ends: 15978 [2025-02-05 16:27:24,098 INFO L226 Difference]: Without dead ends: 9881 [2025-02-05 16:27:24,106 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:24,107 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 382 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:24,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1913 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2025-02-05 16:27:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 9879. [2025-02-05 16:27:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9879 states, 9878 states have (on average 1.478335695484916) internal successors, (14603), 9878 states have internal predecessors, (14603), 0 states have call successors, (0), 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,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9879 states to 9879 states and 14603 transitions. [2025-02-05 16:27:24,439 INFO L78 Accepts]: Start accepts. Automaton has 9879 states and 14603 transitions. Word has length 154 [2025-02-05 16:27:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 9879 states and 14603 transitions. [2025-02-05 16:27:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9879 states and 14603 transitions. [2025-02-05 16:27:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 16:27:24,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:24,450 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] [2025-02-05 16:27:24,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:27:24,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:24,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 331773622, now seen corresponding path program 1 times [2025-02-05 16:27:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632407626] [2025-02-05 16:27:24,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:24,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:27:24,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:27:24,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:24,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:24,552 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:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632407626] [2025-02-05 16:27:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632407626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:24,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874857949] [2025-02-05 16:27:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:24,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:24,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:24,555 INFO L87 Difference]: Start difference. First operand 9879 states and 14603 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:24,707 INFO L93 Difference]: Finished difference Result 26731 states and 39465 transitions. [2025-02-05 16:27:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 16:27:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:24,793 INFO L225 Difference]: With dead ends: 26731 [2025-02-05 16:27:24,794 INFO L226 Difference]: Without dead ends: 17209 [2025-02-05 16:27:24,806 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:24,807 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 371 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:24,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1228 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17209 states. [2025-02-05 16:27:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17209 to 17207. [2025-02-05 16:27:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17207 states, 17206 states have (on average 1.4569917470649774) internal successors, (25069), 17206 states have internal predecessors, (25069), 0 states have call successors, (0), 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,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17207 states to 17207 states and 25069 transitions. [2025-02-05 16:27:25,272 INFO L78 Accepts]: Start accepts. Automaton has 17207 states and 25069 transitions. Word has length 156 [2025-02-05 16:27:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 17207 states and 25069 transitions. [2025-02-05 16:27:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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,272 INFO L276 IsEmpty]: Start isEmpty. Operand 17207 states and 25069 transitions. [2025-02-05 16:27:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 16:27:25,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:25,338 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] [2025-02-05 16:27:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:27:25,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash -591393804, now seen corresponding path program 1 times [2025-02-05 16:27:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296967741] [2025-02-05 16:27:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:25,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:27:25,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:27:25,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:25,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:25,795 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,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296967741] [2025-02-05 16:27:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296967741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564940240] [2025-02-05 16:27:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:25,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:25,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:25,798 INFO L87 Difference]: Start difference. First operand 17207 states and 25069 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:25,940 INFO L93 Difference]: Finished difference Result 28672 states and 41776 transitions. [2025-02-05 16:27:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 16:27:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:25,981 INFO L225 Difference]: With dead ends: 28672 [2025-02-05 16:27:25,981 INFO L226 Difference]: Without dead ends: 15478 [2025-02-05 16:27:26,003 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:26,004 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 19 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:26,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1398 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2025-02-05 16:27:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 15478. [2025-02-05 16:27:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15478 states, 15477 states have (on average 1.456742262712412) internal successors, (22546), 15477 states have internal predecessors, (22546), 0 states have call successors, (0), 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,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15478 states to 15478 states and 22546 transitions. [2025-02-05 16:27:26,571 INFO L78 Accepts]: Start accepts. Automaton has 15478 states and 22546 transitions. Word has length 156 [2025-02-05 16:27:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 15478 states and 22546 transitions. [2025-02-05 16:27:26,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15478 states and 22546 transitions. [2025-02-05 16:27:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:27:26,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:26,587 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] [2025-02-05 16:27:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:27:26,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:26,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -437471017, now seen corresponding path program 1 times [2025-02-05 16:27:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253482704] [2025-02-05 16:27:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:27:26,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:27:26,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:26,839 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:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253482704] [2025-02-05 16:27:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253482704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298456414] [2025-02-05 16:27:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:26,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:26,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:26,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:26,842 INFO L87 Difference]: Start difference. First operand 15478 states and 22546 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:27,325 INFO L93 Difference]: Finished difference Result 40950 states and 63288 transitions. [2025-02-05 16:27:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:27:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 16:27:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:27,417 INFO L225 Difference]: With dead ends: 40950 [2025-02-05 16:27:27,418 INFO L226 Difference]: Without dead ends: 32424 [2025-02-05 16:27:27,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:27:27,446 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1286 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:27,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1730 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32424 states. [2025-02-05 16:27:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32424 to 21458. [2025-02-05 16:27:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21458 states, 21457 states have (on average 1.488092463997763) internal successors, (31930), 21457 states have internal predecessors, (31930), 0 states have call successors, (0), 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,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21458 states to 21458 states and 31930 transitions. [2025-02-05 16:27:28,082 INFO L78 Accepts]: Start accepts. Automaton has 21458 states and 31930 transitions. Word has length 162 [2025-02-05 16:27:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:28,082 INFO L471 AbstractCegarLoop]: Abstraction has 21458 states and 31930 transitions. [2025-02-05 16:27:28,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21458 states and 31930 transitions. [2025-02-05 16:27:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:27:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:28,096 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] [2025-02-05 16:27:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:27:28,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:28,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 225705423, now seen corresponding path program 1 times [2025-02-05 16:27:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301652601] [2025-02-05 16:27:28,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:28,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:27:28,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:27:28,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:28,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:28,846 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:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:28,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301652601] [2025-02-05 16:27:28,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301652601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:28,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:27:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588270885] [2025-02-05 16:27:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:27:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:27:28,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:28,848 INFO L87 Difference]: Start difference. First operand 21458 states and 31930 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 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:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:29,205 INFO L93 Difference]: Finished difference Result 36374 states and 55556 transitions. [2025-02-05 16:27:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 16:27:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:29,254 INFO L225 Difference]: With dead ends: 36374 [2025-02-05 16:27:29,254 INFO L226 Difference]: Without dead ends: 21460 [2025-02-05 16:27:29,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:27:29,280 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 2039 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:29,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2448 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:27:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21460 states. [2025-02-05 16:27:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21460 to 20246. [2025-02-05 16:27:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20246 states, 20245 states have (on average 1.4772042479624599) internal successors, (29906), 20245 states have internal predecessors, (29906), 0 states have call successors, (0), 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:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20246 states to 20246 states and 29906 transitions. [2025-02-05 16:27:29,717 INFO L78 Accepts]: Start accepts. Automaton has 20246 states and 29906 transitions. Word has length 162 [2025-02-05 16:27:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 20246 states and 29906 transitions. [2025-02-05 16:27:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 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:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20246 states and 29906 transitions. [2025-02-05 16:27:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:27:29,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:29,733 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] [2025-02-05 16:27:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:27:29,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2000712785, now seen corresponding path program 1 times [2025-02-05 16:27:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:29,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144550667] [2025-02-05 16:27:29,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:29,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:27:29,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:27:29,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:29,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:29,924 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:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144550667] [2025-02-05 16:27:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144550667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:29,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060101927] [2025-02-05 16:27:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:29,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:29,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:29,927 INFO L87 Difference]: Start difference. First operand 20246 states and 29906 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:30,187 INFO L93 Difference]: Finished difference Result 40834 states and 62502 transitions. [2025-02-05 16:27:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 16:27:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:30,282 INFO L225 Difference]: With dead ends: 40834 [2025-02-05 16:27:30,282 INFO L226 Difference]: Without dead ends: 35976 [2025-02-05 16:27:30,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:27:30,304 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 809 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:30,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1484 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35976 states. [2025-02-05 16:27:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35976 to 22670. [2025-02-05 16:27:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22670 states, 22669 states have (on average 1.4882879703559928) internal successors, (33738), 22669 states have internal predecessors, (33738), 0 states have call successors, (0), 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:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22670 states to 22670 states and 33738 transitions. [2025-02-05 16:27:30,871 INFO L78 Accepts]: Start accepts. Automaton has 22670 states and 33738 transitions. Word has length 162 [2025-02-05 16:27:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:30,872 INFO L471 AbstractCegarLoop]: Abstraction has 22670 states and 33738 transitions. [2025-02-05 16:27:30,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22670 states and 33738 transitions. [2025-02-05 16:27:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 16:27:30,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:30,886 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] [2025-02-05 16:27:30,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:27:30,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:30,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 719901259, now seen corresponding path program 1 times [2025-02-05 16:27:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393674736] [2025-02-05 16:27:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 16:27:30,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 16:27:30,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:30,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:31,194 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:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393674736] [2025-02-05 16:27:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393674736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:31,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530688394] [2025-02-05 16:27:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:31,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:31,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:31,196 INFO L87 Difference]: Start difference. First operand 22670 states and 33738 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:31,734 INFO L93 Difference]: Finished difference Result 110272 states and 163825 transitions. [2025-02-05 16:27:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 16:27:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:31,993 INFO L225 Difference]: With dead ends: 110272 [2025-02-05 16:27:31,994 INFO L226 Difference]: Without dead ends: 87641 [2025-02-05 16:27:32,040 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:32,041 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1220 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:32,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 1928 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87641 states. [2025-02-05 16:27:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87641 to 43863. [2025-02-05 16:27:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43863 states, 43862 states have (on average 1.4720714969677626) internal successors, (64568), 43862 states have internal predecessors, (64568), 0 states have call successors, (0), 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,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43863 states to 43863 states and 64568 transitions. [2025-02-05 16:27:33,246 INFO L78 Accepts]: Start accepts. Automaton has 43863 states and 64568 transitions. Word has length 162 [2025-02-05 16:27:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 43863 states and 64568 transitions. [2025-02-05 16:27:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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,247 INFO L276 IsEmpty]: Start isEmpty. Operand 43863 states and 64568 transitions. [2025-02-05 16:27:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 16:27:33,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:33,266 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] [2025-02-05 16:27:33,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:27:33,266 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:33,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1839911229, now seen corresponding path program 1 times [2025-02-05 16:27:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392225152] [2025-02-05 16:27:33,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:33,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 16:27:33,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 16:27:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:33,337 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:33,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392225152] [2025-02-05 16:27:33,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392225152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:33,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:33,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:33,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202113669] [2025-02-05 16:27:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:33,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:33,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:33,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:33,339 INFO L87 Difference]: Start difference. First operand 43863 states and 64568 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:33,538 INFO L93 Difference]: Finished difference Result 87631 states and 129012 transitions. [2025-02-05 16:27:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 16:27:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:33,625 INFO L225 Difference]: With dead ends: 87631 [2025-02-05 16:27:33,625 INFO L226 Difference]: Without dead ends: 43869 [2025-02-05 16:27:33,671 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:33,672 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 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:33,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 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:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43869 states. [2025-02-05 16:27:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43869 to 43869. [2025-02-05 16:27:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43869 states, 43868 states have (on average 1.4720069298805507) internal successors, (64574), 43868 states have internal predecessors, (64574), 0 states have call successors, (0), 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,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43869 states to 43869 states and 64574 transitions. [2025-02-05 16:27:34,833 INFO L78 Accepts]: Start accepts. Automaton has 43869 states and 64574 transitions. Word has length 163 [2025-02-05 16:27:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:34,833 INFO L471 AbstractCegarLoop]: Abstraction has 43869 states and 64574 transitions. [2025-02-05 16:27:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43869 states and 64574 transitions. [2025-02-05 16:27:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 16:27:34,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:34,855 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] [2025-02-05 16:27:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:27:34,855 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1413760285, now seen corresponding path program 1 times [2025-02-05 16:27:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546454624] [2025-02-05 16:27:34,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:34,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 16:27:34,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 16:27:34,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:34,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:35,306 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,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546454624] [2025-02-05 16:27:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546454624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:35,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:35,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891422693] [2025-02-05 16:27:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:35,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:35,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:35,309 INFO L87 Difference]: Start difference. First operand 43869 states and 64574 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:35,644 INFO L93 Difference]: Finished difference Result 87700 states and 129096 transitions. [2025-02-05 16:27:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 16:27:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:35,708 INFO L225 Difference]: With dead ends: 87700 [2025-02-05 16:27:35,708 INFO L226 Difference]: Without dead ends: 43863 [2025-02-05 16:27:35,749 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:35,750 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 14 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1380 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:35,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1380 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:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43863 states. [2025-02-05 16:27:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43863 to 43863. [2025-02-05 16:27:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43863 states, 43862 states have (on average 1.4719347042998496) internal successors, (64562), 43862 states have internal predecessors, (64562), 0 states have call successors, (0), 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43863 states to 43863 states and 64562 transitions. [2025-02-05 16:27:36,393 INFO L78 Accepts]: Start accepts. Automaton has 43863 states and 64562 transitions. Word has length 164 [2025-02-05 16:27:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:36,394 INFO L471 AbstractCegarLoop]: Abstraction has 43863 states and 64562 transitions. [2025-02-05 16:27:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43863 states and 64562 transitions. [2025-02-05 16:27:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 16:27:36,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:36,406 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] [2025-02-05 16:27:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:27:36,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash -968326264, now seen corresponding path program 1 times [2025-02-05 16:27:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385605809] [2025-02-05 16:27:36,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:36,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 16:27:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 16:27:36,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:36,492 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:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385605809] [2025-02-05 16:27:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385605809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313336910] [2025-02-05 16:27:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:36,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:36,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:36,494 INFO L87 Difference]: Start difference. First operand 43863 states and 64562 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:37,023 INFO L93 Difference]: Finished difference Result 108289 states and 159185 transitions. [2025-02-05 16:27:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 16:27:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:37,128 INFO L225 Difference]: With dead ends: 108289 [2025-02-05 16:27:37,128 INFO L226 Difference]: Without dead ends: 65097 [2025-02-05 16:27:37,168 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:37,169 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 362 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1184 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:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1184 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:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65097 states. [2025-02-05 16:27:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65097 to 65095. [2025-02-05 16:27:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65095 states, 65094 states have (on average 1.4488739361538698) internal successors, (94313), 65094 states have internal predecessors, (94313), 0 states have call successors, (0), 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,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65095 states to 65095 states and 94313 transitions. [2025-02-05 16:27:38,548 INFO L78 Accepts]: Start accepts. Automaton has 65095 states and 94313 transitions. Word has length 164 [2025-02-05 16:27:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:38,548 INFO L471 AbstractCegarLoop]: Abstraction has 65095 states and 94313 transitions. [2025-02-05 16:27:38,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65095 states and 94313 transitions. [2025-02-05 16:27:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:27:38,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:38,563 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] [2025-02-05 16:27:38,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:27:38,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1863867487, now seen corresponding path program 1 times [2025-02-05 16:27:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368280003] [2025-02-05 16:27:38,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:38,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:27:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:27:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:38,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:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368280003] [2025-02-05 16:27:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368280003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571805411] [2025-02-05 16:27:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:38,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:38,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:38,736 INFO L87 Difference]: Start difference. First operand 65095 states and 94313 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:39,176 INFO L93 Difference]: Finished difference Result 99839 states and 147765 transitions. [2025-02-05 16:27:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 16:27:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:39,324 INFO L225 Difference]: With dead ends: 99839 [2025-02-05 16:27:39,325 INFO L226 Difference]: Without dead ends: 92861 [2025-02-05 16:27:39,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:27:39,359 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 823 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:39,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1455 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92861 states. [2025-02-05 16:27:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92861 to 72047. [2025-02-05 16:27:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72047 states, 72046 states have (on average 1.4566388140909974) internal successors, (104945), 72046 states have internal predecessors, (104945), 0 states have call successors, (0), 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,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72047 states to 72047 states and 104945 transitions. [2025-02-05 16:27:40,590 INFO L78 Accepts]: Start accepts. Automaton has 72047 states and 104945 transitions. Word has length 170 [2025-02-05 16:27:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:40,591 INFO L471 AbstractCegarLoop]: Abstraction has 72047 states and 104945 transitions. [2025-02-05 16:27:40,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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,591 INFO L276 IsEmpty]: Start isEmpty. Operand 72047 states and 104945 transitions. [2025-02-05 16:27:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:27:40,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:40,610 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] [2025-02-05 16:27:40,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:27:40,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:40,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1102099099, now seen corresponding path program 1 times [2025-02-05 16:27:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729343574] [2025-02-05 16:27:40,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:40,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:27:40,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:27:40,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:40,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:41,491 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:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:41,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729343574] [2025-02-05 16:27:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729343574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:41,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:27:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137596675] [2025-02-05 16:27:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:41,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:27:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:41,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:27:41,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:27:41,494 INFO L87 Difference]: Start difference. First operand 72047 states and 104945 transitions. Second operand has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 14 states have internal predecessors, (170), 0 states have call successors, (0), 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,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:42,608 INFO L93 Difference]: Finished difference Result 92966 states and 135398 transitions. [2025-02-05 16:27:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:27:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 14 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 16:27:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:42,790 INFO L225 Difference]: With dead ends: 92966 [2025-02-05 16:27:42,790 INFO L226 Difference]: Without dead ends: 74102 [2025-02-05 16:27:42,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:27:42,842 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 2206 mSDsluCounter, 3402 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:42,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 3839 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:27:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74102 states. [2025-02-05 16:27:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74102 to 72573. [2025-02-05 16:27:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72573 states, 72572 states have (on average 1.4547759466460894) internal successors, (105576), 72572 states have internal predecessors, (105576), 0 states have call successors, (0), 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:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72573 states to 72573 states and 105576 transitions. [2025-02-05 16:27:44,197 INFO L78 Accepts]: Start accepts. Automaton has 72573 states and 105576 transitions. Word has length 170 [2025-02-05 16:27:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:44,198 INFO L471 AbstractCegarLoop]: Abstraction has 72573 states and 105576 transitions. [2025-02-05 16:27:44,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 14 states have internal predecessors, (170), 0 states have call successors, (0), 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:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 72573 states and 105576 transitions. [2025-02-05 16:27:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:27:44,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:44,212 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] [2025-02-05 16:27:44,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:27:44,212 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash -162312165, now seen corresponding path program 1 times [2025-02-05 16:27:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523846195] [2025-02-05 16:27:44,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:27:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:27:44,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:44,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:44,942 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,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:44,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523846195] [2025-02-05 16:27:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523846195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:44,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:44,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:27:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503429278] [2025-02-05 16:27:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:44,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:27:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:44,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:27:44,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:27:44,944 INFO L87 Difference]: Start difference. First operand 72573 states and 105576 transitions. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 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,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:46,231 INFO L93 Difference]: Finished difference Result 154468 states and 228570 transitions. [2025-02-05 16:27:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:27:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 16:27:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:46,394 INFO L225 Difference]: With dead ends: 154468 [2025-02-05 16:27:46,395 INFO L226 Difference]: Without dead ends: 115882 [2025-02-05 16:27:46,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:27:46,461 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 2335 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 4026 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:46,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 4026 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:27:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115882 states. [2025-02-05 16:27:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115882 to 75121. [2025-02-05 16:27:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75121 states, 75120 states have (on average 1.445433972310969) internal successors, (108581), 75120 states have internal predecessors, (108581), 0 states have call successors, (0), 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,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75121 states to 75121 states and 108581 transitions. [2025-02-05 16:27:48,232 INFO L78 Accepts]: Start accepts. Automaton has 75121 states and 108581 transitions. Word has length 170 [2025-02-05 16:27:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 75121 states and 108581 transitions. [2025-02-05 16:27:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 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,232 INFO L276 IsEmpty]: Start isEmpty. Operand 75121 states and 108581 transitions. [2025-02-05 16:27:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:27:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:48,247 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] [2025-02-05 16:27:48,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:27:48,248 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -100272551, now seen corresponding path program 1 times [2025-02-05 16:27:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654665399] [2025-02-05 16:27:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:48,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:27:48,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:27:48,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:48,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:48,502 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:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654665399] [2025-02-05 16:27:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654665399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890365283] [2025-02-05 16:27:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:48,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:48,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:48,504 INFO L87 Difference]: Start difference. First operand 75121 states and 108581 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:48,873 INFO L93 Difference]: Finished difference Result 121690 states and 175877 transitions. [2025-02-05 16:27:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:48,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 16:27:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:48,986 INFO L225 Difference]: With dead ends: 121690 [2025-02-05 16:27:48,986 INFO L226 Difference]: Without dead ends: 66819 [2025-02-05 16:27:49,040 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:49,041 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 378 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:49,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1466 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66819 states. [2025-02-05 16:27:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66819 to 66652. [2025-02-05 16:27:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66652 states, 66651 states have (on average 1.4420038709096639) internal successors, (96111), 66651 states have internal predecessors, (96111), 0 states have call successors, (0), 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,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66652 states to 66652 states and 96111 transitions. [2025-02-05 16:27:50,560 INFO L78 Accepts]: Start accepts. Automaton has 66652 states and 96111 transitions. Word has length 170 [2025-02-05 16:27:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 66652 states and 96111 transitions. [2025-02-05 16:27:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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,560 INFO L276 IsEmpty]: Start isEmpty. Operand 66652 states and 96111 transitions. [2025-02-05 16:27:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 16:27:50,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:50,576 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, 1] [2025-02-05 16:27:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:27:50,576 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1903378218, now seen corresponding path program 1 times [2025-02-05 16:27:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580262480] [2025-02-05 16:27:50,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:50,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 16:27:50,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 16:27:50,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:50,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:50,859 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:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580262480] [2025-02-05 16:27:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580262480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:50,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414802895] [2025-02-05 16:27:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:50,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:50,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:50,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:50,862 INFO L87 Difference]: Start difference. First operand 66652 states and 96111 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:51,461 INFO L93 Difference]: Finished difference Result 200485 states and 288934 transitions. [2025-02-05 16:27:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-05 16:27:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:51,718 INFO L225 Difference]: With dead ends: 200485 [2025-02-05 16:27:51,718 INFO L226 Difference]: Without dead ends: 133996 [2025-02-05 16:27:51,819 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:51,820 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1212 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1826 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:51,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1826 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133996 states. [2025-02-05 16:27:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133996 to 66791. [2025-02-05 16:27:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66791 states, 66790 states have (on average 1.4411738284174278) internal successors, (96256), 66790 states have internal predecessors, (96256), 0 states have call successors, (0), 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,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66791 states to 66791 states and 96256 transitions. [2025-02-05 16:27:54,060 INFO L78 Accepts]: Start accepts. Automaton has 66791 states and 96256 transitions. Word has length 172 [2025-02-05 16:27:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 66791 states and 96256 transitions. [2025-02-05 16:27:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66791 states and 96256 transitions. [2025-02-05 16:27:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 16:27:54,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:54,079 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, 1, 1] [2025-02-05 16:27:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:27:54,080 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -601586914, now seen corresponding path program 1 times [2025-02-05 16:27:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119989281] [2025-02-05 16:27:54,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:54,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 16:27:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 16:27:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:54,141 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,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119989281] [2025-02-05 16:27:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119989281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530655899] [2025-02-05 16:27:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:54,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:54,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:54,144 INFO L87 Difference]: Start difference. First operand 66791 states and 96256 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:54,413 INFO L93 Difference]: Finished difference Result 117955 states and 169924 transitions. [2025-02-05 16:27:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:54,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-05 16:27:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:54,495 INFO L225 Difference]: With dead ends: 117955 [2025-02-05 16:27:54,496 INFO L226 Difference]: Without dead ends: 66801 [2025-02-05 16:27:54,539 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:54,540 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 876 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:54,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 876 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:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66801 states. [2025-02-05 16:27:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66801 to 66801. [2025-02-05 16:27:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66801 states, 66800 states have (on average 1.4411077844311377) internal successors, (96266), 66800 states have internal predecessors, (96266), 0 states have call successors, (0), 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,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66801 states to 66801 states and 96266 transitions. [2025-02-05 16:27:55,616 INFO L78 Accepts]: Start accepts. Automaton has 66801 states and 96266 transitions. Word has length 173 [2025-02-05 16:27:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:55,616 INFO L471 AbstractCegarLoop]: Abstraction has 66801 states and 96266 transitions. [2025-02-05 16:27:55,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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,616 INFO L276 IsEmpty]: Start isEmpty. Operand 66801 states and 96266 transitions. [2025-02-05 16:27:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 16:27:55,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:55,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:27:55,632 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2052794414, now seen corresponding path program 1 times [2025-02-05 16:27:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649460908] [2025-02-05 16:27:55,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:55,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 16:27:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 16:27:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:56,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:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649460908] [2025-02-05 16:27:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649460908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409250736] [2025-02-05 16:27:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:56,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:56,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:56,235 INFO L87 Difference]: Start difference. First operand 66801 states and 96266 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:56,524 INFO L93 Difference]: Finished difference Result 124361 states and 179136 transitions. [2025-02-05 16:27:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-02-05 16:27:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:56,635 INFO L225 Difference]: With dead ends: 124361 [2025-02-05 16:27:56,635 INFO L226 Difference]: Without dead ends: 66801 [2025-02-05 16:27:56,693 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:56,694 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1339 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:56,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1339 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:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66801 states. [2025-02-05 16:27:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66801 to 66796. [2025-02-05 16:27:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66796 states, 66795 states have (on average 1.441021034508571) internal successors, (96253), 66795 states have internal predecessors, (96253), 0 states have call successors, (0), 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:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66796 states to 66796 states and 96253 transitions. [2025-02-05 16:27:57,817 INFO L78 Accepts]: Start accepts. Automaton has 66796 states and 96253 transitions. Word has length 174 [2025-02-05 16:27:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:57,817 INFO L471 AbstractCegarLoop]: Abstraction has 66796 states and 96253 transitions. [2025-02-05 16:27:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 66796 states and 96253 transitions. [2025-02-05 16:27:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 16:27:57,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:57,838 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, 1, 1, 1] [2025-02-05 16:27:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:27:57,839 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2052658771, now seen corresponding path program 1 times [2025-02-05 16:27:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502324998] [2025-02-05 16:27:57,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:57,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 16:27:57,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 16:27:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:58,195 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:58,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:58,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502324998] [2025-02-05 16:27:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502324998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:58,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:27:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158596354] [2025-02-05 16:27:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:27:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:58,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:27:58,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:27:58,198 INFO L87 Difference]: Start difference. First operand 66796 states and 96253 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:58,739 INFO L93 Difference]: Finished difference Result 108432 states and 156130 transitions. [2025-02-05 16:27:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:58,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-02-05 16:27:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:58,840 INFO L225 Difference]: With dead ends: 108432 [2025-02-05 16:27:58,841 INFO L226 Difference]: Without dead ends: 58196 [2025-02-05 16:27:58,884 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:58,885 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 393 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:58,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2144 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58196 states. [2025-02-05 16:27:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58196 to 57913. [2025-02-05 16:27:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57913 states, 57912 states have (on average 1.438337477552148) internal successors, (83297), 57912 states have internal predecessors, (83297), 0 states have call successors, (0), 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:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57913 states to 57913 states and 83297 transitions. [2025-02-05 16:27:59,920 INFO L78 Accepts]: Start accepts. Automaton has 57913 states and 83297 transitions. Word has length 174 [2025-02-05 16:27:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:59,921 INFO L471 AbstractCegarLoop]: Abstraction has 57913 states and 83297 transitions. [2025-02-05 16:27:59,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57913 states and 83297 transitions. [2025-02-05 16:27:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 16:27:59,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:59,933 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, 1, 1, 1, 1, 1] [2025-02-05 16:27:59,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:27:59,933 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:59,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1530151030, now seen corresponding path program 1 times [2025-02-05 16:27:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801178389] [2025-02-05 16:27:59,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:27:59,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:27:59,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:59,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:28:00,503 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:28:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:28:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801178389] [2025-02-05 16:28:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801178389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:28:00,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:28:00,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:28:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487811459] [2025-02-05 16:28:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:28:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:28:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:28:00,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:28:00,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:28:00,506 INFO L87 Difference]: Start difference. First operand 57913 states and 83297 transitions. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 0 states have call successors, (0), 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:28:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:28:01,835 INFO L93 Difference]: Finished difference Result 109690 states and 159437 transitions. [2025-02-05 16:28:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:28:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-02-05 16:28:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:28:01,939 INFO L225 Difference]: With dead ends: 109690 [2025-02-05 16:28:01,939 INFO L226 Difference]: Without dead ends: 78394 [2025-02-05 16:28:01,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:28:01,958 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 2091 mSDsluCounter, 4063 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:28:01,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 4593 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:28:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78394 states. [2025-02-05 16:28:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78394 to 60970. [2025-02-05 16:28:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60970 states, 60969 states have (on average 1.425527727205629) internal successors, (86913), 60969 states have internal predecessors, (86913), 0 states have call successors, (0), 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:28:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60970 states to 60970 states and 86913 transitions. [2025-02-05 16:28:02,996 INFO L78 Accepts]: Start accepts. Automaton has 60970 states and 86913 transitions. Word has length 176 [2025-02-05 16:28:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:28:02,997 INFO L471 AbstractCegarLoop]: Abstraction has 60970 states and 86913 transitions. [2025-02-05 16:28:02,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 0 states have call successors, (0), 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:28:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60970 states and 86913 transitions. [2025-02-05 16:28:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 16:28:03,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:28:03,018 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, 1, 1, 1, 1, 1] [2025-02-05 16:28:03,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:28:03,018 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:28:03,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:28:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1670699640, now seen corresponding path program 1 times [2025-02-05 16:28:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:28:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680899988] [2025-02-05 16:28:03,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:28:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:28:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:28:03,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:28:03,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:28:03,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:28:03,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 16:28:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:28:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:28:03,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:28:03,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 16:28:03,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 16:28:03,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 16:28:03,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 16:28:03,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:28:03,336 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:28:03,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 16:28:03,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 04:28:03 BoogieIcfgContainer [2025-02-05 16:28:03,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 16:28:03,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 16:28:03,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 16:28:03,554 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 16:28:03,555 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:17" (3/4) ... [2025-02-05 16:28:03,555 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 16:28:03,850 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 151. [2025-02-05 16:28:03,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 16:28:03,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 16:28:03,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 16:28:03,983 INFO L158 Benchmark]: Toolchain (without parser) took 48807.65ms. Allocated memory was 167.8MB in the beginning and 14.0GB in the end (delta: 13.8GB). Free memory was 121.3MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2025-02-05 16:28:03,983 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:28:03,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.31ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 94.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 16:28:03,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:28:03,984 INFO L158 Benchmark]: Boogie Preprocessor took 114.78ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 83.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:28:03,984 INFO L158 Benchmark]: IcfgBuilder took 1408.85ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 66.6MB in the end (delta: 17.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 16:28:03,984 INFO L158 Benchmark]: TraceAbstraction took 46263.62ms. Allocated memory was 167.8MB in the beginning and 14.0GB in the end (delta: 13.8GB). Free memory was 65.8MB in the beginning and 11.1GB in the end (delta: -11.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-05 16:28:03,984 INFO L158 Benchmark]: Witness Printer took 428.23ms. Allocated memory is still 14.0GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 16:28:03,985 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.30ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.31ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 94.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.78ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 83.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1408.85ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 66.6MB in the end (delta: 17.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 46263.62ms. Allocated memory was 167.8MB in the beginning and 14.0GB in the end (delta: 13.8GB). Free memory was 65.8MB in the beginning and 11.1GB in the end (delta: -11.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 428.23ms. Allocated memory is still 14.0GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 855]: 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_2235; [L84] int __return_2345; VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=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] [L87] int main__c1; [L88] int main__i2; [L89] main__c1 = 0 [L90] ep12 = __VERIFIER_nondet_bool() [L91] ep13 = __VERIFIER_nondet_bool() [L92] ep21 = __VERIFIER_nondet_bool() [L93] ep23 = __VERIFIER_nondet_bool() [L94] ep31 = __VERIFIER_nondet_bool() [L95] ep32 = __VERIFIER_nondet_bool() [L96] id1 = __VERIFIER_nondet_char() [L97] r1 = __VERIFIER_nondet_uchar() [L98] st1 = __VERIFIER_nondet_char() [L99] nl1 = __VERIFIER_nondet_char() [L100] m1 = __VERIFIER_nondet_char() [L101] max1 = __VERIFIER_nondet_char() [L102] mode1 = __VERIFIER_nondet_bool() [L103] id2 = __VERIFIER_nondet_char() [L104] r2 = __VERIFIER_nondet_uchar() [L105] st2 = __VERIFIER_nondet_char() [L106] nl2 = __VERIFIER_nondet_char() [L107] m2 = __VERIFIER_nondet_char() [L108] max2 = __VERIFIER_nondet_char() [L109] mode2 = __VERIFIER_nondet_bool() [L110] id3 = __VERIFIER_nondet_char() [L111] r3 = __VERIFIER_nondet_uchar() [L112] st3 = __VERIFIER_nondet_char() [L113] nl3 = __VERIFIER_nondet_char() [L114] m3 = __VERIFIER_nondet_char() [L115] max3 = __VERIFIER_nondet_char() [L116] mode3 = __VERIFIER_nondet_bool() [L118] _Bool init__r121; [L119] _Bool init__r131; [L120] _Bool init__r211; [L121] _Bool init__r231; [L122] _Bool init__r311; [L123] _Bool init__r321; [L124] _Bool init__r122; [L125] int init__tmp; [L126] _Bool init__r132; [L127] int init__tmp___0; [L128] _Bool init__r212; [L129] int init__tmp___1; [L130] _Bool init__r232; [L131] int init__tmp___2; [L132] _Bool init__r312; [L133] int init__tmp___3; [L134] _Bool init__r322; [L135] int init__tmp___4; [L136] int init__tmp___5; [L137] init__r121 = ep12 [L138] init__r131 = ep13 [L139] init__r211 = ep21 [L140] init__r231 = ep23 [L141] init__r311 = ep31 [L142] init__r321 = ep32 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L143] COND TRUE !(init__r121 == 0) [L145] init__tmp = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L147] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L148] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2274] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2276] COND TRUE !(ep23 == 0) [L2278] init__tmp___0 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L152] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L153] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2251] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2253] COND TRUE !(ep31 == 0) [L2255] init__tmp___1 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L157] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L158] COND TRUE !(init__r231 == 0) [L160] init__tmp___2 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L162] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L163] COND TRUE !(init__r311 == 0) [L165] init__tmp___3 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L167] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L168] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2182] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L2184] COND TRUE !(ep12 == 0) [L2186] init__tmp___4 = 1 VAL [__return_1742=0, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L172] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L173] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L177] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L181] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L183] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L185] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L187] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L189] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L191] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L193] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, 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=0, 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] [L195] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L197] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L199] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L201] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L203] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L205] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L207] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L209] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L211] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L213] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L215] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L217] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L219] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L221] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L223] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L225] COND TRUE ((int)mode3) == 0 [L227] init__tmp___5 = 1 [L228] __return_1742 = init__tmp___5 [L229] main__i2 = __return_1742 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=0, 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 main__i2 != 0 [L232] p12_old = nomsg [L233] p12_new = nomsg [L234] p13_old = nomsg [L235] p13_new = nomsg [L236] p21_old = nomsg [L237] p21_new = nomsg [L238] p23_old = nomsg [L239] p23_new = nomsg [L240] p31_old = nomsg [L241] p31_new = nomsg [L242] p32_old = nomsg [L243] p32_new = nomsg [L244] main__i2 = 0 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L246] COND FALSE !(!(mode1 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L252] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L254] COND TRUE !(ep12 == 0) [L256] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L257] COND TRUE max1 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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 p12_new == nomsg [L261] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L263] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L276] mode1 = 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L278] COND FALSE !(!(mode2 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L284] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L286] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L297] COND TRUE !(ep23 == 0) [L299] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L300] COND TRUE max2 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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] [L302] COND TRUE p23_new == nomsg [L304] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=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] [L306] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L308] mode2 = 1 VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L310] COND FALSE !(!(mode3 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L316] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L318] COND TRUE !(ep31 == 0) [L320] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L321] COND TRUE max3 != nomsg VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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 p31_new == nomsg [L325] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L327] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L329] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L340] mode3 = 1 [L341] p12_old = p12_new [L342] p12_new = nomsg [L343] p13_old = p13_new [L344] p13_new = nomsg [L345] p21_old = p21_new [L346] p21_new = nomsg [L347] p23_old = p23_new [L348] p23_new = nomsg [L349] p31_old = p31_new [L350] p31_new = nomsg [L351] p32_old = p32_new [L352] p32_new = nomsg [L354] int check__tmp; VAL [__return_1742=1, __return_1870=0, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L355] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L357] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L359] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L361] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L363] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L369] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L371] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L373] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L379] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L381] COND TRUE ((int)r1) < 2 [L383] check__tmp = 1 [L384] __return_1870 = check__tmp [L385] main__c1 = __return_1870 [L387] _Bool __tmp_1; [L388] __tmp_1 = main__c1 [L389] _Bool assert__arg; [L390] assert__arg = __tmp_1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L391] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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 TRUE !(mode1 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L400] COND FALSE !(r1 == 255) [L406] r1 = r1 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L407] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L415] COND TRUE !(ep31 == 0) [L417] m1 = p31_old [L418] p31_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=4, max2=0, 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=0, 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] [L419] COND TRUE ((int)m1) > ((int)max1) [L421] max1 = m1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=0, 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=0, 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] [L423] COND FALSE !(((int)r1) == 2) [L429] mode1 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=0, 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=0, 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] [L431] COND TRUE !(mode2 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=0, 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=0, 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] [L433] COND FALSE !(r2 == 255) [L439] r2 = r2 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=0, m3=0, max1=5, max2=0, 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=0, 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] [L440] COND TRUE !(ep12 == 0) [L442] m2 = p12_old [L443] p12_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=0, 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=0, 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] [L444] COND TRUE ((int)m2) > ((int)max2) [L446] max2 = m2 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L448] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L456] COND FALSE !(((int)r2) == 2) [L462] mode2 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L464] COND TRUE !(mode3 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L466] COND FALSE !(r3 == 255) [L472] r3 = r3 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L473] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=0, 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] [L481] COND TRUE !(ep23 == 0) [L483] m3 = p23_old [L484] p23_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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] [L485] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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] [L489] COND FALSE !(((int)r3) == 2) [L495] mode3 = 0 [L496] p12_old = p12_new [L497] p12_new = nomsg [L498] p13_old = p13_new [L499] p13_new = nomsg [L500] p21_old = p21_new [L501] p21_new = nomsg [L502] p23_old = p23_new [L503] p23_new = nomsg [L504] p31_old = p31_new [L505] p31_new = nomsg [L506] p32_old = p32_new [L507] p32_new = nomsg [L509] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=0, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L514] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L516] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L524] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L526] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L528] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L534] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L536] COND TRUE ((int)r1) < 2 [L538] check__tmp = 1 [L539] __return_1988 = check__tmp [L540] main__c1 = __return_1988 [L542] _Bool __tmp_2; [L543] __tmp_2 = main__c1 [L544] _Bool assert__arg; [L545] assert__arg = __tmp_2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L553] COND FALSE !(!(mode1 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L561] COND TRUE !(ep12 == 0) [L563] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L564] COND TRUE max1 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] COND TRUE p12_new == nomsg [L568] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L570] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L572] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L583] mode1 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L585] COND FALSE !(!(mode2 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L591] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L593] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L604] COND TRUE !(ep23 == 0) [L606] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L607] COND TRUE max2 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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] [L609] COND TRUE p23_new == nomsg [L611] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=4, 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] [L613] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L615] mode2 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L617] COND FALSE !(!(mode3 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L623] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L625] COND TRUE !(ep31 == 0) [L627] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L628] COND TRUE max3 != nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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 p31_new == nomsg [L632] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, 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=5, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L634] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p23_old=-1, p31=0, p31_new=5, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L636] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p23_old=-1, p31=0, p31_new=5, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L647] mode3 = 1 [L648] p12_old = p12_new [L649] p12_new = nomsg [L650] p13_old = p13_new [L651] p13_new = nomsg [L652] p21_old = p21_new [L653] p21_new = nomsg [L654] p23_old = p23_new [L655] p23_new = nomsg [L656] p31_old = p31_new [L657] p31_new = nomsg [L658] p32_old = p32_new [L659] p32_new = nomsg [L661] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=0, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L662] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L664] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L666] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L668] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L670] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L676] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L678] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L680] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L686] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L688] COND TRUE ((int)r1) < 2 [L690] check__tmp = 1 [L691] __return_2106 = check__tmp [L692] main__c1 = __return_2106 [L694] _Bool __tmp_3; [L695] __tmp_3 = main__c1 [L696] _Bool assert__arg; [L697] assert__arg = __tmp_3 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L698] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L705] COND TRUE !(mode1 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L707] COND FALSE !(r1 == 255) [L713] r1 = r1 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L714] COND FALSE !(!(ep21 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L722] COND TRUE !(ep31 == 0) [L724] m1 = p31_old [L725] p31_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L726] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L730] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L732] COND FALSE !(((int)max1) == ((int)id1)) [L1539] st1 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L736] mode1 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L738] COND TRUE !(mode2 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L740] COND FALSE !(r2 == 255) [L746] r2 = r2 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=4, m3=0, max1=5, max2=4, max3=5, 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=4, 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] [L747] COND TRUE !(ep12 == 0) [L749] m2 = p12_old [L750] p12_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=4, 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=4, 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] [L751] COND TRUE ((int)m2) > ((int)max2) [L753] max2 = m2 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, 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=4, 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] [L755] COND FALSE !(!(ep32 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, 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=4, 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] [L763] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, 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=4, 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] [L765] COND FALSE !(((int)max2) == ((int)id2)) [L1501] nl2 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=1, 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=4, 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] [L769] mode2 = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=4, 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] [L771] COND TRUE !(mode3 == 0) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=4, 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] [L773] COND FALSE !(r3 == 255) [L779] r3 = r3 + 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=4, 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=0, st3=0] [L780] COND FALSE !(!(ep13 == 0)) VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=0, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=4, 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=0, st3=0] [L788] COND TRUE !(ep23 == 0) [L790] m3 = p23_old [L791] p23_old = nomsg VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=0, st3=0] [L792] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=0, st3=0] [L796] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=0, st3=0] [L798] COND TRUE ((int)max3) == ((int)id3) [L800] st3 = 1 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, 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=0, st3=1] [L802] mode3 = 0 [L803] p12_old = p12_new [L804] p12_new = nomsg [L805] p13_old = p13_new [L806] p13_new = nomsg [L807] p21_old = p21_new [L808] p21_new = nomsg [L809] p23_old = p23_new [L810] p23_new = nomsg [L811] p31_old = p31_new [L812] p31_new = nomsg [L813] p32_old = p32_new [L814] p32_new = nomsg [L816] int check__tmp; VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L817] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1456] check__tmp = 0 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L845] __return_2235 = check__tmp [L846] main__c1 = __return_2235 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, main__c1=0, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L849] _Bool __tmp_4; [L850] __tmp_4 = main__c1 [L851] _Bool assert__arg; [L852] assert__arg = __tmp_4 VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L853] 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_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L855] reach_error() VAL [__return_1742=1, __return_1870=1, __return_1988=1, __return_2106=1, __return_2235=0, __return_2345=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=0, id3=5, init__r211=0, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 312 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22857 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22857 mSDsluCounter, 49663 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32939 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4263 IncrementalHoareTripleChecker+Invalid, 4751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 16724 mSDtfsCounter, 4263 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75121occurred in iteration=23, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 218599 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 4843 NumberOfCodeBlocks, 4843 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4638 ConstructedInterpolants, 0 QuantifiedInterpolants, 14282 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:28:04,020 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