./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52e3c636591acb857dfd3007f1959b2ca21042f2edf8d723e0b08c805c98fd4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:19:55,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:19:55,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:19:55,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:19:55,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:19:55,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:19:55,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:19:55,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:19:55,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:19:55,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:19:55,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:19:55,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:19:55,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:19:55,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:55,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:19:55,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:19:55,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:19:55,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:19:55,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:19:55,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:19:55,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:19:55,178 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/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 -> 52e3c636591acb857dfd3007f1959b2ca21042f2edf8d723e0b08c805c98fd4a [2025-03-16 19:19:55,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:19:55,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:19:55,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:19:55,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:19:55,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:19:55,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:19:56,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e1744b/7f115264fc11423884e79ec21ab5c002/FLAGa7c7cd7df [2025-03-16 19:19:56,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:19:56,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:19:56,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e1744b/7f115264fc11423884e79ec21ab5c002/FLAGa7c7cd7df [2025-03-16 19:19:56,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7e1744b/7f115264fc11423884e79ec21ab5c002 [2025-03-16 19:19:56,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:19:56,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:19:56,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:56,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:19:56,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:19:56,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:19:56" (1/1) ... [2025-03-16 19:19:56,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b9b2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:56, skipping insertion in model container [2025-03-16 19:19:56,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:19:56" (1/1) ... [2025-03-16 19:19:56,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:19:57,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9821,9834] [2025-03-16 19:19:57,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:57,199 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:19:57,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9821,9834] [2025-03-16 19:19:57,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:57,303 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:19:57,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57 WrapperNode [2025-03-16 19:19:57,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:57,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:57,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:19:57,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:19:57,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,344 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 927 [2025-03-16 19:19:57,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:57,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:19:57,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:19:57,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:19:57,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,380 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-03-16 19:19:57,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:19:57,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:19:57,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:19:57,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:19:57,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (1/1) ... [2025-03-16 19:19:57,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:19:57,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:19:57,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:19:57,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:19:57,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:19:57,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:19:57,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:19:57,530 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:19:57,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:19:58,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L663: havoc main_~check__tmp~2#1; [2025-03-16 19:19:58,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:58,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: 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-03-16 19:19:58,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1039: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:58,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:58,264 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-16 19:19:58,265 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:19:58,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:19:58,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:19:58,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:58 BoogieIcfgContainer [2025-03-16 19:19:58,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:19:58,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:19:58,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:19:58,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:19:58,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:19:56" (1/3) ... [2025-03-16 19:19:58,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64028bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:19:58, skipping insertion in model container [2025-03-16 19:19:58,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:57" (2/3) ... [2025-03-16 19:19:58,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64028bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:19:58, skipping insertion in model container [2025-03-16 19:19:58,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:58" (3/3) ... [2025-03-16 19:19:58,284 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:19:58,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:19:58,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 223 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:19:58,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:19:58,358 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;@29e0e299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:19:58,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:19:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 221 states have (on average 1.7737556561085972) internal successors, (392), 222 states have internal predecessors, (392), 0 states have call successors, (0), 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-03-16 19:19:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:19:58,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,370 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] [2025-03-16 19:19:58,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1866475027, now seen corresponding path program 1 times [2025-03-16 19:19:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102808191] [2025-03-16 19:19:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:19:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:19:58,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102808191] [2025-03-16 19:19:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102808191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:59,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901863476] [2025-03-16 19:19:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:59,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:59,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:59,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:59,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:59,186 INFO L87 Difference]: Start difference. First operand has 223 states, 221 states have (on average 1.7737556561085972) internal successors, (392), 222 states have internal predecessors, (392), 0 states have call successors, (0), 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 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-03-16 19:19:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:59,363 INFO L93 Difference]: Finished difference Result 1062 states and 1875 transitions. [2025-03-16 19:19:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:19:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:59,378 INFO L225 Difference]: With dead ends: 1062 [2025-03-16 19:19:59,380 INFO L226 Difference]: Without dead ends: 839 [2025-03-16 19:19:59,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:19:59,385 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1139 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:59,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1627 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-16 19:19:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 423. [2025-03-16 19:19:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 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-03-16 19:19:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2025-03-16 19:19:59,437 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 94 [2025-03-16 19:19:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2025-03-16 19:19:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-03-16 19:19:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2025-03-16 19:19:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:19:59,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:59,440 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] [2025-03-16 19:19:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:19:59,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:59,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash 208930761, now seen corresponding path program 1 times [2025-03-16 19:19:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49936786] [2025-03-16 19:19:59,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:59,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:19:59,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:19:59,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:59,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49936786] [2025-03-16 19:19:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49936786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:59,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:59,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232635971] [2025-03-16 19:19:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:59,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:59,537 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-03-16 19:19:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:59,564 INFO L93 Difference]: Finished difference Result 821 states and 1202 transitions. [2025-03-16 19:19:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 19:19:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:59,566 INFO L225 Difference]: With dead ends: 821 [2025-03-16 19:19:59,567 INFO L226 Difference]: Without dead ends: 425 [2025-03-16 19:19:59,568 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-03-16 19:19:59,568 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 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-03-16 19:19:59,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-16 19:19:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-16 19:19:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.471698113207547) internal successors, (624), 424 states have internal predecessors, (624), 0 states have call successors, (0), 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-03-16 19:19:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2025-03-16 19:19:59,589 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 95 [2025-03-16 19:19:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2025-03-16 19:19:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-03-16 19:19:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2025-03-16 19:19:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:19:59,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:59,591 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] [2025-03-16 19:19:59,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:19:59,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:59,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash -169616005, now seen corresponding path program 1 times [2025-03-16 19:19:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356577158] [2025-03-16 19:19:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:59,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:19:59,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:19:59,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:59,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356577158] [2025-03-16 19:20:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356577158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551853014] [2025-03-16 19:20:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:00,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:00,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:00,011 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-16 19:20:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:00,035 INFO L93 Difference]: Finished difference Result 841 states and 1235 transitions. [2025-03-16 19:20:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:20:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:00,040 INFO L225 Difference]: With dead ends: 841 [2025-03-16 19:20:00,041 INFO L226 Difference]: Without dead ends: 423 [2025-03-16 19:20:00,042 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-03-16 19:20:00,042 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 24 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1056 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-03-16 19:20:00,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1056 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-16 19:20:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-16 19:20:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4691943127962086) internal successors, (620), 422 states have internal predecessors, (620), 0 states have call successors, (0), 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-03-16 19:20:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 620 transitions. [2025-03-16 19:20:00,060 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 620 transitions. Word has length 96 [2025-03-16 19:20:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:00,060 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 620 transitions. [2025-03-16 19:20:00,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-16 19:20:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 620 transitions. [2025-03-16 19:20:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:20:00,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:00,061 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] [2025-03-16 19:20:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:20:00,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:00,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash -791838346, now seen corresponding path program 1 times [2025-03-16 19:20:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206000476] [2025-03-16 19:20:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:00,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:20:00,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:20:00,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206000476] [2025-03-16 19:20:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206000476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051594321] [2025-03-16 19:20:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:00,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:00,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:00,154 INFO L87 Difference]: Start difference. First operand 423 states and 620 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-16 19:20:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:00,190 INFO L93 Difference]: Finished difference Result 876 states and 1300 transitions. [2025-03-16 19:20:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:00,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:20:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:00,201 INFO L225 Difference]: With dead ends: 876 [2025-03-16 19:20:00,201 INFO L226 Difference]: Without dead ends: 626 [2025-03-16 19:20:00,201 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-03-16 19:20:00,202 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 261 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:00,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 861 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-16 19:20:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-16 19:20:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.4526484751203852) internal successors, (905), 623 states have internal predecessors, (905), 0 states have call successors, (0), 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-03-16 19:20:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 905 transitions. [2025-03-16 19:20:00,216 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 905 transitions. Word has length 96 [2025-03-16 19:20:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:00,216 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 905 transitions. [2025-03-16 19:20:00,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-16 19:20:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 905 transitions. [2025-03-16 19:20:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:20:00,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:00,218 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] [2025-03-16 19:20:00,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:20:00,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 821800311, now seen corresponding path program 1 times [2025-03-16 19:20:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350238227] [2025-03-16 19:20:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:00,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:20:00,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:20:00,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:00,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350238227] [2025-03-16 19:20:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350238227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:00,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:00,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287366284] [2025-03-16 19:20:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:00,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:00,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:00,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:00,444 INFO L87 Difference]: Start difference. First operand 624 states and 905 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:00,487 INFO L93 Difference]: Finished difference Result 1529 states and 2215 transitions. [2025-03-16 19:20:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 19:20:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:00,491 INFO L225 Difference]: With dead ends: 1529 [2025-03-16 19:20:00,491 INFO L226 Difference]: Without dead ends: 941 [2025-03-16 19:20:00,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03-16 19:20:00,492 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 270 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:00,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1118 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-16 19:20:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 939. [2025-03-16 19:20:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.443496801705757) internal successors, (1354), 938 states have internal predecessors, (1354), 0 states have call successors, (0), 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-03-16 19:20:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1354 transitions. [2025-03-16 19:20:00,516 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1354 transitions. Word has length 98 [2025-03-16 19:20:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:00,516 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1354 transitions. [2025-03-16 19:20:00,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1354 transitions. [2025-03-16 19:20:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:20:00,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:00,518 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] [2025-03-16 19:20:00,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:20:00,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash -37543524, now seen corresponding path program 1 times [2025-03-16 19:20:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140580223] [2025-03-16 19:20:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:00,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:20:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:20:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140580223] [2025-03-16 19:20:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140580223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552793555] [2025-03-16 19:20:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:00,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:00,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:00,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:00,810 INFO L87 Difference]: Start difference. First operand 939 states and 1354 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-16 19:20:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:00,833 INFO L93 Difference]: Finished difference Result 1858 states and 2677 transitions. [2025-03-16 19:20:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 19:20:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:00,837 INFO L225 Difference]: With dead ends: 1858 [2025-03-16 19:20:00,837 INFO L226 Difference]: Without dead ends: 939 [2025-03-16 19:20:00,839 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-03-16 19:20:00,841 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 20 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1040 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-03-16 19:20:00,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1040 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-16 19:20:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2025-03-16 19:20:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.4402985074626866) internal successors, (1351), 938 states have internal predecessors, (1351), 0 states have call successors, (0), 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-03-16 19:20:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1351 transitions. [2025-03-16 19:20:00,864 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1351 transitions. Word has length 100 [2025-03-16 19:20:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:00,865 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1351 transitions. [2025-03-16 19:20:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-16 19:20:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1351 transitions. [2025-03-16 19:20:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:20:00,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:00,867 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] [2025-03-16 19:20:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:20:00,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:00,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1388928742, now seen corresponding path program 1 times [2025-03-16 19:20:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401255020] [2025-03-16 19:20:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:00,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:20:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:20:00,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:00,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:00,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-03-16 19:20:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401255020] [2025-03-16 19:20:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401255020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534496337] [2025-03-16 19:20:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:00,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:00,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:00,944 INFO L87 Difference]: Start difference. First operand 939 states and 1351 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-16 19:20:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:00,984 INFO L93 Difference]: Finished difference Result 2044 states and 2979 transitions. [2025-03-16 19:20:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 19:20:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:00,991 INFO L225 Difference]: With dead ends: 2044 [2025-03-16 19:20:00,991 INFO L226 Difference]: Without dead ends: 1435 [2025-03-16 19:20:00,992 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-03-16 19:20:00,993 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 256 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:00,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 885 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-03-16 19:20:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2025-03-16 19:20:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.422486033519553) internal successors, (2037), 1432 states have internal predecessors, (2037), 0 states have call successors, (0), 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-03-16 19:20:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2037 transitions. [2025-03-16 19:20:01,028 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2037 transitions. Word has length 100 [2025-03-16 19:20:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2037 transitions. [2025-03-16 19:20:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-16 19:20:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2037 transitions. [2025-03-16 19:20:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:20:01,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:01,030 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] [2025-03-16 19:20:01,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:20:01,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:01,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -996851096, now seen corresponding path program 1 times [2025-03-16 19:20:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303727129] [2025-03-16 19:20:01,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:01,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:20:01,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:20:01,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:01,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303727129] [2025-03-16 19:20:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303727129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187869580] [2025-03-16 19:20:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:01,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:01,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:01,245 INFO L87 Difference]: Start difference. First operand 1433 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-03-16 19:20:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:01,312 INFO L93 Difference]: Finished difference Result 5358 states and 7593 transitions. [2025-03-16 19:20:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 19:20:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:01,324 INFO L225 Difference]: With dead ends: 5358 [2025-03-16 19:20:01,324 INFO L226 Difference]: Without dead ends: 3989 [2025-03-16 19:20:01,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03-16 19:20:01,327 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 586 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:01,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1085 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2025-03-16 19:20:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 2715. [2025-03-16 19:20:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.4082535003684598) internal successors, (3822), 2714 states have internal predecessors, (3822), 0 states have call successors, (0), 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-03-16 19:20:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3822 transitions. [2025-03-16 19:20:01,390 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3822 transitions. Word has length 102 [2025-03-16 19:20:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:01,390 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3822 transitions. [2025-03-16 19:20:01,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-03-16 19:20:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3822 transitions. [2025-03-16 19:20:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:20:01,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:01,393 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] [2025-03-16 19:20:01,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:20:01,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:01,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 372099438, now seen corresponding path program 1 times [2025-03-16 19:20:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908975835] [2025-03-16 19:20:01,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:20:01,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:20:01,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:01,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908975835] [2025-03-16 19:20:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908975835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:01,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:01,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312718236] [2025-03-16 19:20:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:01,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:01,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:01,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:01,441 INFO L87 Difference]: Start difference. First operand 2715 states and 3822 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-03-16 19:20:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:01,472 INFO L93 Difference]: Finished difference Result 5321 states and 7493 transitions. [2025-03-16 19:20:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 19:20:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:01,480 INFO L225 Difference]: With dead ends: 5321 [2025-03-16 19:20:01,480 INFO L226 Difference]: Without dead ends: 2723 [2025-03-16 19:20:01,483 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-03-16 19:20:01,483 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 642 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-03-16 19:20:01,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 642 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2025-03-16 19:20:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2723. [2025-03-16 19:20:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2722 states have (on average 1.4070536370315945) internal successors, (3830), 2722 states have internal predecessors, (3830), 0 states have call successors, (0), 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-03-16 19:20:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3830 transitions. [2025-03-16 19:20:01,550 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3830 transitions. Word has length 103 [2025-03-16 19:20:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3830 transitions. [2025-03-16 19:20:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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-03-16 19:20:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3830 transitions. [2025-03-16 19:20:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:20:01,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:01,554 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] [2025-03-16 19:20:01,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:20:01,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2125656112, now seen corresponding path program 1 times [2025-03-16 19:20:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687768390] [2025-03-16 19:20:01,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:01,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:20:01,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:20:01,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:01,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687768390] [2025-03-16 19:20:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687768390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:01,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:01,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596664051] [2025-03-16 19:20:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:01,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:01,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:01,751 INFO L87 Difference]: Start difference. First operand 2723 states and 3830 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-16 19:20:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:01,782 INFO L93 Difference]: Finished difference Result 5398 states and 7589 transitions. [2025-03-16 19:20:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:01,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:20:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:01,790 INFO L225 Difference]: With dead ends: 5398 [2025-03-16 19:20:01,790 INFO L226 Difference]: Without dead ends: 2715 [2025-03-16 19:20:01,793 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-03-16 19:20:01,793 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 14 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1022 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-03-16 19:20:01,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1022 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-16 19:20:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2025-03-16 19:20:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.4053058216654384) internal successors, (3814), 2714 states have internal predecessors, (3814), 0 states have call successors, (0), 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-03-16 19:20:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3814 transitions. [2025-03-16 19:20:01,862 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3814 transitions. Word has length 104 [2025-03-16 19:20:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3814 transitions. [2025-03-16 19:20:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-16 19:20:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3814 transitions. [2025-03-16 19:20:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:20:01,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:01,865 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] [2025-03-16 19:20:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:20:01,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -964805045, now seen corresponding path program 1 times [2025-03-16 19:20:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514449361] [2025-03-16 19:20:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:01,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:20:01,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:20:01,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:01,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514449361] [2025-03-16 19:20:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514449361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:01,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:01,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839221592] [2025-03-16 19:20:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:01,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:01,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:01,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:01,927 INFO L87 Difference]: Start difference. First operand 2715 states and 3814 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-16 19:20:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:01,971 INFO L93 Difference]: Finished difference Result 5952 states and 8460 transitions. [2025-03-16 19:20:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:20:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:01,984 INFO L225 Difference]: With dead ends: 5952 [2025-03-16 19:20:01,984 INFO L226 Difference]: Without dead ends: 4032 [2025-03-16 19:20:01,987 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-03-16 19:20:01,988 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 246 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:01,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 868 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2025-03-16 19:20:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4030. [2025-03-16 19:20:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4029 states have (on average 1.3819806403574089) internal successors, (5568), 4029 states have internal predecessors, (5568), 0 states have call successors, (0), 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-03-16 19:20:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5568 transitions. [2025-03-16 19:20:02,075 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5568 transitions. Word has length 104 [2025-03-16 19:20:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:02,075 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5568 transitions. [2025-03-16 19:20:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-16 19:20:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5568 transitions. [2025-03-16 19:20:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:20:02,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:02,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] [2025-03-16 19:20:02,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:20:02,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 15323524, now seen corresponding path program 1 times [2025-03-16 19:20:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551922805] [2025-03-16 19:20:02,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:02,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:20:02,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:20:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551922805] [2025-03-16 19:20:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551922805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:02,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:20:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88899474] [2025-03-16 19:20:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:02,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:20:02,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:02,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:20:02,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:20:02,434 INFO L87 Difference]: Start difference. First operand 4030 states and 5568 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:02,573 INFO L93 Difference]: Finished difference Result 8722 states and 12654 transitions. [2025-03-16 19:20:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:02,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 19:20:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:02,592 INFO L225 Difference]: With dead ends: 8722 [2025-03-16 19:20:02,595 INFO L226 Difference]: Without dead ends: 6412 [2025-03-16 19:20:02,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:20:02,601 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1809 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:02,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 781 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2025-03-16 19:20:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6410. [2025-03-16 19:20:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6410 states, 6409 states have (on average 1.422686846621938) internal successors, (9118), 6409 states have internal predecessors, (9118), 0 states have call successors, (0), 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-03-16 19:20:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 9118 transitions. [2025-03-16 19:20:02,742 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 9118 transitions. Word has length 106 [2025-03-16 19:20:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:02,742 INFO L471 AbstractCegarLoop]: Abstraction has 6410 states and 9118 transitions. [2025-03-16 19:20:02,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 9118 transitions. [2025-03-16 19:20:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:20:02,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:02,749 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] [2025-03-16 19:20:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:20:02,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash -118689982, now seen corresponding path program 1 times [2025-03-16 19:20:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262941177] [2025-03-16 19:20:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:20:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:20:02,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262941177] [2025-03-16 19:20:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262941177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:20:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409276187] [2025-03-16 19:20:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:02,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:02,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:02,924 INFO L87 Difference]: Start difference. First operand 6410 states and 9118 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:03,077 INFO L93 Difference]: Finished difference Result 13414 states and 20304 transitions. [2025-03-16 19:20:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 19:20:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:03,095 INFO L225 Difference]: With dead ends: 13414 [2025-03-16 19:20:03,095 INFO L226 Difference]: Without dead ends: 9912 [2025-03-16 19:20:03,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:20:03,101 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 375 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:03,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 849 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9912 states. [2025-03-16 19:20:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9912 to 9910. [2025-03-16 19:20:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9910 states, 9909 states have (on average 1.4675547482086992) internal successors, (14542), 9909 states have internal predecessors, (14542), 0 states have call successors, (0), 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-03-16 19:20:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9910 states to 9910 states and 14542 transitions. [2025-03-16 19:20:03,262 INFO L78 Accepts]: Start accepts. Automaton has 9910 states and 14542 transitions. Word has length 106 [2025-03-16 19:20:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 9910 states and 14542 transitions. [2025-03-16 19:20:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9910 states and 14542 transitions. [2025-03-16 19:20:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:20:03,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:03,267 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] [2025-03-16 19:20:03,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:20:03,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:03,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1938551558, now seen corresponding path program 1 times [2025-03-16 19:20:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:03,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254497630] [2025-03-16 19:20:03,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:03,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:20:03,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:20:03,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:03,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254497630] [2025-03-16 19:20:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254497630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:03,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:03,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506399396] [2025-03-16 19:20:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:03,490 INFO L87 Difference]: Start difference. First operand 9910 states and 14542 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:03,566 INFO L93 Difference]: Finished difference Result 18520 states and 27180 transitions. [2025-03-16 19:20:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 19:20:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:03,581 INFO L225 Difference]: With dead ends: 18520 [2025-03-16 19:20:03,581 INFO L226 Difference]: Without dead ends: 8879 [2025-03-16 19:20:03,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:20:03,591 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 259 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:03,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1285 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8879 states. [2025-03-16 19:20:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8879 to 8696. [2025-03-16 19:20:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8696 states, 8695 states have (on average 1.4655549166187465) internal successors, (12743), 8695 states have internal predecessors, (12743), 0 states have call successors, (0), 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-03-16 19:20:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 12743 transitions. [2025-03-16 19:20:03,714 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 12743 transitions. Word has length 106 [2025-03-16 19:20:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:03,715 INFO L471 AbstractCegarLoop]: Abstraction has 8696 states and 12743 transitions. [2025-03-16 19:20:03,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-16 19:20:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 12743 transitions. [2025-03-16 19:20:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:20:03,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:03,719 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] [2025-03-16 19:20:03,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:20:03,720 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -177348684, now seen corresponding path program 1 times [2025-03-16 19:20:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301423437] [2025-03-16 19:20:03,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:03,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:20:03,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:20:03,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:03,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:03,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301423437] [2025-03-16 19:20:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301423437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:03,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035088923] [2025-03-16 19:20:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:03,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:03,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:03,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:03,769 INFO L87 Difference]: Start difference. First operand 8696 states and 12743 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:03,805 INFO L93 Difference]: Finished difference Result 16433 states and 24241 transitions. [2025-03-16 19:20:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:20:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:03,825 INFO L225 Difference]: With dead ends: 16433 [2025-03-16 19:20:03,826 INFO L226 Difference]: Without dead ends: 11769 [2025-03-16 19:20:03,834 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-03-16 19:20:03,834 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 291 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:03,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11769 states. [2025-03-16 19:20:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11769 to 8696. [2025-03-16 19:20:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8696 states, 8695 states have (on average 1.4653248993674526) internal successors, (12741), 8695 states have internal predecessors, (12741), 0 states have call successors, (0), 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-03-16 19:20:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 12741 transitions. [2025-03-16 19:20:04,004 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 12741 transitions. Word has length 107 [2025-03-16 19:20:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:04,005 INFO L471 AbstractCegarLoop]: Abstraction has 8696 states and 12741 transitions. [2025-03-16 19:20:04,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 12741 transitions. [2025-03-16 19:20:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:20:04,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:04,008 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] [2025-03-16 19:20:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:20:04,009 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:04,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash -805479922, now seen corresponding path program 1 times [2025-03-16 19:20:04,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:04,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451315438] [2025-03-16 19:20:04,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:04,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:20:04,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:20:04,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:04,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451315438] [2025-03-16 19:20:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451315438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:04,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107666331] [2025-03-16 19:20:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:04,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:04,219 INFO L87 Difference]: Start difference. First operand 8696 states and 12741 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:04,299 INFO L93 Difference]: Finished difference Result 17990 states and 26528 transitions. [2025-03-16 19:20:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:20:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:04,320 INFO L225 Difference]: With dead ends: 17990 [2025-03-16 19:20:04,320 INFO L226 Difference]: Without dead ends: 12273 [2025-03-16 19:20:04,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03-16 19:20:04,331 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 518 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:04,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1037 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2025-03-16 19:20:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 8824. [2025-03-16 19:20:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8824 states, 8823 states have (on average 1.4611810041935849) internal successors, (12892), 8823 states have internal predecessors, (12892), 0 states have call successors, (0), 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-03-16 19:20:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 12892 transitions. [2025-03-16 19:20:04,526 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 12892 transitions. Word has length 108 [2025-03-16 19:20:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 8824 states and 12892 transitions. [2025-03-16 19:20:04,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 12892 transitions. [2025-03-16 19:20:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:20:04,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:04,532 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] [2025-03-16 19:20:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:20:04,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -193168258, now seen corresponding path program 1 times [2025-03-16 19:20:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750772406] [2025-03-16 19:20:04,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:04,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:20:04,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:20:04,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:04,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:04,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750772406] [2025-03-16 19:20:04,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750772406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:04,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:04,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:04,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048720742] [2025-03-16 19:20:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:04,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:04,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:04,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:04,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:04,590 INFO L87 Difference]: Start difference. First operand 8824 states and 12892 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:04,633 INFO L93 Difference]: Finished difference Result 17192 states and 25236 transitions. [2025-03-16 19:20:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:20:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:04,647 INFO L225 Difference]: With dead ends: 17192 [2025-03-16 19:20:04,647 INFO L226 Difference]: Without dead ends: 8844 [2025-03-16 19:20:04,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:04,658 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 634 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-03-16 19:20:04,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8844 states. [2025-03-16 19:20:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8844 to 8844. [2025-03-16 19:20:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8844 states, 8843 states have (on average 1.4601379622300124) internal successors, (12912), 8843 states have internal predecessors, (12912), 0 states have call successors, (0), 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-03-16 19:20:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 12912 transitions. [2025-03-16 19:20:04,803 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 12912 transitions. Word has length 109 [2025-03-16 19:20:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:04,803 INFO L471 AbstractCegarLoop]: Abstraction has 8844 states and 12912 transitions. [2025-03-16 19:20:04,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 12912 transitions. [2025-03-16 19:20:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:20:04,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:04,808 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] [2025-03-16 19:20:04,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:20:04,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:04,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -376925002, now seen corresponding path program 1 times [2025-03-16 19:20:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736261473] [2025-03-16 19:20:04,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:04,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:20:04,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:20:04,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:04,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736261473] [2025-03-16 19:20:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736261473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302011972] [2025-03-16 19:20:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:05,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:05,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:05,019 INFO L87 Difference]: Start difference. First operand 8844 states and 12912 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:05,059 INFO L93 Difference]: Finished difference Result 17550 states and 25635 transitions. [2025-03-16 19:20:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:20:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:05,072 INFO L225 Difference]: With dead ends: 17550 [2025-03-16 19:20:05,072 INFO L226 Difference]: Without dead ends: 8824 [2025-03-16 19:20:05,080 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-03-16 19:20:05,081 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 4 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 988 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-03-16 19:20:05,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 988 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8824 states. [2025-03-16 19:20:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8824 to 8824. [2025-03-16 19:20:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8824 states, 8823 states have (on average 1.459594242321206) internal successors, (12878), 8823 states have internal predecessors, (12878), 0 states have call successors, (0), 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-03-16 19:20:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 12878 transitions. [2025-03-16 19:20:05,188 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 12878 transitions. Word has length 110 [2025-03-16 19:20:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:05,188 INFO L471 AbstractCegarLoop]: Abstraction has 8824 states and 12878 transitions. [2025-03-16 19:20:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 12878 transitions. [2025-03-16 19:20:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:20:05,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:05,193 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] [2025-03-16 19:20:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:20:05,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:05,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash 783926065, now seen corresponding path program 1 times [2025-03-16 19:20:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:05,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911516949] [2025-03-16 19:20:05,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:05,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:20:05,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:20:05,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911516949] [2025-03-16 19:20:05,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911516949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:05,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:05,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638270717] [2025-03-16 19:20:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:05,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:20:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:05,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:20:05,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:05,370 INFO L87 Difference]: Start difference. First operand 8824 states and 12878 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:05,431 INFO L93 Difference]: Finished difference Result 16592 states and 24138 transitions. [2025-03-16 19:20:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:20:05,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:20:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:05,445 INFO L225 Difference]: With dead ends: 16592 [2025-03-16 19:20:05,445 INFO L226 Difference]: Without dead ends: 8044 [2025-03-16 19:20:05,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:20:05,453 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 276 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:05,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1223 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8044 states. [2025-03-16 19:20:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8044 to 7803. [2025-03-16 19:20:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 7802 states have (on average 1.447577544219431) internal successors, (11294), 7802 states have internal predecessors, (11294), 0 states have call successors, (0), 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-03-16 19:20:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 11294 transitions. [2025-03-16 19:20:05,592 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 11294 transitions. Word has length 110 [2025-03-16 19:20:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:05,592 INFO L471 AbstractCegarLoop]: Abstraction has 7803 states and 11294 transitions. [2025-03-16 19:20:05,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 11294 transitions. [2025-03-16 19:20:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:20:05,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:05,596 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] [2025-03-16 19:20:05,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:20:05,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:05,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash 257174412, now seen corresponding path program 1 times [2025-03-16 19:20:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:05,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63013362] [2025-03-16 19:20:05,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:05,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:20:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:20:05,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:05,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63013362] [2025-03-16 19:20:05,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63013362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:05,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964198893] [2025-03-16 19:20:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:05,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:05,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:05,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:05,654 INFO L87 Difference]: Start difference. First operand 7803 states and 11294 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-03-16 19:20:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:05,687 INFO L93 Difference]: Finished difference Result 14684 states and 21394 transitions. [2025-03-16 19:20:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:20:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:05,703 INFO L225 Difference]: With dead ends: 14684 [2025-03-16 19:20:05,704 INFO L226 Difference]: Without dead ends: 10671 [2025-03-16 19:20:05,710 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-03-16 19:20:05,712 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 278 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:05,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 825 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2025-03-16 19:20:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 7803. [2025-03-16 19:20:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 7802 states have (on average 1.44693668290182) internal successors, (11289), 7802 states have internal predecessors, (11289), 0 states have call successors, (0), 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-03-16 19:20:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 11289 transitions. [2025-03-16 19:20:05,824 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 11289 transitions. Word has length 111 [2025-03-16 19:20:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:05,824 INFO L471 AbstractCegarLoop]: Abstraction has 7803 states and 11289 transitions. [2025-03-16 19:20:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-03-16 19:20:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 11289 transitions. [2025-03-16 19:20:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:20:05,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:05,828 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] [2025-03-16 19:20:05,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:20:05,828 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:05,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1844863357, now seen corresponding path program 1 times [2025-03-16 19:20:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163224085] [2025-03-16 19:20:05,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:20:05,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:20:05,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:20:05,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 19:20:05,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:20:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:20:05,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:20:05,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 19:20:05,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 19:20:05,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 19:20:05,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:20:05,952 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] [2025-03-16 19:20:06,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:20:06,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:20:06 BoogieIcfgContainer [2025-03-16 19:20:06,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:20:06,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:20:06,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:20:06,069 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:20:06,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:58" (3/4) ... [2025-03-16 19:20:06,071 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 19:20:06,228 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 96. [2025-03-16 19:20:06,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:20:06,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:20:06,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:20:06,308 INFO L158 Benchmark]: Toolchain (without parser) took 9417.85ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 104.5MB in the beginning and 263.6MB in the end (delta: -159.1MB). Peak memory consumption was 311.7MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,308 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:20:06,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 82.3MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 76.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:20:06,308 INFO L158 Benchmark]: Boogie Preprocessor took 53.04ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 73.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,309 INFO L158 Benchmark]: IcfgBuilder took 878.08ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 68.3MB in the end (delta: 5.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,309 INFO L158 Benchmark]: TraceAbstraction took 7790.05ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 67.6MB in the beginning and 305.5MB in the end (delta: -238.0MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,309 INFO L158 Benchmark]: Witness Printer took 238.26ms. Allocated memory is still 612.4MB. Free memory was 305.5MB in the beginning and 263.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 19:20:06,310 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.45ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 82.3MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 76.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.04ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 73.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 878.08ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 68.3MB in the end (delta: 5.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7790.05ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 67.6MB in the beginning and 305.5MB in the end (delta: -238.0MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB. * Witness Printer took 238.26ms. Allocated memory is still 612.4MB. Free memory was 305.5MB in the beginning and 263.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. 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: 550]: 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_1142; [L80] int __return_1270; [L81] int __return_1389; [L82] int __return_1499; [L85] int main__c1; [L86] int main__i2; [L87] main__c1 = 0 [L88] ep12 = __VERIFIER_nondet_bool() [L89] ep13 = __VERIFIER_nondet_bool() [L90] ep21 = __VERIFIER_nondet_bool() [L91] ep23 = __VERIFIER_nondet_bool() [L92] ep31 = __VERIFIER_nondet_bool() [L93] ep32 = __VERIFIER_nondet_bool() [L94] id1 = __VERIFIER_nondet_char() [L95] r1 = __VERIFIER_nondet_uchar() [L96] st1 = __VERIFIER_nondet_char() [L97] nl1 = __VERIFIER_nondet_char() [L98] m1 = __VERIFIER_nondet_char() [L99] max1 = __VERIFIER_nondet_char() [L100] mode1 = __VERIFIER_nondet_bool() [L101] id2 = __VERIFIER_nondet_char() [L102] r2 = __VERIFIER_nondet_uchar() [L103] st2 = __VERIFIER_nondet_char() [L104] nl2 = __VERIFIER_nondet_char() [L105] m2 = __VERIFIER_nondet_char() [L106] max2 = __VERIFIER_nondet_char() [L107] mode2 = __VERIFIER_nondet_bool() [L108] id3 = __VERIFIER_nondet_char() [L109] r3 = __VERIFIER_nondet_uchar() [L110] st3 = __VERIFIER_nondet_char() [L111] nl3 = __VERIFIER_nondet_char() [L112] m3 = __VERIFIER_nondet_char() [L113] max3 = __VERIFIER_nondet_char() [L114] mode3 = __VERIFIER_nondet_bool() [L116] _Bool init__r121; [L117] _Bool init__r131; [L118] _Bool init__r211; [L119] _Bool init__r231; [L120] _Bool init__r311; [L121] _Bool init__r321; [L122] _Bool init__r122; [L123] int init__tmp; [L124] _Bool init__r132; [L125] int init__tmp___0; [L126] _Bool init__r212; [L127] int init__tmp___1; [L128] _Bool init__r232; [L129] int init__tmp___2; [L130] _Bool init__r312; [L131] int init__tmp___3; [L132] _Bool init__r322; [L133] int init__tmp___4; [L134] int init__tmp___5; [L135] init__r121 = ep12 [L136] init__r131 = ep13 [L137] init__r211 = ep21 [L138] init__r231 = ep23 [L139] init__r311 = ep31 [L140] init__r321 = ep32 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L141] COND TRUE !(init__r121 == 0) [L143] init__tmp = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L145] init__r122 = (_Bool)init__tmp VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L146] COND FALSE !(!(init__r131 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L1626] COND TRUE !(init__r121 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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] [L1628] COND TRUE !(ep23 == 0) [L1630] init__tmp___0 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L150] init__r132 = (_Bool)init__tmp___0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L151] COND FALSE !(!(init__r211 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L1603] COND TRUE !(init__r231 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L1605] COND TRUE !(ep31 == 0) [L1607] init__tmp___1 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L155] init__r212 = (_Bool)init__tmp___1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L156] COND TRUE !(init__r231 == 0) [L158] init__tmp___2 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L160] init__r232 = (_Bool)init__tmp___2 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L161] COND TRUE !(init__r311 == 0) [L163] init__tmp___3 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L165] init__r312 = (_Bool)init__tmp___3 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L166] COND FALSE !(!(init__r321 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L1534] COND TRUE !(init__r311 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L1536] COND TRUE !(ep12 == 0) [L1538] init__tmp___4 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L170] init__r322 = (_Bool)init__tmp___4 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L171] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)id2) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)id1) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)id2) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)id3) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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)r1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L185] COND TRUE ((int)r2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L187] COND TRUE ((int)r3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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] [L189] COND TRUE !(init__r122 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, 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=127, max2=126, max3=125, 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__r132 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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__r212 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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__r232 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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__r312 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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__r322 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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 ((int)max1) == ((int)id1) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)max2) == ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)max3) == ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)st1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)st2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)st3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)nl1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)nl2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)nl3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)mode1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)mode2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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)mode3) == 0 [L225] init__tmp___5 = 1 [L226] __return_1142 = init__tmp___5 [L227] main__i2 = __return_1142 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE main__i2 != 0 [L230] p12_old = nomsg [L231] p12_new = nomsg [L232] p13_old = nomsg [L233] p13_new = nomsg [L234] p21_old = nomsg [L235] p21_new = nomsg [L236] p23_old = nomsg [L237] p23_new = nomsg [L238] p31_old = nomsg [L239] p31_new = nomsg [L240] p32_old = nomsg [L241] p32_new = nomsg [L242] main__i2 = 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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 !(ep12 == 0) [L254] int node1____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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] [L255] COND TRUE max1 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, 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 p12_new == nomsg [L259] node1____CPAchecker_TMP_0 = max1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L274] mode1 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] COND FALSE !(!(mode2 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L282] COND TRUE ((int)r2) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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 FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L295] COND TRUE !(ep23 == 0) [L297] int node2____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L298] COND TRUE max2 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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 p23_new == nomsg [L302] node2____CPAchecker_TMP_1 = max2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=126, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] mode2 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] COND FALSE !(!(mode3 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L314] COND TRUE ((int)r3) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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 !(ep31 == 0) [L318] int node3____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L319] COND TRUE max3 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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 p31_new == nomsg [L323] node3____CPAchecker_TMP_0 = max3 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=125, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L325] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=125, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L327] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=125, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L338] mode3 = 1 [L339] p12_old = p12_new [L340] p12_new = nomsg [L341] p13_old = p13_new [L342] p13_new = nomsg [L343] p21_old = p21_new [L344] p21_new = nomsg [L345] p23_old = p23_new [L346] p23_new = nomsg [L347] p31_old = p31_new [L348] p31_new = nomsg [L349] p32_old = p32_new [L350] p32_new = nomsg [L352] int check__tmp; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, 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)nl1)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L367] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L379] COND TRUE ((int)r1) < 2 [L381] check__tmp = 1 [L382] __return_1270 = check__tmp [L383] main__c1 = __return_1270 [L385] _Bool __tmp_1; [L386] __tmp_1 = main__c1 [L387] _Bool assert__arg; [L388] assert__arg = __tmp_1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND FALSE !(assert__arg == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE !(mode1 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND FALSE !(r1 == 255) [L404] r1 = r1 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE !(ep31 == 0) [L415] m1 = p31_old [L416] p31_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, 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] [L417] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, 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] [L421] COND TRUE ((int)r1) == 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, 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 TRUE ((int)max1) == ((int)id1) [L425] st1 = 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L427] mode1 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L429] COND TRUE !(mode2 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L431] COND FALSE !(r2 == 255) [L437] r2 = r2 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=0, m3=0, max1=127, max2=126, max3=125, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L438] COND TRUE !(ep12 == 0) [L440] m2 = p12_old [L441] p12_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=126, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L442] COND TRUE ((int)m2) > ((int)max2) [L444] max2 = m2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L446] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(((int)r2) == 2) [L460] mode2 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L462] COND TRUE !(mode3 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L464] COND FALSE !(r3 == 255) [L470] r3 = r3 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L471] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=0, max1=127, max2=127, max3=125, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L479] COND TRUE !(ep23 == 0) [L481] m3 = p23_old [L482] p23_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=125, 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=1, st2=0, st3=0] [L483] COND TRUE ((int)m3) > ((int)max3) [L485] max3 = m3 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L487] COND FALSE !(((int)r3) == 2) [L493] mode3 = 0 [L494] p12_old = p12_new [L495] p12_new = nomsg [L496] p13_old = p13_new [L497] p13_new = nomsg [L498] p21_old = p21_new [L499] p21_new = nomsg [L500] p23_old = p23_new [L501] p23_new = nomsg [L502] p31_old = p31_new [L503] p31_new = nomsg [L504] p32_old = p32_new [L505] p32_new = nomsg [L507] int check__tmp; VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L508] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L510] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L512] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L514] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L516] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L522] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1104] check__tmp = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L540] __return_1389 = check__tmp [L541] main__c1 = __return_1389 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, main__c1=0, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L544] _Bool __tmp_2; [L545] __tmp_2 = main__c1 [L546] _Bool assert__arg; [L547] assert__arg = __tmp_2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L548] COND TRUE assert__arg == 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] [L550] reach_error() VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=125, init__r211=0, m1=125, m2=127, m3=126, max1=127, max2=127, max3=126, 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=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 223 locations, 392 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6626 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6626 mSDsluCounter, 19150 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10190 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 8960 mSDtfsCounter, 396 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9910occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 11516 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2177 NumberOfCodeBlocks, 2177 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2045 ConstructedInterpolants, 0 QuantifiedInterpolants, 6246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-03-16 19:20:06,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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