./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd --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 a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:58:39,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:58:39,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:58:39,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:58:39,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:58:39,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:58:39,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:58:39,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:58:39,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:58:39,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:58:39,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:58:39,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:58:39,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:58:39,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:58:39,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:58:39,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:58:39,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:58:39,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:58:39,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:58:39,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:58:39,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:58:39,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:58:39,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:58:39,399 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd 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 -> a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 [2024-11-13 12:58:39,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:58:39,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:58:39,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:58:39,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:58:39,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:58:39,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c Unable to find full path for "g++" [2024-11-13 12:58:41,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:58:42,078 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:58:42,079 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-13 12:58:42,092 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/data/378cdf782/ef1c027c6370446d8727b5db8d2accc9/FLAGec913f7ff [2024-11-13 12:58:42,109 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/data/378cdf782/ef1c027c6370446d8727b5db8d2accc9 [2024-11-13 12:58:42,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:58:42,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:58:42,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:58:42,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:58:42,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:58:42,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff50af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42, skipping insertion in model container [2024-11-13 12:58:42,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:58:42,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-11-13 12:58:42,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:58:42,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:58:42,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2024-11-13 12:58:42,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:58:42,663 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:58:42,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42 WrapperNode [2024-11-13 12:58:42,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:58:42,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:58:42,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:58:42,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:58:42,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,762 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2024-11-13 12:58:42,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:58:42,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:58:42,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:58:42,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:58:42,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,815 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:58:42,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:58:42,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:58:42,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:58:42,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:58:42,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (1/1) ... [2024-11-13 12:58:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:58:42,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:42,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:42,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:58:42,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:58:42,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:58:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:58:42,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:58:43,125 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:58:43,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:58:44,324 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-13 12:58:44,324 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:58:44,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:58:44,345 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:58:44,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:44 BoogieIcfgContainer [2024-11-13 12:58:44,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:58:44,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:58:44,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:58:44,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:58:44,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:58:42" (1/3) ... [2024-11-13 12:58:44,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23701a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:58:44, skipping insertion in model container [2024-11-13 12:58:44,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:42" (2/3) ... [2024-11-13 12:58:44,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23701a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:58:44, skipping insertion in model container [2024-11-13 12:58:44,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:44" (3/3) ... [2024-11-13 12:58:44,362 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-13 12:58:44,379 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:58:44,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 241 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 12:58:44,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:58:44,520 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;@bff11cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:58:44,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:58:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 12:58:44,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:44,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:44,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2024-11-13 12:58:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049303097] [2024-11-13 12:58:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049303097] [2024-11-13 12:58:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049303097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250568280] [2024-11-13 12:58:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:45,278 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.7656903765690377) internal successors, (422), 240 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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) [2024-11-13 12:58:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:45,483 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2024-11-13 12:58:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:45,489 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 [2024-11-13 12:58:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:45,507 INFO L225 Difference]: With dead ends: 482 [2024-11-13 12:58:45,507 INFO L226 Difference]: Without dead ends: 358 [2024-11-13 12:58:45,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:45,517 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 291 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:45,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 659 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-13 12:58:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2024-11-13 12:58:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.5295774647887324) internal successors, (543), 355 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2024-11-13 12:58:45,575 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2024-11-13 12:58:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2024-11-13 12:58:45,576 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) [2024-11-13 12:58:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2024-11-13 12:58:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 12:58:45,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:45,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:45,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:58:45,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:45,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2024-11-13 12:58:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137546885] [2024-11-13 12:58:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137546885] [2024-11-13 12:58:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137546885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711791162] [2024-11-13 12:58:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:46,420 INFO L87 Difference]: Start difference. First operand 356 states and 543 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) [2024-11-13 12:58:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:46,578 INFO L93 Difference]: Finished difference Result 1346 states and 2040 transitions. [2024-11-13 12:58:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:46,580 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 [2024-11-13 12:58:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:46,586 INFO L225 Difference]: With dead ends: 1346 [2024-11-13 12:58:46,586 INFO L226 Difference]: Without dead ends: 1015 [2024-11-13 12:58:46,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:46,593 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 615 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:46,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-13 12:58:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 685. [2024-11-13 12:58:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.513157894736842) internal successors, (1035), 684 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1035 transitions. [2024-11-13 12:58:46,658 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1035 transitions. Word has length 100 [2024-11-13 12:58:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:46,659 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1035 transitions. [2024-11-13 12:58:46,659 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) [2024-11-13 12:58:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1035 transitions. [2024-11-13 12:58:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 12:58:46,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:46,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:58:46,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2024-11-13 12:58:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925643531] [2024-11-13 12:58:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925643531] [2024-11-13 12:58:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925643531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:46,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999246234] [2024-11-13 12:58:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:46,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:46,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:46,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:46,813 INFO L87 Difference]: Start difference. First operand 685 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:46,864 INFO L93 Difference]: Finished difference Result 1344 states and 2026 transitions. [2024-11-13 12:58:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:46,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-13 12:58:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:46,868 INFO L225 Difference]: With dead ends: 1344 [2024-11-13 12:58:46,868 INFO L226 Difference]: Without dead ends: 687 [2024-11-13 12:58:46,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:46,873 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:46,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-13 12:58:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2024-11-13 12:58:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.5116618075801749) internal successors, (1037), 686 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1037 transitions. [2024-11-13 12:58:46,917 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1037 transitions. Word has length 101 [2024-11-13 12:58:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1037 transitions. [2024-11-13 12:58:46,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1037 transitions. [2024-11-13 12:58:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:58:46,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:46,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:58:46,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:46,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2024-11-13 12:58:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445290637] [2024-11-13 12:58:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445290637] [2024-11-13 12:58:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445290637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300603035] [2024-11-13 12:58:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:47,139 INFO L87 Difference]: Start difference. First operand 687 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 34.0) 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) [2024-11-13 12:58:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:47,235 INFO L93 Difference]: Finished difference Result 1818 states and 2762 transitions. [2024-11-13 12:58:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) 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 [2024-11-13 12:58:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:47,243 INFO L225 Difference]: With dead ends: 1818 [2024-11-13 12:58:47,244 INFO L226 Difference]: Without dead ends: 1326 [2024-11-13 12:58:47,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:47,246 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 282 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:47,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 992 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-13 12:58:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2024-11-13 12:58:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.4965986394557824) internal successors, (1980), 1323 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1980 transitions. [2024-11-13 12:58:47,319 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1980 transitions. Word has length 102 [2024-11-13 12:58:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:47,320 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1980 transitions. [2024-11-13 12:58:47,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) 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) [2024-11-13 12:58:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1980 transitions. [2024-11-13 12:58:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:58:47,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:47,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:47,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:58:47,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:47,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2024-11-13 12:58:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:47,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081722202] [2024-11-13 12:58:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:47,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081722202] [2024-11-13 12:58:47,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081722202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:47,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214253500] [2024-11-13 12:58:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:47,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:47,970 INFO L87 Difference]: Start difference. First operand 1324 states and 1980 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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) [2024-11-13 12:58:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:48,028 INFO L93 Difference]: Finished difference Result 2153 states and 3240 transitions. [2024-11-13 12:58:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 [2024-11-13 12:58:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:48,035 INFO L225 Difference]: With dead ends: 2153 [2024-11-13 12:58:48,036 INFO L226 Difference]: Without dead ends: 1012 [2024-11-13 12:58:48,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:48,040 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 25 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:48,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-13 12:58:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-11-13 12:58:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4915924826904055) internal successors, (1508), 1011 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1508 transitions. [2024-11-13 12:58:48,080 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1508 transitions. Word has length 102 [2024-11-13 12:58:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:48,080 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1508 transitions. [2024-11-13 12:58:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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) [2024-11-13 12:58:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1508 transitions. [2024-11-13 12:58:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:58:48,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:48,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:48,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:58:48,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1659633849, now seen corresponding path program 1 times [2024-11-13 12:58:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549757646] [2024-11-13 12:58:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:48,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549757646] [2024-11-13 12:58:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549757646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79734489] [2024-11-13 12:58:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:48,216 INFO L87 Difference]: Start difference. First operand 1012 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 34.0) 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) [2024-11-13 12:58:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:48,310 INFO L93 Difference]: Finished difference Result 2287 states and 3528 transitions. [2024-11-13 12:58:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) 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 [2024-11-13 12:58:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:48,317 INFO L225 Difference]: With dead ends: 2287 [2024-11-13 12:58:48,317 INFO L226 Difference]: Without dead ends: 1460 [2024-11-13 12:58:48,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:48,319 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 225 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:48,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 714 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-11-13 12:58:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1428. [2024-11-13 12:58:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.5325858444288718) internal successors, (2187), 1427 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2187 transitions. [2024-11-13 12:58:48,368 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2187 transitions. Word has length 102 [2024-11-13 12:58:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2187 transitions. [2024-11-13 12:58:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) 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) [2024-11-13 12:58:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2187 transitions. [2024-11-13 12:58:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 12:58:48,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:48,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:48,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:58:48,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:48,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1296481524, now seen corresponding path program 1 times [2024-11-13 12:58:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23111292] [2024-11-13 12:58:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:48,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:48,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23111292] [2024-11-13 12:58:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23111292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:48,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:48,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818406167] [2024-11-13 12:58:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:48,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:48,517 INFO L87 Difference]: Start difference. First operand 1428 states and 2187 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) [2024-11-13 12:58:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:48,597 INFO L93 Difference]: Finished difference Result 3393 states and 5354 transitions. [2024-11-13 12:58:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:48,598 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 [2024-11-13 12:58:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:48,608 INFO L225 Difference]: With dead ends: 3393 [2024-11-13 12:58:48,609 INFO L226 Difference]: Without dead ends: 2234 [2024-11-13 12:58:48,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:48,613 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 237 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:48,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 689 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2024-11-13 12:58:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2172. [2024-11-13 12:58:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.562874251497006) internal successors, (3393), 2171 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3393 transitions. [2024-11-13 12:58:48,710 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3393 transitions. Word has length 104 [2024-11-13 12:58:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3393 transitions. [2024-11-13 12:58:48,711 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) [2024-11-13 12:58:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3393 transitions. [2024-11-13 12:58:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 12:58:48,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:48,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:58:48,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -600271295, now seen corresponding path program 1 times [2024-11-13 12:58:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038813037] [2024-11-13 12:58:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038813037] [2024-11-13 12:58:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038813037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:49,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905471331] [2024-11-13 12:58:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:49,181 INFO L87 Difference]: Start difference. First operand 2172 states and 3393 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:49,282 INFO L93 Difference]: Finished difference Result 5607 states and 8769 transitions. [2024-11-13 12:58:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-13 12:58:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:49,297 INFO L225 Difference]: With dead ends: 5607 [2024-11-13 12:58:49,297 INFO L226 Difference]: Without dead ends: 3472 [2024-11-13 12:58:49,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:49,301 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 573 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:49,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 891 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-11-13 12:58:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2024-11-13 12:58:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.553473623522629) internal successors, (5389), 3469 states have internal predecessors, (5389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5389 transitions. [2024-11-13 12:58:49,412 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5389 transitions. Word has length 105 [2024-11-13 12:58:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5389 transitions. [2024-11-13 12:58:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5389 transitions. [2024-11-13 12:58:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 12:58:49,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:49,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:49,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:58:49,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:49,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 277686540, now seen corresponding path program 1 times [2024-11-13 12:58:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479035584] [2024-11-13 12:58:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479035584] [2024-11-13 12:58:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479035584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582657784] [2024-11-13 12:58:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:49,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:49,514 INFO L87 Difference]: Start difference. First operand 3470 states and 5389 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) 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) [2024-11-13 12:58:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:49,586 INFO L93 Difference]: Finished difference Result 7482 states and 11643 transitions. [2024-11-13 12:58:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:49,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) 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 [2024-11-13 12:58:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:49,604 INFO L225 Difference]: With dead ends: 7482 [2024-11-13 12:58:49,604 INFO L226 Difference]: Without dead ends: 4827 [2024-11-13 12:58:49,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:49,609 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 326 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:49,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 946 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2024-11-13 12:58:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3470. [2024-11-13 12:58:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.5531853560103777) internal successors, (5388), 3469 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5388 transitions. [2024-11-13 12:58:49,756 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5388 transitions. Word has length 106 [2024-11-13 12:58:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5388 transitions. [2024-11-13 12:58:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) 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) [2024-11-13 12:58:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5388 transitions. [2024-11-13 12:58:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 12:58:49,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:49,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:49,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:58:49,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash -668110988, now seen corresponding path program 1 times [2024-11-13 12:58:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709845786] [2024-11-13 12:58:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709845786] [2024-11-13 12:58:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709845786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:50,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925232380] [2024-11-13 12:58:50,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:50,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:50,315 INFO L87 Difference]: Start difference. First operand 3470 states and 5388 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:50,403 INFO L93 Difference]: Finished difference Result 6919 states and 10744 transitions. [2024-11-13 12:58:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-13 12:58:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:50,416 INFO L225 Difference]: With dead ends: 6919 [2024-11-13 12:58:50,416 INFO L226 Difference]: Without dead ends: 3470 [2024-11-13 12:58:50,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:50,420 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 20 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:50,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-13 12:58:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2024-11-13 12:58:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 1.5523205534736235) internal successors, (5385), 3469 states have internal predecessors, (5385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 5385 transitions. [2024-11-13 12:58:50,540 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 5385 transitions. Word has length 107 [2024-11-13 12:58:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:50,540 INFO L471 AbstractCegarLoop]: Abstraction has 3470 states and 5385 transitions. [2024-11-13 12:58:50,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 5385 transitions. [2024-11-13 12:58:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 12:58:50,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:50,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:50,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:58:50,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -854881039, now seen corresponding path program 1 times [2024-11-13 12:58:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651583433] [2024-11-13 12:58:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651583433] [2024-11-13 12:58:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651583433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109203876] [2024-11-13 12:58:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:50,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:50,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:50,695 INFO L87 Difference]: Start difference. First operand 3470 states and 5385 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) [2024-11-13 12:58:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:50,804 INFO L93 Difference]: Finished difference Result 8474 states and 13224 transitions. [2024-11-13 12:58:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:50,805 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 [2024-11-13 12:58:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:50,829 INFO L225 Difference]: With dead ends: 8474 [2024-11-13 12:58:50,829 INFO L226 Difference]: Without dead ends: 5384 [2024-11-13 12:58:50,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:50,834 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 275 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:50,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 766 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2024-11-13 12:58:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5382. [2024-11-13 12:58:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5382 states, 5381 states have (on average 1.534658985318714) internal successors, (8258), 5381 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 8258 transitions. [2024-11-13 12:58:51,028 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 8258 transitions. Word has length 107 [2024-11-13 12:58:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:51,028 INFO L471 AbstractCegarLoop]: Abstraction has 5382 states and 8258 transitions. [2024-11-13 12:58:51,028 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) [2024-11-13 12:58:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 8258 transitions. [2024-11-13 12:58:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 12:58:51,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:51,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:51,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:58:51,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:51,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 914270762, now seen corresponding path program 1 times [2024-11-13 12:58:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371893480] [2024-11-13 12:58:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371893480] [2024-11-13 12:58:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371893480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:51,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16439647] [2024-11-13 12:58:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:51,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:51,131 INFO L87 Difference]: Start difference. First operand 5382 states and 8258 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:51,245 INFO L93 Difference]: Finished difference Result 14007 states and 21922 transitions. [2024-11-13 12:58:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-13 12:58:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:51,279 INFO L225 Difference]: With dead ends: 14007 [2024-11-13 12:58:51,279 INFO L226 Difference]: Without dead ends: 9036 [2024-11-13 12:58:51,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:51,286 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 225 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:51,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 693 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9036 states. [2024-11-13 12:58:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9036 to 8754. [2024-11-13 12:58:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8754 states, 8753 states have (on average 1.559236833085799) internal successors, (13648), 8753 states have internal predecessors, (13648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 13648 transitions. [2024-11-13 12:58:51,542 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 13648 transitions. Word has length 109 [2024-11-13 12:58:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 8754 states and 13648 transitions. [2024-11-13 12:58:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 13648 transitions. [2024-11-13 12:58:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 12:58:51,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:51,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:51,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:58:51,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:51,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1141316501, now seen corresponding path program 1 times [2024-11-13 12:58:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664828977] [2024-11-13 12:58:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664828977] [2024-11-13 12:58:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664828977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:51,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:51,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361649526] [2024-11-13 12:58:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:51,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:51,934 INFO L87 Difference]: Start difference. First operand 8754 states and 13648 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) [2024-11-13 12:58:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:52,274 INFO L93 Difference]: Finished difference Result 39996 states and 62238 transitions. [2024-11-13 12:58:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:58:52,274 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 [2024-11-13 12:58:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:52,349 INFO L225 Difference]: With dead ends: 39996 [2024-11-13 12:58:52,349 INFO L226 Difference]: Without dead ends: 31291 [2024-11-13 12:58:52,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:58:52,366 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 928 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:52,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1458 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:58:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31291 states. [2024-11-13 12:58:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31291 to 15697. [2024-11-13 12:58:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 15696 states have (on average 1.541156982670744) internal successors, (24190), 15696 states have internal predecessors, (24190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 24190 transitions. [2024-11-13 12:58:53,146 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 24190 transitions. Word has length 110 [2024-11-13 12:58:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:53,146 INFO L471 AbstractCegarLoop]: Abstraction has 15697 states and 24190 transitions. [2024-11-13 12:58:53,147 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) [2024-11-13 12:58:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 24190 transitions. [2024-11-13 12:58:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 12:58:53,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:53,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:58:53,153 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1423961921, now seen corresponding path program 1 times [2024-11-13 12:58:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572976754] [2024-11-13 12:58:53,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572976754] [2024-11-13 12:58:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572976754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417976573] [2024-11-13 12:58:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:53,280 INFO L87 Difference]: Start difference. First operand 15697 states and 24190 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) [2024-11-13 12:58:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:53,490 INFO L93 Difference]: Finished difference Result 31279 states and 48227 transitions. [2024-11-13 12:58:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:53,491 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 [2024-11-13 12:58:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:53,525 INFO L225 Difference]: With dead ends: 31279 [2024-11-13 12:58:53,525 INFO L226 Difference]: Without dead ends: 15705 [2024-11-13 12:58:53,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:53,538 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:53,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2024-11-13 12:58:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 15705. [2024-11-13 12:58:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15705 states, 15704 states have (on average 1.5408813041263372) internal successors, (24198), 15704 states have internal predecessors, (24198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 24198 transitions. [2024-11-13 12:58:53,861 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 24198 transitions. Word has length 111 [2024-11-13 12:58:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:53,863 INFO L471 AbstractCegarLoop]: Abstraction has 15705 states and 24198 transitions. [2024-11-13 12:58:53,863 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) [2024-11-13 12:58:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 24198 transitions. [2024-11-13 12:58:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 12:58:53,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:53,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:58:53,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash 396960300, now seen corresponding path program 1 times [2024-11-13 12:58:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776346937] [2024-11-13 12:58:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:54,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776346937] [2024-11-13 12:58:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776346937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586654749] [2024-11-13 12:58:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:54,429 INFO L87 Difference]: Start difference. First operand 15705 states and 24198 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:54,537 INFO L93 Difference]: Finished difference Result 31283 states and 48229 transitions. [2024-11-13 12:58:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-13 12:58:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:54,572 INFO L225 Difference]: With dead ends: 31283 [2024-11-13 12:58:54,573 INFO L226 Difference]: Without dead ends: 15705 [2024-11-13 12:58:54,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:54,590 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 10 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:54,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1073 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2024-11-13 12:58:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 15701. [2024-11-13 12:58:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15701 states, 15700 states have (on average 1.5407006369426752) internal successors, (24189), 15700 states have internal predecessors, (24189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15701 states to 15701 states and 24189 transitions. [2024-11-13 12:58:54,938 INFO L78 Accepts]: Start accepts. Automaton has 15701 states and 24189 transitions. Word has length 112 [2024-11-13 12:58:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:54,939 INFO L471 AbstractCegarLoop]: Abstraction has 15701 states and 24189 transitions. [2024-11-13 12:58:54,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15701 states and 24189 transitions. [2024-11-13 12:58:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 12:58:54,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:54,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:58:54,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1369855469, now seen corresponding path program 1 times [2024-11-13 12:58:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40212597] [2024-11-13 12:58:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40212597] [2024-11-13 12:58:55,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40212597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:55,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:55,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:58:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935545580] [2024-11-13 12:58:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:55,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:58:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:58:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:55,055 INFO L87 Difference]: Start difference. First operand 15701 states and 24189 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:55,304 INFO L93 Difference]: Finished difference Result 40537 states and 62486 transitions. [2024-11-13 12:58:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:58:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-13 12:58:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:55,364 INFO L225 Difference]: With dead ends: 40537 [2024-11-13 12:58:55,365 INFO L226 Difference]: Without dead ends: 25727 [2024-11-13 12:58:55,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:58:55,374 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 258 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:55,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 934 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2024-11-13 12:58:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 25725. [2024-11-13 12:58:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25725 states, 25724 states have (on average 1.5157051780438502) internal successors, (38990), 25724 states have internal predecessors, (38990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25725 states to 25725 states and 38990 transitions. [2024-11-13 12:58:56,018 INFO L78 Accepts]: Start accepts. Automaton has 25725 states and 38990 transitions. Word has length 112 [2024-11-13 12:58:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:56,018 INFO L471 AbstractCegarLoop]: Abstraction has 25725 states and 38990 transitions. [2024-11-13 12:58:56,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 25725 states and 38990 transitions. [2024-11-13 12:58:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 12:58:56,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:56,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:56,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:58:56,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash -841170806, now seen corresponding path program 1 times [2024-11-13 12:58:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952028848] [2024-11-13 12:58:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952028848] [2024-11-13 12:58:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952028848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772340786] [2024-11-13 12:58:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:56,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:58:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:58:56,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:56,642 INFO L87 Difference]: Start difference. First operand 25725 states and 38990 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:56,787 INFO L93 Difference]: Finished difference Result 47593 states and 72455 transitions. [2024-11-13 12:58:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:58:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-13 12:58:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:56,839 INFO L225 Difference]: With dead ends: 47593 [2024-11-13 12:58:56,839 INFO L226 Difference]: Without dead ends: 22681 [2024-11-13 12:58:56,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:58:56,857 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 13 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:56,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1077 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:58:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22681 states. [2024-11-13 12:58:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22681 to 22681. [2024-11-13 12:58:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22681 states, 22680 states have (on average 1.5175044091710759) internal successors, (34417), 22680 states have internal predecessors, (34417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22681 states to 22681 states and 34417 transitions. [2024-11-13 12:58:57,241 INFO L78 Accepts]: Start accepts. Automaton has 22681 states and 34417 transitions. Word has length 112 [2024-11-13 12:58:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 22681 states and 34417 transitions. [2024-11-13 12:58:57,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22681 states and 34417 transitions. [2024-11-13 12:58:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:58:57,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:57,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:57,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 12:58:57,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:57,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash -114669100, now seen corresponding path program 1 times [2024-11-13 12:58:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:57,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750068438] [2024-11-13 12:58:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750068438] [2024-11-13 12:58:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750068438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:57,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:57,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:58:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547395873] [2024-11-13 12:58:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:57,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:58:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:58:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:58:57,611 INFO L87 Difference]: Start difference. First operand 22681 states and 34417 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:57,991 INFO L93 Difference]: Finished difference Result 61837 states and 95835 transitions. [2024-11-13 12:58:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:58:57,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-13 12:58:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:58,098 INFO L225 Difference]: With dead ends: 61837 [2024-11-13 12:58:58,098 INFO L226 Difference]: Without dead ends: 42259 [2024-11-13 12:58:58,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:58:58,117 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 200 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:58,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1103 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:58:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42259 states. [2024-11-13 12:58:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42259 to 42173. [2024-11-13 12:58:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.5178080242815137) internal successors, (64009), 42172 states have internal predecessors, (64009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 64009 transitions. [2024-11-13 12:58:58,854 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 64009 transitions. Word has length 115 [2024-11-13 12:58:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:58:58,855 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 64009 transitions. [2024-11-13 12:58:58,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 64009 transitions. [2024-11-13 12:58:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:58:58,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:58,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:58:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:58:58,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:58:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1641098498, now seen corresponding path program 1 times [2024-11-13 12:58:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365047769] [2024-11-13 12:58:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:58:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:58:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:58:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365047769] [2024-11-13 12:58:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365047769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:58:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:58:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:58:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226858589] [2024-11-13 12:58:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:58:59,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:58:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:58:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:58:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:58:59,055 INFO L87 Difference]: Start difference. First operand 42173 states and 64009 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:58:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:58:59,540 INFO L93 Difference]: Finished difference Result 80231 states and 122095 transitions. [2024-11-13 12:58:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:58:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-13 12:58:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:58:59,635 INFO L225 Difference]: With dead ends: 80231 [2024-11-13 12:58:59,635 INFO L226 Difference]: Without dead ends: 42173 [2024-11-13 12:58:59,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:58:59,652 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 849 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:58:59,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 351 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:58:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42173 states. [2024-11-13 12:59:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42173 to 42173. [2024-11-13 12:59:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.5064260646874703) internal successors, (63529), 42172 states have internal predecessors, (63529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 63529 transitions. [2024-11-13 12:59:00,540 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 63529 transitions. Word has length 115 [2024-11-13 12:59:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:00,541 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 63529 transitions. [2024-11-13 12:59:00,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 63529 transitions. [2024-11-13 12:59:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:59:00,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:00,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:00,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:59:00,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2012038621, now seen corresponding path program 1 times [2024-11-13 12:59:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26924634] [2024-11-13 12:59:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26924634] [2024-11-13 12:59:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26924634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:59:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721757886] [2024-11-13 12:59:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:59:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:59:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:59:01,245 INFO L87 Difference]: Start difference. First operand 42173 states and 63529 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:01,645 INFO L93 Difference]: Finished difference Result 81791 states and 124065 transitions. [2024-11-13 12:59:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-13 12:59:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:01,726 INFO L225 Difference]: With dead ends: 81791 [2024-11-13 12:59:01,727 INFO L226 Difference]: Without dead ends: 42175 [2024-11-13 12:59:01,897 INFO L431 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 [2024-11-13 12:59:01,900 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1304 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:01,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 939 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2024-11-13 12:59:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 42173. [2024-11-13 12:59:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.501873280849853) internal successors, (63337), 42172 states have internal predecessors, (63337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 63337 transitions. [2024-11-13 12:59:02,523 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 63337 transitions. Word has length 115 [2024-11-13 12:59:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 63337 transitions. [2024-11-13 12:59:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 63337 transitions. [2024-11-13 12:59:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:59:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:02,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:59:02,529 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:02,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 452099970, now seen corresponding path program 1 times [2024-11-13 12:59:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246172603] [2024-11-13 12:59:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246172603] [2024-11-13 12:59:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246172603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624948830] [2024-11-13 12:59:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:02,883 INFO L87 Difference]: Start difference. First operand 42173 states and 63337 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:03,188 INFO L93 Difference]: Finished difference Result 69957 states and 105101 transitions. [2024-11-13 12:59:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:03,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-13 12:59:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:03,255 INFO L225 Difference]: With dead ends: 69957 [2024-11-13 12:59:03,255 INFO L226 Difference]: Without dead ends: 39175 [2024-11-13 12:59:03,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:03,282 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 268 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:03,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 960 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39175 states. [2024-11-13 12:59:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39175 to 38967. [2024-11-13 12:59:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38967 states, 38966 states have (on average 1.5010008725555612) internal successors, (58488), 38966 states have internal predecessors, (58488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38967 states to 38967 states and 58488 transitions. [2024-11-13 12:59:04,421 INFO L78 Accepts]: Start accepts. Automaton has 38967 states and 58488 transitions. Word has length 115 [2024-11-13 12:59:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 38967 states and 58488 transitions. [2024-11-13 12:59:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 38967 states and 58488 transitions. [2024-11-13 12:59:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:59:04,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:04,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:04,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:59:04,426 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 630278213, now seen corresponding path program 1 times [2024-11-13 12:59:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457428828] [2024-11-13 12:59:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457428828] [2024-11-13 12:59:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457428828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610524556] [2024-11-13 12:59:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:04,777 INFO L87 Difference]: Start difference. First operand 38967 states and 58488 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:05,313 INFO L93 Difference]: Finished difference Result 80479 states and 120951 transitions. [2024-11-13 12:59:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:05,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-13 12:59:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:05,385 INFO L225 Difference]: With dead ends: 80479 [2024-11-13 12:59:05,385 INFO L226 Difference]: Without dead ends: 52287 [2024-11-13 12:59:05,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:05,399 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 542 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1086 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:05,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1086 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52287 states. [2024-11-13 12:59:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52287 to 39111. [2024-11-13 12:59:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39111 states, 39110 states have (on average 1.499667604193301) internal successors, (58652), 39110 states have internal predecessors, (58652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39111 states to 39111 states and 58652 transitions. [2024-11-13 12:59:06,164 INFO L78 Accepts]: Start accepts. Automaton has 39111 states and 58652 transitions. Word has length 117 [2024-11-13 12:59:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:06,165 INFO L471 AbstractCegarLoop]: Abstraction has 39111 states and 58652 transitions. [2024-11-13 12:59:06,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 39111 states and 58652 transitions. [2024-11-13 12:59:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:59:06,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:06,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:06,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 12:59:06,170 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:06,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash 856369869, now seen corresponding path program 1 times [2024-11-13 12:59:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579973810] [2024-11-13 12:59:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579973810] [2024-11-13 12:59:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579973810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:59:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412084388] [2024-11-13 12:59:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:06,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:06,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:06,251 INFO L87 Difference]: Start difference. First operand 39111 states and 58652 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:06,687 INFO L93 Difference]: Finished difference Result 77723 states and 116716 transitions. [2024-11-13 12:59:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-13 12:59:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:06,750 INFO L225 Difference]: With dead ends: 77723 [2024-11-13 12:59:06,750 INFO L226 Difference]: Without dead ends: 39131 [2024-11-13 12:59:06,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:06,771 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:06,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39131 states. [2024-11-13 12:59:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39131 to 39131. [2024-11-13 12:59:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39131 states, 39130 states have (on average 1.4994122156912855) internal successors, (58672), 39130 states have internal predecessors, (58672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39131 states to 39131 states and 58672 transitions. [2024-11-13 12:59:07,882 INFO L78 Accepts]: Start accepts. Automaton has 39131 states and 58672 transitions. Word has length 118 [2024-11-13 12:59:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:07,882 INFO L471 AbstractCegarLoop]: Abstraction has 39131 states and 58672 transitions. [2024-11-13 12:59:07,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 39131 states and 58672 transitions. [2024-11-13 12:59:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:59:07,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:07,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:07,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:59:07,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1613219331, now seen corresponding path program 1 times [2024-11-13 12:59:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508418547] [2024-11-13 12:59:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508418547] [2024-11-13 12:59:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508418547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:08,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054687255] [2024-11-13 12:59:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:08,222 INFO L87 Difference]: Start difference. First operand 39131 states and 58672 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:08,482 INFO L93 Difference]: Finished difference Result 78607 states and 117697 transitions. [2024-11-13 12:59:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:08,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-13 12:59:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:08,542 INFO L225 Difference]: With dead ends: 78607 [2024-11-13 12:59:08,543 INFO L226 Difference]: Without dead ends: 39608 [2024-11-13 12:59:08,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:08,566 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 270 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:08,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39608 states. [2024-11-13 12:59:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39608 to 39335. [2024-11-13 12:59:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39335 states, 39334 states have (on average 1.4966187013779428) internal successors, (58868), 39334 states have internal predecessors, (58868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39335 states to 39335 states and 58868 transitions. [2024-11-13 12:59:09,390 INFO L78 Accepts]: Start accepts. Automaton has 39335 states and 58868 transitions. Word has length 119 [2024-11-13 12:59:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:09,391 INFO L471 AbstractCegarLoop]: Abstraction has 39335 states and 58868 transitions. [2024-11-13 12:59:09,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 39335 states and 58868 transitions. [2024-11-13 12:59:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:59:09,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:09,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 12:59:09,395 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 88340068, now seen corresponding path program 1 times [2024-11-13 12:59:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778107423] [2024-11-13 12:59:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:09,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778107423] [2024-11-13 12:59:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778107423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137279682] [2024-11-13 12:59:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:09,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:09,863 INFO L87 Difference]: Start difference. First operand 39335 states and 58868 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:10,054 INFO L93 Difference]: Finished difference Result 69175 states and 103621 transitions. [2024-11-13 12:59:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-13 12:59:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:10,103 INFO L225 Difference]: With dead ends: 69175 [2024-11-13 12:59:10,103 INFO L226 Difference]: Without dead ends: 36120 [2024-11-13 12:59:10,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:10,125 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 3 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:10,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1034 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36120 states. [2024-11-13 12:59:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36120 to 36118. [2024-11-13 12:59:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4966082454245924) internal successors, (54053), 36117 states have internal predecessors, (54053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 54053 transitions. [2024-11-13 12:59:10,830 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 54053 transitions. Word has length 119 [2024-11-13 12:59:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:10,830 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 54053 transitions. [2024-11-13 12:59:10,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 54053 transitions. [2024-11-13 12:59:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 12:59:10,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:10,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:10,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 12:59:10,836 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:10,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1270508008, now seen corresponding path program 1 times [2024-11-13 12:59:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172082275] [2024-11-13 12:59:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:10,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:10,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172082275] [2024-11-13 12:59:10,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172082275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:10,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:10,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:59:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649050255] [2024-11-13 12:59:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:10,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:10,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:10,944 INFO L87 Difference]: Start difference. First operand 36118 states and 54053 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:11,191 INFO L93 Difference]: Finished difference Result 70168 states and 105048 transitions. [2024-11-13 12:59:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-13 12:59:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:11,241 INFO L225 Difference]: With dead ends: 70168 [2024-11-13 12:59:11,241 INFO L226 Difference]: Without dead ends: 50310 [2024-11-13 12:59:11,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:11,261 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 294 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 868 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 [2024-11-13 12:59:11,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 868 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50310 states. [2024-11-13 12:59:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50310 to 36118. [2024-11-13 12:59:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4964698064623307) internal successors, (54048), 36117 states have internal predecessors, (54048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 54048 transitions. [2024-11-13 12:59:12,039 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 54048 transitions. Word has length 120 [2024-11-13 12:59:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 54048 transitions. [2024-11-13 12:59:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 54048 transitions. [2024-11-13 12:59:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:59:12,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:12,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 12:59:12,043 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -775506488, now seen corresponding path program 1 times [2024-11-13 12:59:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660983391] [2024-11-13 12:59:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:12,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:12,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660983391] [2024-11-13 12:59:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660983391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518234634] [2024-11-13 12:59:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:12,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:59:12,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:59:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:12,193 INFO L87 Difference]: Start difference. First operand 36118 states and 54048 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:12,516 INFO L93 Difference]: Finished difference Result 70962 states and 106659 transitions. [2024-11-13 12:59:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-13 12:59:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:12,569 INFO L225 Difference]: With dead ends: 70962 [2024-11-13 12:59:12,569 INFO L226 Difference]: Without dead ends: 36118 [2024-11-13 12:59:12,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:12,590 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 819 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:12,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 341 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36118 states. [2024-11-13 12:59:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36118 to 36118. [2024-11-13 12:59:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36118 states, 36117 states have (on average 1.4842318021984107) internal successors, (53606), 36117 states have internal predecessors, (53606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36118 states to 36118 states and 53606 transitions. [2024-11-13 12:59:13,253 INFO L78 Accepts]: Start accepts. Automaton has 36118 states and 53606 transitions. Word has length 121 [2024-11-13 12:59:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 36118 states and 53606 transitions. [2024-11-13 12:59:13,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36118 states and 53606 transitions. [2024-11-13 12:59:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:59:13,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:13,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:13,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:59:13,257 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:13,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash 302450541, now seen corresponding path program 1 times [2024-11-13 12:59:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131952035] [2024-11-13 12:59:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131952035] [2024-11-13 12:59:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131952035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 12:59:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424189507] [2024-11-13 12:59:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:15,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:59:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:59:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-13 12:59:15,456 INFO L87 Difference]: Start difference. First operand 36118 states and 53606 transitions. Second operand has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:21,224 INFO L93 Difference]: Finished difference Result 102796 states and 153828 transitions. [2024-11-13 12:59:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:59:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-13 12:59:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:21,328 INFO L225 Difference]: With dead ends: 102796 [2024-11-13 12:59:21,328 INFO L226 Difference]: Without dead ends: 87616 [2024-11-13 12:59:21,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:59:21,353 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1907 mSDsluCounter, 6536 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:21,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 7123 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 12:59:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87616 states. [2024-11-13 12:59:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87616 to 36672. [2024-11-13 12:59:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36672 states, 36671 states have (on average 1.4791797333042458) internal successors, (54243), 36671 states have internal predecessors, (54243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36672 states to 36672 states and 54243 transitions. [2024-11-13 12:59:22,168 INFO L78 Accepts]: Start accepts. Automaton has 36672 states and 54243 transitions. Word has length 121 [2024-11-13 12:59:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:22,168 INFO L471 AbstractCegarLoop]: Abstraction has 36672 states and 54243 transitions. [2024-11-13 12:59:22,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 36672 states and 54243 transitions. [2024-11-13 12:59:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 12:59:22,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:22,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 12:59:22,171 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:59:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -590053851, now seen corresponding path program 1 times [2024-11-13 12:59:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957986553] [2024-11-13 12:59:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:59:22,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:59:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:59:22,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:59:22,431 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:59:22,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:59:22,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 12:59:22,437 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:22,619 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:59:22,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:59:22 BoogieIcfgContainer [2024-11-13 12:59:22,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:59:22,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:59:22,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:59:22,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:59:22,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:44" (3/4) ... [2024-11-13 12:59:22,624 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 12:59:22,866 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:59:22,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:59:22,866 INFO L158 Benchmark]: Toolchain (without parser) took 40753.55ms. Allocated memory was 117.4MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 91.4MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-13 12:59:22,867 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:22,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.71ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:59:22,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.24ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 63.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:22,867 INFO L158 Benchmark]: Boogie Preprocessor took 111.42ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 58.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:59:22,867 INFO L158 Benchmark]: RCFGBuilder took 1470.99ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 35.7MB in the end (delta: 22.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-13 12:59:22,869 INFO L158 Benchmark]: TraceAbstraction took 38273.59ms. Allocated memory was 117.4MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 35.1MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-13 12:59:22,870 INFO L158 Benchmark]: Witness Printer took 243.14ms. Allocated memory is still 11.2GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-13 12:59:22,871 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.68ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.71ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.24ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 63.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 111.42ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 58.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1470.99ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 35.7MB in the end (delta: 22.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 38273.59ms. Allocated memory was 117.4MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 35.1MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 243.14ms. Allocated memory is still 11.2GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 37.8MB). 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: 586]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] _Bool newmax1 = 0; [L58] char id2 = '\x0'; [L59] char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] _Bool newmax2 = 0; [L66] char id3 = '\x0'; [L67] char r3 = '\x0'; [L68] char st3 = '\x0'; [L69] char nl3 = '\x0'; [L70] char m3 = '\x0'; [L71] char max3 = '\x0'; [L72] _Bool mode3 = 0; [L73] _Bool newmax3 = 0; [L77] void (*nodes[3])() = { &node1, &node2, &node3 }; [L81] int __return_1237; [L82] int __return_1383; [L83] int __return_1517; [L84] int __tmp_1518_0; [L85] int __return_1641; [L86] int __return_1531; VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L89] int main__c1; [L90] int main__i2; [L91] main__c1 = 0 [L92] ep12 = __VERIFIER_nondet_bool() [L93] ep13 = __VERIFIER_nondet_bool() [L94] ep21 = __VERIFIER_nondet_bool() [L95] ep23 = __VERIFIER_nondet_bool() [L96] ep31 = __VERIFIER_nondet_bool() [L97] ep32 = __VERIFIER_nondet_bool() [L98] id1 = __VERIFIER_nondet_char() [L99] r1 = __VERIFIER_nondet_char() [L100] st1 = __VERIFIER_nondet_char() [L101] nl1 = __VERIFIER_nondet_char() [L102] m1 = __VERIFIER_nondet_char() [L103] max1 = __VERIFIER_nondet_char() [L104] mode1 = __VERIFIER_nondet_bool() [L105] newmax1 = __VERIFIER_nondet_bool() [L106] id2 = __VERIFIER_nondet_char() [L107] r2 = __VERIFIER_nondet_char() [L108] st2 = __VERIFIER_nondet_char() [L109] nl2 = __VERIFIER_nondet_char() [L110] m2 = __VERIFIER_nondet_char() [L111] max2 = __VERIFIER_nondet_char() [L112] mode2 = __VERIFIER_nondet_bool() [L113] newmax2 = __VERIFIER_nondet_bool() [L114] id3 = __VERIFIER_nondet_char() [L115] r3 = __VERIFIER_nondet_char() [L116] st3 = __VERIFIER_nondet_char() [L117] nl3 = __VERIFIER_nondet_char() [L118] m3 = __VERIFIER_nondet_char() [L119] max3 = __VERIFIER_nondet_char() [L120] mode3 = __VERIFIER_nondet_bool() [L121] newmax3 = __VERIFIER_nondet_bool() [L123] _Bool init__r121; [L124] _Bool init__r131; [L125] _Bool init__r211; [L126] _Bool init__r231; [L127] _Bool init__r311; [L128] _Bool init__r321; [L129] _Bool init__r122; [L130] int init__tmp; [L131] _Bool init__r132; [L132] int init__tmp___0; [L133] _Bool init__r212; [L134] int init__tmp___1; [L135] _Bool init__r232; [L136] int init__tmp___2; [L137] _Bool init__r312; [L138] int init__tmp___3; [L139] _Bool init__r322; [L140] int init__tmp___4; [L141] int init__tmp___5; [L142] init__r121 = ep12 [L143] init__r131 = ep13 [L144] init__r211 = ep21 [L145] init__r231 = ep23 [L146] init__r311 = ep31 [L147] init__r321 = ep32 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r121 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1778] COND TRUE !(init__r131 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1780] COND TRUE !(ep32 == 0) [L1782] init__tmp = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r122 = (_Bool)init__tmp VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r131 == 0) [L155] init__tmp___0 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r132 = (_Bool)init__tmp___0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND TRUE !(init__r211 == 0) [L160] init__tmp___1 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r212 = (_Bool)init__tmp___1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(init__r231 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1709] COND TRUE !(init__r211 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1711] COND TRUE !(ep13 == 0) [L1713] init__tmp___2 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r232 = (_Bool)init__tmp___2 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND FALSE !(!(init__r311 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1686] COND TRUE !(init__r321 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1688] COND TRUE !(ep21 == 0) [L1690] init__tmp___3 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r312 = (_Bool)init__tmp___3 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE !(init__r321 == 0) [L175] init__tmp___4 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L234] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L236] COND TRUE !(newmax3 == 0) [L238] init__tmp___5 = 1 [L239] __return_1237 = init__tmp___5 [L240] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE main__i2 != 0 [L243] p12_old = nomsg [L244] p12_new = nomsg [L245] p13_old = nomsg [L246] p13_new = nomsg [L247] p21_old = nomsg [L248] p21_new = nomsg [L249] p23_old = nomsg [L250] p23_new = nomsg [L251] p31_old = nomsg [L252] p31_new = nomsg [L253] p32_old = nomsg [L254] p32_new = nomsg [L255] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE main__i2 < 6 [L259] _Bool node1__newmax; [L260] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND TRUE !(ep13 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE !(newmax1 == 0) [L286] int node1____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L287] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE p13_new == nomsg [L291] node1____CPAchecker_TMP_1 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=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] [L293] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] mode1 = 1 [L297] _Bool node2__newmax; [L298] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L299] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L305] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep21 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L309] COND TRUE !(newmax2 == 0) [L311] int node2____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L312] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L314] COND TRUE p21_new == nomsg [L316] node2____CPAchecker_TMP_0 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L318] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L320] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L333] mode2 = 1 [L335] _Bool node3__newmax; [L336] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L337] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L343] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L345] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L358] COND TRUE !(ep32 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE !(newmax3 == 0) [L362] int node3____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L363] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L365] COND TRUE p32_new == nomsg [L367] node3____CPAchecker_TMP_1 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L369] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] mode3 = 1 [L372] p12_old = p12_new [L373] p12_new = nomsg [L374] p13_old = p13_new [L375] p13_new = nomsg [L376] p21_old = p21_new [L377] p21_new = nomsg [L378] p23_old = p23_new [L379] p23_new = nomsg [L380] p31_old = p31_new [L381] p31_new = nomsg [L382] p32_old = p32_new [L383] p32_new = nomsg [L385] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int)r1) < 2 [L414] check__tmp = 1 [L415] __return_1383 = check__tmp [L416] main__c1 = __return_1383 [L418] _Bool __tmp_1; [L419] __tmp_1 = main__c1 [L420] _Bool assert__arg; [L421] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND FALSE !(assert__arg == 0) [L428] int main____CPAchecker_TMP_0 = main__i2; [L429] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE main__i2 < 6 [L433] _Bool node1__newmax; [L434] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE !(mode1 == 0) [L437] r1 = (char)(((int)r1) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE !(ep21 == 0) [L440] m1 = p21_old [L441] p21_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !(!(ep31 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE ((int)r1) == 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE ((int)max1) == ((int)id1) [L461] st1 = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L463] mode1 = 0 [L465] _Bool node2__newmax; [L466] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L467] COND TRUE !(mode2 == 0) [L469] r2 = (char)(((int)r2) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep12 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] COND TRUE !(ep32 == 0) [L481] m2 = p32_old [L482] p32_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L483] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L488] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L489] COND FALSE !(((int)r2) == 2) [L495] mode2 = 0 [L497] _Bool node3__newmax; [L498] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L499] COND TRUE !(mode3 == 0) [L501] r3 = (char)(((int)r3) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, 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] [L502] COND TRUE !(ep13 == 0) [L504] m3 = p13_old [L505] p13_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L506] COND TRUE ((int)m3) > ((int)max3) [L508] max3 = m3 [L509] node3__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(!(ep23 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L520] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L521] COND FALSE !(((int)r3) == 2) [L527] mode3 = 0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L541] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L542] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L544] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L546] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L548] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L550] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L556] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1181] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L574] __return_1517 = check__tmp [L575] main__c1 = __return_1517 [L576] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__c1=0, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L578] main____CPAchecker_TMP_0 = __tmp_1518_0 [L580] _Bool __tmp_2; [L581] __tmp_2 = main__c1 [L582] _Bool assert__arg; [L583] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L584] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L586] reach_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10759 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10759 mSDsluCounter, 31531 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18746 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2893 IncrementalHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 12785 mSDtfsCounter, 2893 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42173occurred in iteration=18, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 96554 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3069 ConstructedInterpolants, 0 QuantifiedInterpolants, 11495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 12:59:22,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db6fa0c-2f34-45b0-a5f0-36456f97121d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE