/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:56:52,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:56:52,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:56:52,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:56:52,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:56:52,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:56:52,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:56:52,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:56:52,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:56:52,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:56:52,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:56:52,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:56:52,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:56:52,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:56:52,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:56:52,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:56:52,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:56:52,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:56:52,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:56:52,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:56:52,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:56:53,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:56:53,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:56:53,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:56:53,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:56:53,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:56:53,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:56:53,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:56:53,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:56:53,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:56:53,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:56:53,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:56:53,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:56:53,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:56:53,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:56:53,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:56:53,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:56:53,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:56:53,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:56:53,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:56:53,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:56:53,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:56:53,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:56:53,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:56:53,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:56:53,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:56:53,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:56:53,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:56:53,041 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:56:53,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:56:53,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:56:53,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:56:53,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:56:53,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:56:53,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:56:53,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:56:53,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:56:53,061 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:56:53,061 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:56:53,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:56:53,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:56:53,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:56:53,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:56:53,273 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:56:53,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-01-11 00:56:53,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49655b48e/439d355e910645eaabbc49b46e4d0f46/FLAGe267fb22a [2022-01-11 00:56:53,717 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:56:53,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-01-11 00:56:53,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49655b48e/439d355e910645eaabbc49b46e4d0f46/FLAGe267fb22a [2022-01-11 00:56:53,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49655b48e/439d355e910645eaabbc49b46e4d0f46 [2022-01-11 00:56:53,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:56:53,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:56:53,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:56:53,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:56:53,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:56:53,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:56:53" (1/1) ... [2022-01-11 00:56:53,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f700223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:53, skipping insertion in model container [2022-01-11 00:56:53,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:56:53" (1/1) ... [2022-01-11 00:56:53,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:56:53,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:56:54,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2022-01-11 00:56:54,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:56:54,092 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:56:54,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2022-01-11 00:56:54,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:56:54,198 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:56:54,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54 WrapperNode [2022-01-11 00:56:54,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:56:54,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:56:54,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:56:54,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:56:54,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,266 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 937 [2022-01-11 00:56:54,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:56:54,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:56:54,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:56:54,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:56:54,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:56:54,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:56:54,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:56:54,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:56:54,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (1/1) ... [2022-01-11 00:56:54,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:56:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:56:54,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:56:54,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:56:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:56:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:56:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:56:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:56:54,491 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:56:54,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:56:55,018 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:56:55,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:56:55,024 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:56:55,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:56:55 BoogieIcfgContainer [2022-01-11 00:56:55,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:56:55,026 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:56:55,026 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:56:55,027 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:56:55,029 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:56:55" (1/1) ... [2022-01-11 00:56:55,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:56:55 BasicIcfg [2022-01-11 00:56:55,454 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:56:55,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:56:55,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:56:55,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:56:55,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:56:53" (1/4) ... [2022-01-11 00:56:55,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41430c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:56:55, skipping insertion in model container [2022-01-11 00:56:55,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:56:54" (2/4) ... [2022-01-11 00:56:55,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41430c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:56:55, skipping insertion in model container [2022-01-11 00:56:55,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:56:55" (3/4) ... [2022-01-11 00:56:55,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41430c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:56:55, skipping insertion in model container [2022-01-11 00:56:55,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:56:55" (4/4) ... [2022-01-11 00:56:55,462 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.cTransformedIcfg [2022-01-11 00:56:55,498 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:56:55,498 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:56:55,546 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:56:55,551 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:56:55,552 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:56:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-11 00:56:55,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:55,580 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:55,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1314641904, now seen corresponding path program 1 times [2022-01-11 00:56:55,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:55,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090484883] [2022-01-11 00:56:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:55,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:56,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090484883] [2022-01-11 00:56:56,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090484883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:56,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:56,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:56,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529622883] [2022-01-11 00:56:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:56,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:56,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:56,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:56,134 INFO L87 Difference]: Start difference. First operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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) [2022-01-11 00:56:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:56,267 INFO L93 Difference]: Finished difference Result 698 states and 1220 transitions. [2022-01-11 00:56:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:56:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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 [2022-01-11 00:56:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:56,282 INFO L225 Difference]: With dead ends: 698 [2022-01-11 00:56:56,282 INFO L226 Difference]: Without dead ends: 470 [2022-01-11 00:56:56,285 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:56,288 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 1007 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:56,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 993 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-01-11 00:56:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2022-01-11 00:56:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4775160599571735) internal successors, (690), 467 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 690 transitions. [2022-01-11 00:56:56,362 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 690 transitions. Word has length 101 [2022-01-11 00:56:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:56,363 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 690 transitions. [2022-01-11 00:56:56,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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) [2022-01-11 00:56:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 690 transitions. [2022-01-11 00:56:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 00:56:56,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:56,370 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:56,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:56:56,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash -709229907, now seen corresponding path program 1 times [2022-01-11 00:56:56,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:56,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075097763] [2022-01-11 00:56:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:56,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:56,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075097763] [2022-01-11 00:56:56,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075097763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:56,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:56,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:56:56,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128110096] [2022-01-11 00:56:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:56,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:56:56,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:56:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:56:56,476 INFO L87 Difference]: Start difference. First operand 468 states and 690 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) [2022-01-11 00:56:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:56,506 INFO L93 Difference]: Finished difference Result 1366 states and 2006 transitions. [2022-01-11 00:56:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:56:56,507 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 [2022-01-11 00:56:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:56,509 INFO L225 Difference]: With dead ends: 1366 [2022-01-11 00:56:56,510 INFO L226 Difference]: Without dead ends: 926 [2022-01-11 00:56:56,515 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:56,516 INFO L933 BasicCegarLoop]: 712 mSDtfsCounter, 352 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:56,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1066 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-01-11 00:56:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2022-01-11 00:56:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.4754797441364607) internal successors, (692), 469 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 692 transitions. [2022-01-11 00:56:56,538 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 692 transitions. Word has length 102 [2022-01-11 00:56:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:56,539 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 692 transitions. [2022-01-11 00:56:56,539 INFO L471 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) [2022-01-11 00:56:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 692 transitions. [2022-01-11 00:56:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:56:56,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:56,542 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:56,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:56:56,544 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash 708815180, now seen corresponding path program 1 times [2022-01-11 00:56:56,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:56,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700925652] [2022-01-11 00:56:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:56,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:56,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700925652] [2022-01-11 00:56:56,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700925652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:56,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:56,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:56:56,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397785915] [2022-01-11 00:56:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:56,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:56:56,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:56:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:56:56,673 INFO L87 Difference]: Start difference. First operand 470 states and 692 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:56,746 INFO L93 Difference]: Finished difference Result 977 states and 1493 transitions. [2022-01-11 00:56:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:56:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 00:56:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:56,750 INFO L225 Difference]: With dead ends: 977 [2022-01-11 00:56:56,750 INFO L226 Difference]: Without dead ends: 634 [2022-01-11 00:56:56,752 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:56,755 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 233 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 745 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 [2022-01-11 00:56:56,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 745 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-01-11 00:56:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2022-01-11 00:56:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.5170178282009725) internal successors, (936), 617 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 936 transitions. [2022-01-11 00:56:56,776 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 936 transitions. Word has length 103 [2022-01-11 00:56:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:56,776 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 936 transitions. [2022-01-11 00:56:56,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 936 transitions. [2022-01-11 00:56:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:56:56,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:56,780 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:56,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:56:56,780 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 624317973, now seen corresponding path program 1 times [2022-01-11 00:56:56,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:56,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329951251] [2022-01-11 00:56:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:56,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:56,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:56,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329951251] [2022-01-11 00:56:56,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329951251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:56,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:56,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:56:56,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975198599] [2022-01-11 00:56:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:56,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:56:56,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:56:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:56:56,903 INFO L87 Difference]: Start difference. First operand 618 states and 936 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:57,028 INFO L93 Difference]: Finished difference Result 2317 states and 3490 transitions. [2022-01-11 00:56:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:56:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 00:56:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:57,033 INFO L225 Difference]: With dead ends: 2317 [2022-01-11 00:56:57,033 INFO L226 Difference]: Without dead ends: 1711 [2022-01-11 00:56:57,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:56:57,035 INFO L933 BasicCegarLoop]: 769 mSDtfsCounter, 1065 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:57,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 1741 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2022-01-11 00:56:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1121. [2022-01-11 00:56:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4910714285714286) internal successors, (1670), 1120 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1670 transitions. [2022-01-11 00:56:57,084 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1670 transitions. Word has length 103 [2022-01-11 00:56:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:57,084 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1670 transitions. [2022-01-11 00:56:57,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1670 transitions. [2022-01-11 00:56:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:56:57,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:57,086 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:57,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:56:57,086 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:57,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2133354545, now seen corresponding path program 1 times [2022-01-11 00:56:57,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:57,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840294127] [2022-01-11 00:56:57,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:57,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:57,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:57,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840294127] [2022-01-11 00:56:57,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840294127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:57,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:57,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:57,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997480724] [2022-01-11 00:56:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:57,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:57,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:57,172 INFO L87 Difference]: Start difference. First operand 1121 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:57,218 INFO L93 Difference]: Finished difference Result 2014 states and 3003 transitions. [2022-01-11 00:56:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:56:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 00:56:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:57,221 INFO L225 Difference]: With dead ends: 2014 [2022-01-11 00:56:57,221 INFO L226 Difference]: Without dead ends: 909 [2022-01-11 00:56:57,222 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:57,223 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 69 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:57,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1118 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-01-11 00:56:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2022-01-11 00:56:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4944933920704846) internal successors, (1357), 908 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1357 transitions. [2022-01-11 00:56:57,258 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1357 transitions. Word has length 103 [2022-01-11 00:56:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:57,258 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1357 transitions. [2022-01-11 00:56:57,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1357 transitions. [2022-01-11 00:56:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 00:56:57,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:57,260 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:57,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:56:57,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 287257850, now seen corresponding path program 1 times [2022-01-11 00:56:57,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863615415] [2022-01-11 00:56:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:57,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:57,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:57,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863615415] [2022-01-11 00:56:57,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863615415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:57,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:57,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:56:57,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729002548] [2022-01-11 00:56:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:57,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:56:57,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:57,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:56:57,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:56:57,306 INFO L87 Difference]: Start difference. First operand 909 states and 1357 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) [2022-01-11 00:56:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:57,358 INFO L93 Difference]: Finished difference Result 1799 states and 2676 transitions. [2022-01-11 00:56:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:56:57,358 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 [2022-01-11 00:56:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:57,362 INFO L225 Difference]: With dead ends: 1799 [2022-01-11 00:56:57,362 INFO L226 Difference]: Without dead ends: 1203 [2022-01-11 00:56:57,363 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:57,364 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 345 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:57,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 741 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-01-11 00:56:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 909. [2022-01-11 00:56:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4933920704845816) internal successors, (1356), 908 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1356 transitions. [2022-01-11 00:56:57,404 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1356 transitions. Word has length 107 [2022-01-11 00:56:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:57,405 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1356 transitions. [2022-01-11 00:56:57,405 INFO L471 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) [2022-01-11 00:56:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1356 transitions. [2022-01-11 00:56:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 00:56:57,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:57,406 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:57,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:56:57,406 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2054837965, now seen corresponding path program 1 times [2022-01-11 00:56:57,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440813934] [2022-01-11 00:56:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:57,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:57,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:57,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440813934] [2022-01-11 00:56:57,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440813934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:57,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:57,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:56:57,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121367955] [2022-01-11 00:56:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:57,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:56:57,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:56:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:56:57,503 INFO L87 Difference]: Start difference. First operand 909 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:57,598 INFO L93 Difference]: Finished difference Result 2305 states and 3495 transitions. [2022-01-11 00:56:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:56:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 00:56:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:57,604 INFO L225 Difference]: With dead ends: 2305 [2022-01-11 00:56:57,604 INFO L226 Difference]: Without dead ends: 1678 [2022-01-11 00:56:57,605 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:57,607 INFO L933 BasicCegarLoop]: 658 mSDtfsCounter, 285 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 984 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 [2022-01-11 00:56:57,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 984 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-01-11 00:56:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1676. [2022-01-11 00:56:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 1.4871641791044776) internal successors, (2491), 1675 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2491 transitions. [2022-01-11 00:56:57,701 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2491 transitions. Word has length 108 [2022-01-11 00:56:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:57,701 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 2491 transitions. [2022-01-11 00:56:57,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2491 transitions. [2022-01-11 00:56:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 00:56:57,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:57,703 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:57,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:56:57,703 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774994, now seen corresponding path program 1 times [2022-01-11 00:56:57,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:57,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586965333] [2022-01-11 00:56:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:57,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:57,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:57,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586965333] [2022-01-11 00:56:57,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586965333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:57,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:57,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:57,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436973034] [2022-01-11 00:56:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:57,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:57,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:57,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:57,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:57,779 INFO L87 Difference]: Start difference. First operand 1676 states and 2491 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:57,941 INFO L93 Difference]: Finished difference Result 4159 states and 6181 transitions. [2022-01-11 00:56:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:56:57,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 00:56:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:57,949 INFO L225 Difference]: With dead ends: 4159 [2022-01-11 00:56:57,949 INFO L226 Difference]: Without dead ends: 2570 [2022-01-11 00:56:57,952 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:57,953 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 927 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:57,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 782 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-01-11 00:56:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 1681. [2022-01-11 00:56:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 1.4839285714285715) internal successors, (2493), 1680 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2493 transitions. [2022-01-11 00:56:58,047 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2493 transitions. Word has length 108 [2022-01-11 00:56:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:58,048 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 2493 transitions. [2022-01-11 00:56:58,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2493 transitions. [2022-01-11 00:56:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 00:56:58,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:58,050 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:58,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:56:58,050 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1926401244, now seen corresponding path program 1 times [2022-01-11 00:56:58,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973830508] [2022-01-11 00:56:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:58,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:58,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973830508] [2022-01-11 00:56:58,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973830508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:58,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:58,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:58,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655769295] [2022-01-11 00:56:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:58,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:58,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:58,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:58,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:58,147 INFO L87 Difference]: Start difference. First operand 1681 states and 2493 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:58,403 INFO L93 Difference]: Finished difference Result 4793 states and 7107 transitions. [2022-01-11 00:56:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:56:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 00:56:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:58,412 INFO L225 Difference]: With dead ends: 4793 [2022-01-11 00:56:58,412 INFO L226 Difference]: Without dead ends: 3180 [2022-01-11 00:56:58,414 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:58,415 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 788 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:58,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 819 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-01-11 00:56:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3178. [2022-01-11 00:56:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3177 states have (on average 1.4743468681145735) internal successors, (4684), 3177 states have internal predecessors, (4684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4684 transitions. [2022-01-11 00:56:58,601 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4684 transitions. Word has length 108 [2022-01-11 00:56:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:58,602 INFO L470 AbstractCegarLoop]: Abstraction has 3178 states and 4684 transitions. [2022-01-11 00:56:58,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4684 transitions. [2022-01-11 00:56:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 00:56:58,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:58,605 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:58,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:56:58,605 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:58,605 INFO L85 PathProgramCache]: Analyzing trace with hash 956065521, now seen corresponding path program 1 times [2022-01-11 00:56:58,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:58,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920769042] [2022-01-11 00:56:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:58,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:58,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:58,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920769042] [2022-01-11 00:56:58,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920769042] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:58,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:58,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:58,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739427608] [2022-01-11 00:56:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:58,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:58,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:58,711 INFO L87 Difference]: Start difference. First operand 3178 states and 4684 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) [2022-01-11 00:56:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:58,853 INFO L93 Difference]: Finished difference Result 4580 states and 6799 transitions. [2022-01-11 00:56:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:56:58,854 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 [2022-01-11 00:56:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:58,861 INFO L225 Difference]: With dead ends: 4580 [2022-01-11 00:56:58,861 INFO L226 Difference]: Without dead ends: 2649 [2022-01-11 00:56:58,863 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:58,864 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 47 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:56:58,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1099 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2022-01-11 00:56:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2649. [2022-01-11 00:56:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2648 states have (on average 1.475453172205438) internal successors, (3907), 2648 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3907 transitions. [2022-01-11 00:56:59,040 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3907 transitions. Word has length 110 [2022-01-11 00:56:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:59,040 INFO L470 AbstractCegarLoop]: Abstraction has 2649 states and 3907 transitions. [2022-01-11 00:56:59,041 INFO L471 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) [2022-01-11 00:56:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3907 transitions. [2022-01-11 00:56:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 00:56:59,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:59,042 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:59,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:56:59,043 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 120208703, now seen corresponding path program 1 times [2022-01-11 00:56:59,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462061350] [2022-01-11 00:56:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:59,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:59,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:59,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462061350] [2022-01-11 00:56:59,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462061350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:59,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:59,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:56:59,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965282132] [2022-01-11 00:56:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:59,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:56:59,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:56:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:56:59,137 INFO L87 Difference]: Start difference. First operand 2649 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:56:59,376 INFO L93 Difference]: Finished difference Result 5524 states and 8409 transitions. [2022-01-11 00:56:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:56:59,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 00:56:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:56:59,386 INFO L225 Difference]: With dead ends: 5524 [2022-01-11 00:56:59,386 INFO L226 Difference]: Without dead ends: 3762 [2022-01-11 00:56:59,387 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:56:59,388 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 237 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 721 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 [2022-01-11 00:56:59,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 721 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:56:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3762 states. [2022-01-11 00:56:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3762 to 3654. [2022-01-11 00:56:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3653 states have (on average 1.5097180399671504) internal successors, (5515), 3653 states have internal predecessors, (5515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5515 transitions. [2022-01-11 00:56:59,699 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5515 transitions. Word has length 110 [2022-01-11 00:56:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:56:59,699 INFO L470 AbstractCegarLoop]: Abstraction has 3654 states and 5515 transitions. [2022-01-11 00:56:59,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:56:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5515 transitions. [2022-01-11 00:56:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 00:56:59,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:56:59,701 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:56:59,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:56:59,701 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:56:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:56:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1060014262, now seen corresponding path program 1 times [2022-01-11 00:56:59,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:56:59,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922739655] [2022-01-11 00:56:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:56:59,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:56:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:56:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:56:59,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:56:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922739655] [2022-01-11 00:56:59,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922739655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:56:59,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:56:59,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:56:59,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040709370] [2022-01-11 00:56:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:56:59,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:56:59,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:56:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:56:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:56:59,782 INFO L87 Difference]: Start difference. First operand 3654 states and 5515 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) [2022-01-11 00:57:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:00,310 INFO L93 Difference]: Finished difference Result 10567 states and 15914 transitions. [2022-01-11 00:57:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:57:00,310 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 [2022-01-11 00:57:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:00,327 INFO L225 Difference]: With dead ends: 10567 [2022-01-11 00:57:00,327 INFO L226 Difference]: Without dead ends: 6991 [2022-01-11 00:57:00,329 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:00,330 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 638 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:00,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 763 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2022-01-11 00:57:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6989. [2022-01-11 00:57:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6989 states, 6988 states have (on average 1.4924155695477963) internal successors, (10429), 6988 states have internal predecessors, (10429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 10429 transitions. [2022-01-11 00:57:00,806 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 10429 transitions. Word has length 110 [2022-01-11 00:57:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:00,806 INFO L470 AbstractCegarLoop]: Abstraction has 6989 states and 10429 transitions. [2022-01-11 00:57:00,807 INFO L471 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) [2022-01-11 00:57:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 10429 transitions. [2022-01-11 00:57:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 00:57:00,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:00,810 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:00,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:57:00,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2036217769, now seen corresponding path program 1 times [2022-01-11 00:57:00,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:00,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032326412] [2022-01-11 00:57:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:00,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:00,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032326412] [2022-01-11 00:57:00,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032326412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:00,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:00,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:57:00,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230281445] [2022-01-11 00:57:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:00,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:57:00,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:57:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:57:00,923 INFO L87 Difference]: Start difference. First operand 6989 states and 10429 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 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) [2022-01-11 00:57:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:01,889 INFO L93 Difference]: Finished difference Result 18666 states and 27800 transitions. [2022-01-11 00:57:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:57:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 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 [2022-01-11 00:57:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:01,915 INFO L225 Difference]: With dead ends: 18666 [2022-01-11 00:57:01,915 INFO L226 Difference]: Without dead ends: 11727 [2022-01-11 00:57:01,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:57:01,924 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 1169 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:01,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1169 Valid, 1381 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11727 states. [2022-01-11 00:57:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11727 to 7284. [2022-01-11 00:57:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.4767266236441028) internal successors, (10755), 7283 states have internal predecessors, (10755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 10755 transitions. [2022-01-11 00:57:02,481 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 10755 transitions. Word has length 110 [2022-01-11 00:57:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:02,481 INFO L470 AbstractCegarLoop]: Abstraction has 7284 states and 10755 transitions. [2022-01-11 00:57:02,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 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) [2022-01-11 00:57:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 10755 transitions. [2022-01-11 00:57:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 00:57:02,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:02,485 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:02,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:57:02,485 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1794243003, now seen corresponding path program 1 times [2022-01-11 00:57:02,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:02,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607688541] [2022-01-11 00:57:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:02,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:02,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607688541] [2022-01-11 00:57:02,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607688541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:02,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:02,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:57:02,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268558706] [2022-01-11 00:57:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:02,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:57:02,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:02,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:57:02,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:57:02,549 INFO L87 Difference]: Start difference. First operand 7284 states and 10755 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) [2022-01-11 00:57:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:02,957 INFO L93 Difference]: Finished difference Result 13363 states and 19821 transitions. [2022-01-11 00:57:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:57:02,957 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 [2022-01-11 00:57:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:02,968 INFO L225 Difference]: With dead ends: 13363 [2022-01-11 00:57:02,968 INFO L226 Difference]: Without dead ends: 6275 [2022-01-11 00:57:02,975 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:02,975 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 47 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:02,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1087 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2022-01-11 00:57:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 6275. [2022-01-11 00:57:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6274 states have (on average 1.4816703857188396) internal successors, (9296), 6274 states have internal predecessors, (9296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 9296 transitions. [2022-01-11 00:57:03,443 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 9296 transitions. Word has length 110 [2022-01-11 00:57:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:03,443 INFO L470 AbstractCegarLoop]: Abstraction has 6275 states and 9296 transitions. [2022-01-11 00:57:03,443 INFO L471 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) [2022-01-11 00:57:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 9296 transitions. [2022-01-11 00:57:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-11 00:57:03,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:03,447 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:03,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:57:03,447 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1829515194, now seen corresponding path program 1 times [2022-01-11 00:57:03,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:03,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836358869] [2022-01-11 00:57:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:03,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:03,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:03,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836358869] [2022-01-11 00:57:03,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836358869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:03,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:03,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:03,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878325769] [2022-01-11 00:57:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:03,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:03,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:03,494 INFO L87 Difference]: Start difference. First operand 6275 states and 9296 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:04,104 INFO L93 Difference]: Finished difference Result 12261 states and 18257 transitions. [2022-01-11 00:57:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-01-11 00:57:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:04,179 INFO L225 Difference]: With dead ends: 12261 [2022-01-11 00:57:04,179 INFO L226 Difference]: Without dead ends: 8522 [2022-01-11 00:57:04,184 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:04,184 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 329 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:04,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 916 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2022-01-11 00:57:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6275. [2022-01-11 00:57:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6274 states have (on average 1.4811922218680267) internal successors, (9293), 6274 states have internal predecessors, (9293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 9293 transitions. [2022-01-11 00:57:04,610 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 9293 transitions. Word has length 114 [2022-01-11 00:57:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:04,610 INFO L470 AbstractCegarLoop]: Abstraction has 6275 states and 9293 transitions. [2022-01-11 00:57:04,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 9293 transitions. [2022-01-11 00:57:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-11 00:57:04,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:04,614 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:04,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:57:04,614 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1452342532, now seen corresponding path program 1 times [2022-01-11 00:57:04,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:04,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672471699] [2022-01-11 00:57:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:04,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:04,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672471699] [2022-01-11 00:57:04,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672471699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:04,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:04,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:04,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599896278] [2022-01-11 00:57:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:04,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:04,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:04,691 INFO L87 Difference]: Start difference. First operand 6275 states and 9293 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:05,066 INFO L93 Difference]: Finished difference Result 8046 states and 11922 transitions. [2022-01-11 00:57:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-01-11 00:57:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:05,072 INFO L225 Difference]: With dead ends: 8046 [2022-01-11 00:57:05,072 INFO L226 Difference]: Without dead ends: 5221 [2022-01-11 00:57:05,075 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:05,075 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 269 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:05,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 948 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2022-01-11 00:57:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 5219. [2022-01-11 00:57:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5218 states have (on average 1.4683786891529322) internal successors, (7662), 5218 states have internal predecessors, (7662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 7662 transitions. [2022-01-11 00:57:05,409 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 7662 transitions. Word has length 115 [2022-01-11 00:57:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:05,409 INFO L470 AbstractCegarLoop]: Abstraction has 5219 states and 7662 transitions. [2022-01-11 00:57:05,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 7662 transitions. [2022-01-11 00:57:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-11 00:57:05,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:05,412 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:05,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:57:05,413 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -76630967, now seen corresponding path program 1 times [2022-01-11 00:57:05,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316185164] [2022-01-11 00:57:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:05,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:05,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316185164] [2022-01-11 00:57:05,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316185164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:05,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:05,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:05,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86509045] [2022-01-11 00:57:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:05,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:05,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:05,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:05,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:05,492 INFO L87 Difference]: Start difference. First operand 5219 states and 7662 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:06,005 INFO L93 Difference]: Finished difference Result 12002 states and 17958 transitions. [2022-01-11 00:57:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-01-11 00:57:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:06,016 INFO L225 Difference]: With dead ends: 12002 [2022-01-11 00:57:06,016 INFO L226 Difference]: Without dead ends: 7912 [2022-01-11 00:57:06,022 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:06,022 INFO L933 BasicCegarLoop]: 629 mSDtfsCounter, 271 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 944 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 [2022-01-11 00:57:06,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 944 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2022-01-11 00:57:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 7910. [2022-01-11 00:57:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7910 states, 7909 states have (on average 1.4618788721709446) internal successors, (11562), 7909 states have internal predecessors, (11562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 11562 transitions. [2022-01-11 00:57:06,607 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 11562 transitions. Word has length 115 [2022-01-11 00:57:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:06,608 INFO L470 AbstractCegarLoop]: Abstraction has 7910 states and 11562 transitions. [2022-01-11 00:57:06,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 11562 transitions. [2022-01-11 00:57:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-11 00:57:06,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:06,615 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:06,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:57:06,616 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:06,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1438007683, now seen corresponding path program 1 times [2022-01-11 00:57:06,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677478282] [2022-01-11 00:57:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:06,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:06,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677478282] [2022-01-11 00:57:06,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677478282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:06,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:06,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:06,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012861477] [2022-01-11 00:57:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:06,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:06,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:06,717 INFO L87 Difference]: Start difference. First operand 7910 states and 11562 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:07,686 INFO L93 Difference]: Finished difference Result 17927 states and 26997 transitions. [2022-01-11 00:57:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:07,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-11 00:57:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:07,711 INFO L225 Difference]: With dead ends: 17927 [2022-01-11 00:57:07,711 INFO L226 Difference]: Without dead ends: 12160 [2022-01-11 00:57:07,717 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:07,719 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 238 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 700 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 [2022-01-11 00:57:07,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 700 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2022-01-11 00:57:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 11694. [2022-01-11 00:57:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11694 states, 11693 states have (on average 1.492516890447276) internal successors, (17452), 11693 states have internal predecessors, (17452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17452 transitions. [2022-01-11 00:57:08,587 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17452 transitions. Word has length 117 [2022-01-11 00:57:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:08,587 INFO L470 AbstractCegarLoop]: Abstraction has 11694 states and 17452 transitions. [2022-01-11 00:57:08,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17452 transitions. [2022-01-11 00:57:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:57:08,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:08,623 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:08,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:57:08,624 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -917939375, now seen corresponding path program 1 times [2022-01-11 00:57:08,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:08,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165870157] [2022-01-11 00:57:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:08,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:08,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165870157] [2022-01-11 00:57:08,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165870157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:08,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:08,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:08,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489113215] [2022-01-11 00:57:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:08,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:08,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:08,771 INFO L87 Difference]: Start difference. First operand 11694 states and 17452 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) [2022-01-11 00:57:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:10,685 INFO L93 Difference]: Finished difference Result 32285 states and 48979 transitions. [2022-01-11 00:57:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:10,686 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 [2022-01-11 00:57:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:10,717 INFO L225 Difference]: With dead ends: 32285 [2022-01-11 00:57:10,718 INFO L226 Difference]: Without dead ends: 22288 [2022-01-11 00:57:10,731 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:10,732 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 240 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:10,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 761 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 00:57:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2022-01-11 00:57:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 22286. [2022-01-11 00:57:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22286 states, 22285 states have (on average 1.4987211128561813) internal successors, (33399), 22285 states have internal predecessors, (33399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22286 states to 22286 states and 33399 transitions. [2022-01-11 00:57:12,655 INFO L78 Accepts]: Start accepts. Automaton has 22286 states and 33399 transitions. Word has length 118 [2022-01-11 00:57:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:12,656 INFO L470 AbstractCegarLoop]: Abstraction has 22286 states and 33399 transitions. [2022-01-11 00:57:12,656 INFO L471 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) [2022-01-11 00:57:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22286 states and 33399 transitions. [2022-01-11 00:57:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-11 00:57:12,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:12,661 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:12,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:57:12,661 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash -530746094, now seen corresponding path program 1 times [2022-01-11 00:57:12,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:12,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717110601] [2022-01-11 00:57:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:12,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:12,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717110601] [2022-01-11 00:57:12,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717110601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:12,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:12,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:57:12,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061394309] [2022-01-11 00:57:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:12,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:57:12,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:57:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:57:12,742 INFO L87 Difference]: Start difference. First operand 22286 states and 33399 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 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) [2022-01-11 00:57:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:14,479 INFO L93 Difference]: Finished difference Result 29656 states and 44358 transitions. [2022-01-11 00:57:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:57:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 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 [2022-01-11 00:57:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:14,516 INFO L225 Difference]: With dead ends: 29656 [2022-01-11 00:57:14,516 INFO L226 Difference]: Without dead ends: 22288 [2022-01-11 00:57:14,530 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:14,531 INFO L933 BasicCegarLoop]: 547 mSDtfsCounter, 676 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:14,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 856 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2022-01-11 00:57:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 22182. [2022-01-11 00:57:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22182 states, 22181 states have (on average 1.49948153825346) internal successors, (33260), 22181 states have internal predecessors, (33260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22182 states to 22182 states and 33260 transitions. [2022-01-11 00:57:16,522 INFO L78 Accepts]: Start accepts. Automaton has 22182 states and 33260 transitions. Word has length 118 [2022-01-11 00:57:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:16,523 INFO L470 AbstractCegarLoop]: Abstraction has 22182 states and 33260 transitions. [2022-01-11 00:57:16,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 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) [2022-01-11 00:57:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 22182 states and 33260 transitions. [2022-01-11 00:57:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-11 00:57:16,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:16,528 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:16,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:57:16,528 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 716719067, now seen corresponding path program 1 times [2022-01-11 00:57:16,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298223546] [2022-01-11 00:57:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:16,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:16,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298223546] [2022-01-11 00:57:16,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298223546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:16,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:16,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:57:16,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047407105] [2022-01-11 00:57:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:16,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:57:16,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:57:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:57:16,570 INFO L87 Difference]: Start difference. First operand 22182 states and 33260 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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) [2022-01-11 00:57:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:20,022 INFO L93 Difference]: Finished difference Result 51523 states and 77239 transitions. [2022-01-11 00:57:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:57:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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 [2022-01-11 00:57:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:20,083 INFO L225 Difference]: With dead ends: 51523 [2022-01-11 00:57:20,083 INFO L226 Difference]: Without dead ends: 44155 [2022-01-11 00:57:20,099 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:20,100 INFO L933 BasicCegarLoop]: 664 mSDtfsCounter, 318 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:20,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 1004 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44155 states. [2022-01-11 00:57:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44155 to 22192. [2022-01-11 00:57:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22192 states, 22191 states have (on average 1.4992564553197243) internal successors, (33270), 22191 states have internal predecessors, (33270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22192 states to 22192 states and 33270 transitions. [2022-01-11 00:57:22,184 INFO L78 Accepts]: Start accepts. Automaton has 22192 states and 33270 transitions. Word has length 119 [2022-01-11 00:57:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:22,184 INFO L470 AbstractCegarLoop]: Abstraction has 22192 states and 33270 transitions. [2022-01-11 00:57:22,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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) [2022-01-11 00:57:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22192 states and 33270 transitions. [2022-01-11 00:57:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-11 00:57:22,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:22,189 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:22,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:57:22,189 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -207112179, now seen corresponding path program 1 times [2022-01-11 00:57:22,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638033230] [2022-01-11 00:57:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:22,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:22,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:22,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638033230] [2022-01-11 00:57:22,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638033230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:22,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:22,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:57:22,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070243366] [2022-01-11 00:57:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:22,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:57:22,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:57:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:57:22,302 INFO L87 Difference]: Start difference. First operand 22192 states and 33270 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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) [2022-01-11 00:57:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:26,229 INFO L93 Difference]: Finished difference Result 54972 states and 82600 transitions. [2022-01-11 00:57:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:57:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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 [2022-01-11 00:57:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:26,291 INFO L225 Difference]: With dead ends: 54972 [2022-01-11 00:57:26,291 INFO L226 Difference]: Without dead ends: 37271 [2022-01-11 00:57:26,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:57:26,320 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1027 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:26,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1027 Valid, 1666 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37271 states. [2022-01-11 00:57:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37271 to 22491. [2022-01-11 00:57:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22491 states, 22490 states have (on average 1.4936416184971097) internal successors, (33592), 22490 states have internal predecessors, (33592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22491 states to 22491 states and 33592 transitions. [2022-01-11 00:57:28,692 INFO L78 Accepts]: Start accepts. Automaton has 22491 states and 33592 transitions. Word has length 120 [2022-01-11 00:57:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:28,693 INFO L470 AbstractCegarLoop]: Abstraction has 22491 states and 33592 transitions. [2022-01-11 00:57:28,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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) [2022-01-11 00:57:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 22491 states and 33592 transitions. [2022-01-11 00:57:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-11 00:57:28,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:28,705 INFO L514 BasicCegarLoop]: 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] [2022-01-11 00:57:28,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:57:28,705 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 389959281, now seen corresponding path program 1 times [2022-01-11 00:57:28,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:28,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535109983] [2022-01-11 00:57:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:28,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:28,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535109983] [2022-01-11 00:57:28,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535109983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:28,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:28,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:57:28,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388000635] [2022-01-11 00:57:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:28,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:57:28,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:57:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:57:28,776 INFO L87 Difference]: Start difference. First operand 22491 states and 33592 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 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) [2022-01-11 00:57:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:30,844 INFO L93 Difference]: Finished difference Result 27905 states and 41701 transitions. [2022-01-11 00:57:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:57:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 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 [2022-01-11 00:57:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:30,874 INFO L225 Difference]: With dead ends: 27905 [2022-01-11 00:57:30,874 INFO L226 Difference]: Without dead ends: 20522 [2022-01-11 00:57:30,884 INFO L932 BasicCegarLoop]: 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 [2022-01-11 00:57:30,885 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 17 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:30,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1052 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:57:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20522 states. [2022-01-11 00:57:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20522 to 20522. [2022-01-11 00:57:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20522 states, 20521 states have (on average 1.4971492617318845) internal successors, (30723), 20521 states have internal predecessors, (30723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20522 states to 20522 states and 30723 transitions. [2022-01-11 00:57:32,970 INFO L78 Accepts]: Start accepts. Automaton has 20522 states and 30723 transitions. Word has length 120 [2022-01-11 00:57:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:32,970 INFO L470 AbstractCegarLoop]: Abstraction has 20522 states and 30723 transitions. [2022-01-11 00:57:32,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 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) [2022-01-11 00:57:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20522 states and 30723 transitions. [2022-01-11 00:57:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 00:57:32,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:32,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:57:32,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:57:32,975 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2028321220, now seen corresponding path program 1 times [2022-01-11 00:57:32,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:32,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717067266] [2022-01-11 00:57:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:32,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:57:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:57:34,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:57:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717067266] [2022-01-11 00:57:34,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717067266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:57:34,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:57:34,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 00:57:34,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931555271] [2022-01-11 00:57:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:57:34,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 00:57:34,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:57:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 00:57:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-11 00:57:34,117 INFO L87 Difference]: Start difference. First operand 20522 states and 30723 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:57:41,200 INFO L93 Difference]: Finished difference Result 44838 states and 68175 transitions. [2022-01-11 00:57:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 00:57:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-11 00:57:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:57:41,246 INFO L225 Difference]: With dead ends: 44838 [2022-01-11 00:57:41,246 INFO L226 Difference]: Without dead ends: 25984 [2022-01-11 00:57:41,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-11 00:57:41,264 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 1225 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-11 00:57:41,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1225 Valid, 873 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-11 00:57:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25984 states. [2022-01-11 00:57:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25984 to 19758. [2022-01-11 00:57:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19758 states, 19757 states have (on average 1.5082755479070709) internal successors, (29799), 19757 states have internal predecessors, (29799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19758 states to 19758 states and 29799 transitions. [2022-01-11 00:57:45,484 INFO L78 Accepts]: Start accepts. Automaton has 19758 states and 29799 transitions. Word has length 122 [2022-01-11 00:57:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:57:45,485 INFO L470 AbstractCegarLoop]: Abstraction has 19758 states and 29799 transitions. [2022-01-11 00:57:45,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:57:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19758 states and 29799 transitions. [2022-01-11 00:57:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 00:57:45,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:57:45,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:57:45,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:57:45,488 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:57:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:57:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1595512701, now seen corresponding path program 1 times [2022-01-11 00:57:45,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:57:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220748292] [2022-01-11 00:57:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:57:45,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:57:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:57:45,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 00:57:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:57:45,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 00:57:45,898 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 00:57:45,898 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 00:57:45,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:57:45,901 INFO L732 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] [2022-01-11 00:57:45,904 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:57:46,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:57:46 BasicIcfg [2022-01-11 00:57:46,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:57:46,425 INFO L158 Benchmark]: Toolchain (without parser) took 52678.48ms. Allocated memory was 220.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 166.1MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-01-11 00:57:46,425 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 220.2MB. Free memory is still 183.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:57:46,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.37ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 165.9MB in the beginning and 281.4MB in the end (delta: -115.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-01-11 00:57:46,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.98ms. Allocated memory is still 318.8MB. Free memory was 281.4MB in the beginning and 277.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 00:57:46,429 INFO L158 Benchmark]: Boogie Preprocessor took 47.04ms. Allocated memory is still 318.8MB. Free memory was 277.2MB in the beginning and 274.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:57:46,429 INFO L158 Benchmark]: RCFGBuilder took 711.25ms. Allocated memory is still 318.8MB. Free memory was 274.0MB in the beginning and 217.9MB in the end (delta: 56.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-01-11 00:57:46,429 INFO L158 Benchmark]: IcfgTransformer took 427.60ms. Allocated memory is still 318.8MB. Free memory was 217.9MB in the beginning and 112.5MB in the end (delta: 105.4MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2022-01-11 00:57:46,429 INFO L158 Benchmark]: TraceAbstraction took 50968.68ms. Allocated memory was 318.8MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 112.0MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-01-11 00:57:46,430 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 220.2MB. Free memory is still 183.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.37ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 165.9MB in the beginning and 281.4MB in the end (delta: -115.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.98ms. Allocated memory is still 318.8MB. Free memory was 281.4MB in the beginning and 277.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.04ms. Allocated memory is still 318.8MB. Free memory was 277.2MB in the beginning and 274.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 711.25ms. Allocated memory is still 318.8MB. Free memory was 274.0MB in the beginning and 217.9MB in the end (delta: 56.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * IcfgTransformer took 427.60ms. Allocated memory is still 318.8MB. Free memory was 217.9MB in the beginning and 112.5MB in the end (delta: 105.4MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. * TraceAbstraction took 50968.68ms. Allocated memory was 318.8MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 112.0MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 595]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] port_t p12 = 0; [L28] char p12_old = '\x0'; [L29] char p12_new = '\x0'; [L30] _Bool ep12 = 0; [L31] port_t p13 = 0; [L32] char p13_old = '\x0'; [L33] char p13_new = '\x0'; [L34] _Bool ep13 = 0; [L35] port_t p21 = 0; [L36] char p21_old = '\x0'; [L37] char p21_new = '\x0'; [L38] _Bool ep21 = 0; [L39] port_t p23 = 0; [L40] char p23_old = '\x0'; [L41] char p23_new = '\x0'; [L42] _Bool ep23 = 0; [L43] port_t p31 = 0; [L44] char p31_old = '\x0'; [L45] char p31_new = '\x0'; [L46] _Bool ep31 = 0; [L47] port_t p32 = 0; [L48] char p32_old = '\x0'; [L49] char p32_new = '\x0'; [L50] _Bool ep32 = 0; [L51] char id1 = '\x0'; [L52] unsigned char r1 = '\x0'; [L53] char st1 = '\x0'; [L54] char nl1 = '\x0'; [L55] char m1 = '\x0'; [L56] char max1 = '\x0'; [L57] _Bool mode1 = 0; [L58] _Bool newmax1 = 0; [L59] char id2 = '\x0'; [L60] unsigned char r2 = '\x0'; [L61] char st2 = '\x0'; [L62] char nl2 = '\x0'; [L63] char m2 = '\x0'; [L64] char max2 = '\x0'; [L65] _Bool mode2 = 0; [L66] _Bool newmax2 = 0; [L67] char id3 = '\x0'; [L68] unsigned char r3 = '\x0'; [L69] char st3 = '\x0'; [L70] char nl3 = '\x0'; [L71] char m3 = '\x0'; [L72] char max3 = '\x0'; [L73] _Bool mode3 = 0; [L74] _Bool newmax3 = 0; [L78] void (*nodes[3])() = { &node1, &node2, &node3 }; [L82] int __return_1248; [L83] int __return_1394; [L84] int __return_1528; [L85] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L88] int main__c1; [L89] int main__i2; [L90] main__c1 = 0 [L91] ep12 = __VERIFIER_nondet_bool() [L92] ep13 = __VERIFIER_nondet_bool() [L93] ep21 = __VERIFIER_nondet_bool() [L94] ep23 = __VERIFIER_nondet_bool() [L95] ep31 = __VERIFIER_nondet_bool() [L96] ep32 = __VERIFIER_nondet_bool() [L97] id1 = __VERIFIER_nondet_char() [L98] r1 = __VERIFIER_nondet_uchar() [L99] st1 = __VERIFIER_nondet_char() [L100] nl1 = __VERIFIER_nondet_char() [L101] m1 = __VERIFIER_nondet_char() [L102] max1 = __VERIFIER_nondet_char() [L103] mode1 = __VERIFIER_nondet_bool() [L104] newmax1 = __VERIFIER_nondet_bool() [L105] id2 = __VERIFIER_nondet_char() [L106] r2 = __VERIFIER_nondet_uchar() [L107] st2 = __VERIFIER_nondet_char() [L108] nl2 = __VERIFIER_nondet_char() [L109] m2 = __VERIFIER_nondet_char() [L110] max2 = __VERIFIER_nondet_char() [L111] mode2 = __VERIFIER_nondet_bool() [L112] newmax2 = __VERIFIER_nondet_bool() [L113] id3 = __VERIFIER_nondet_char() [L114] r3 = __VERIFIER_nondet_uchar() [L115] st3 = __VERIFIER_nondet_char() [L116] nl3 = __VERIFIER_nondet_char() [L117] m3 = __VERIFIER_nondet_char() [L118] max3 = __VERIFIER_nondet_char() [L119] mode3 = __VERIFIER_nondet_bool() [L120] newmax3 = __VERIFIER_nondet_bool() [L122] _Bool init__r121; [L123] _Bool init__r131; [L124] _Bool init__r211; [L125] _Bool init__r231; [L126] _Bool init__r311; [L127] _Bool init__r321; [L128] _Bool init__r122; [L129] int init__tmp; [L130] _Bool init__r132; [L131] int init__tmp___0; [L132] _Bool init__r212; [L133] int init__tmp___1; [L134] _Bool init__r232; [L135] int init__tmp___2; [L136] _Bool init__r312; [L137] int init__tmp___3; [L138] _Bool init__r322; [L139] int init__tmp___4; [L140] int init__tmp___5; [L141] init__r121 = ep12 [L142] init__r131 = ep13 [L143] init__r211 = ep21 [L144] init__r231 = ep23 [L145] init__r311 = ep31 [L146] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, main__c1=0, nomsg=255, 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] [L147] COND TRUE !(init__r121 == 0) [L149] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, 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] [L151] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, 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] [L152] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, 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] [L1773] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, main__c1=0, nomsg=255, 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] [L1775] COND TRUE !(ep23 == 0) [L1777] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, 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] [L156] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, 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] [L157] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, 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] [L1750] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, main__c1=0, nomsg=255, 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] [L1752] COND TRUE !(ep31 == 0) [L1754] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, main__c1=0, nomsg=255, 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] [L161] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, main__c1=0, nomsg=255, 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] [L162] COND TRUE !(init__r231 == 0) [L164] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, main__c1=0, nomsg=255, 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] [L166] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, main__c1=0, nomsg=255, 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] [L167] COND TRUE !(init__r311 == 0) [L169] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, 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] [L171] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, 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] [L172] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, 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] [L1681] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, main__c1=0, nomsg=255, 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] [L1683] COND TRUE !(ep12 == 0) [L1685] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L176] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L177] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L179] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L181] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L183] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L185] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L187] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L189] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L191] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L193] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L195] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L197] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L199] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L201] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L203] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L205] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, nomsg=255, 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] [L207] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, nomsg=255, 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] [L209] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, nomsg=255, 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] [L211] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, 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] [L213] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, 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] [L215] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, 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] [L217] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nl2=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L229] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, main__c1=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND TRUE !(newmax3 == 0) [L237] init__tmp___5 = 1 [L238] __return_1248 = init__tmp___5 [L239] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=1, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, nomsg=255, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L240] COND TRUE main__i2 != 0 [L242] p12_old = nomsg [L243] p12_new = nomsg [L244] p13_old = nomsg [L245] p13_new = nomsg [L246] p21_old = nomsg [L247] p21_new = nomsg [L248] p23_old = nomsg [L249] p23_new = nomsg [L250] p31_old = nomsg [L251] p31_new = nomsg [L252] p32_old = nomsg [L253] p32_new = nomsg [L254] main__i2 = 0 [L256] _Bool node1__newmax; [L257] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(newmax1 == 0) [L270] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE p12_new == nomsg [L275] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode1 = 1 [L294] _Bool node2__newmax; [L295] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L296] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L317] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L319] COND TRUE !(newmax2 == 0) [L321] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L322] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L324] COND TRUE p23_new == nomsg [L326] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L328] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=0, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L330] mode2 = 1 [L332] _Bool node3__newmax; [L333] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L334] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE !(newmax3 == 0) [L346] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L349] COND TRUE p31_new == nomsg [L351] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=0, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=0, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=127, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=1, p23_old=255, p31=0, p31_new=0, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] mode3 = 1 [L369] p12_old = p12_new [L370] p12_new = nomsg [L371] p13_old = p13_new [L372] p13_new = nomsg [L373] p21_old = p21_new [L374] p21_new = nomsg [L375] p23_old = p23_new [L376] p23_new = nomsg [L377] p31_old = p31_new [L378] p31_new = nomsg [L379] p32_old = p32_new [L380] p32_new = nomsg [L382] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=0, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)r1) < 2 [L411] check__tmp = 1 [L412] __return_1394 = check__tmp [L413] main__c1 = __return_1394 [L415] _Bool __tmp_1; [L416] __tmp_1 = main__c1 [L417] _Bool assert__arg; [L418] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND FALSE !(assert__arg == 0) [L426] _Bool node1__newmax; [L427] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L428] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND FALSE !(r1 == 255) [L436] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=0, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L446] COND TRUE !(ep31 == 0) [L448] m1 = p31_old [L449] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=4, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int)max1) == ((int)id1) [L460] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L462] mode1 = 0 [L464] _Bool node2__newmax; [L465] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L466] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L468] COND FALSE !(r2 == 255) [L474] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=127, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L475] COND TRUE !(ep12 == 0) [L477] m2 = p12_old [L478] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=1, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] COND TRUE ((int)m2) > ((int)max2) [L481] max2 = m2 [L482] node2__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L484] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=5, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L493] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L494] COND FALSE !(((int)r2) == 2) [L500] mode2 = 0 [L502] _Bool node3__newmax; [L503] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L504] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L506] COND FALSE !(r3 == 255) [L512] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L513] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=1, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L522] COND TRUE !(ep23 == 0) [L524] m3 = p23_old [L525] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L526] COND TRUE ((int)m3) > ((int)max3) [L528] max3 = m3 [L529] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=6, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L531] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L532] COND FALSE !(((int)r3) == 2) [L538] mode3 = 0 [L539] p12_old = p12_new [L540] p12_new = nomsg [L541] p13_old = p13_new [L542] p13_new = nomsg [L543] p21_old = p21_new [L544] p21_new = nomsg [L545] p23_old = p23_new [L546] p23_new = nomsg [L547] p31_old = p31_new [L548] p31_new = nomsg [L549] p32_old = p32_new [L550] p32_new = nomsg [L552] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L555] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L557] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L559] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L561] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L567] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1206] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=1, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=0, node2__newmax=1, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L585] __return_1528 = check__tmp [L586] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=0, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L589] _Bool __tmp_2; [L590] __tmp_2 = main__c1 [L591] _Bool assert__arg; [L592] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=0, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=0, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L593] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=1, assert__arg=0, check__tmp=0, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=0, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L595] reach_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=0, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=1, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=127, m3=1, main__c1=0, main__i2=0, max1=127, max2=127, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=1, node2__newmax=1, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=255, p12=0, p12_new=255, p12_old=255, p13=0, p13_new=255, p13_old=255, p21=0, p21_new=255, p21_old=255, p23=0, p23_new=255, p23_old=255, p31=0, p31_new=255, p31_old=255, p32=0, p32_new=255, p32_old=255, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11819 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11819 mSDsluCounter, 23760 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10812 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 710 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 12948 mSDtfsCounter, 710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22491occurred in iteration=22, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 52598 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2793 NumberOfCodeBlocks, 2793 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 9784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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! [2022-01-11 00:57:46,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...