/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:53:32,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:53:32,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:53:32,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:53:32,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:53:32,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:53:32,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:53:32,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:53:32,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:53:32,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:53:32,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:53:32,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:53:32,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:53:32,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:53:32,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:53:32,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:53:32,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:53:32,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:53:32,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:53:32,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:53:32,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:53:32,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:53:32,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:53:32,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:53:32,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:53:32,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:53:32,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:53:32,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:53:32,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:53:32,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:53:32,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:53:32,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:53:32,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:53:32,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:53:32,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:53:32,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:53:32,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:53:32,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:53:32,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:53:32,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:53:32,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:53:32,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:53:32,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:53:32,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:53:32,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:53:32,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:53:32,735 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:53:32,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:53:32,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:53:32,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:53:32,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:53:32,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:53:32,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:53:32,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:53:32,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:53:32,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:53:32,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:53:32,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:53:32,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:53:32,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:53:32,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:53:32,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:53:32,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:53:32,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:53:32,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:53:32,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:53:32,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:53:32,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:53:32,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:53:32,741 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:53:32,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:53:32,741 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:53:32,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:53:33,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:53:33,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:53:33,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:53:33,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:53:33,032 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:53:33,034 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-27 15:53:33,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b02d5127/16e08e4272df4747aee14124ebf6446d/FLAG04a816519 [2019-12-27 15:53:33,720 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:53:33,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-27 15:53:33,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b02d5127/16e08e4272df4747aee14124ebf6446d/FLAG04a816519 [2019-12-27 15:53:33,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b02d5127/16e08e4272df4747aee14124ebf6446d [2019-12-27 15:53:33,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:53:33,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:53:33,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:33,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:53:33,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:53:33,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:33" (1/1) ... [2019-12-27 15:53:33,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:33, skipping insertion in model container [2019-12-27 15:53:33,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:33" (1/1) ... [2019-12-27 15:53:33,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:53:34,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:53:34,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:34,623 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:53:34,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:34,768 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:53:34,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34 WrapperNode [2019-12-27 15:53:34,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:34,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:34,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:53:34,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:53:34,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:34,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:53:34,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:53:34,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:53:34,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... [2019-12-27 15:53:34,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:53:34,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:53:34,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:53:34,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:53:34,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:53:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:53:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:53:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:53:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:53:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:53:34,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:53:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:53:34,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:53:34,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:53:34,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:53:34,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:53:34,960 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:53:35,612 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:53:35,613 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:53:35,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:35 BoogieIcfgContainer [2019-12-27 15:53:35,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:53:35,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:53:35,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:53:35,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:53:35,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:53:33" (1/3) ... [2019-12-27 15:53:35,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0a1d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:35, skipping insertion in model container [2019-12-27 15:53:35,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:34" (2/3) ... [2019-12-27 15:53:35,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0a1d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:35, skipping insertion in model container [2019-12-27 15:53:35,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:35" (3/3) ... [2019-12-27 15:53:35,625 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-12-27 15:53:35,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:53:35,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:53:35,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:53:35,649 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:53:35,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,694 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:35,815 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:53:35,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:53:35,840 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:53:35,840 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:53:35,840 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:53:35,841 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:53:35,841 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:53:35,841 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:53:35,841 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:53:35,858 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 15:53:35,860 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 15:53:35,944 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 15:53:35,944 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:35,958 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 15:53:35,978 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 15:53:36,021 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 15:53:36,021 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:36,027 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 15:53:36,040 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 15:53:36,042 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:53:41,094 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 15:53:41,443 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-27 15:53:41,443 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 15:53:41,447 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 15:53:41,970 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-27 15:53:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-27 15:53:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:53:41,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:41,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:53:41,977 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 15:53:41,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:41,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303204252] [2019-12-27 15:53:41,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:42,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303204252] [2019-12-27 15:53:42,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:42,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:42,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103844138] [2019-12-27 15:53:42,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:42,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:42,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:53:42,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:42,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:42,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:42,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:42,229 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-27 15:53:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:42,508 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-27 15:53:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:42,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:53:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:42,603 INFO L225 Difference]: With dead ends: 8760 [2019-12-27 15:53:42,603 INFO L226 Difference]: Without dead ends: 7798 [2019-12-27 15:53:42,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-27 15:53:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-27 15:53:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-27 15:53:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-27 15:53:43,085 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-27 15:53:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:43,085 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-27 15:53:43,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-27 15:53:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:53:43,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:43,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:43,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 15:53:43,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:43,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464527273] [2019-12-27 15:53:43,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:43,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464527273] [2019-12-27 15:53:43,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:43,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:43,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415273666] [2019-12-27 15:53:43,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:43,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:43,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:53:43,219 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:43,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:43,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:43,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:43,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:43,222 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-27 15:53:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:43,250 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-27 15:53:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:43,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:53:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:43,260 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 15:53:43,261 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 15:53:43,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 15:53:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 15:53:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 15:53:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-27 15:53:43,300 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-27 15:53:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:43,300 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-27 15:53:43,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-27 15:53:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:53:43,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:43,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:43,304 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:43,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 15:53:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:43,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076691706] [2019-12-27 15:53:43,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:43,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076691706] [2019-12-27 15:53:43,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:43,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:43,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008810021] [2019-12-27 15:53:43,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:43,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:43,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:53:43,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:43,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:43,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:53:43,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:53:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:43,498 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-27 15:53:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:43,781 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-27 15:53:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:53:43,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 15:53:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:43,792 INFO L225 Difference]: With dead ends: 1829 [2019-12-27 15:53:43,792 INFO L226 Difference]: Without dead ends: 1829 [2019-12-27 15:53:43,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:53:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-27 15:53:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-27 15:53:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-27 15:53:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-27 15:53:43,840 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-27 15:53:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:43,841 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-27 15:53:43,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:53:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-27 15:53:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:53:43,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:43,843 INFO L411 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] [2019-12-27 15:53:43,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-27 15:53:43,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:43,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690188310] [2019-12-27 15:53:43,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:44,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690188310] [2019-12-27 15:53:44,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:44,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:53:44,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443279949] [2019-12-27 15:53:44,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:44,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:44,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 15:53:44,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:44,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:44,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:53:44,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:53:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:53:44,102 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 8 states. [2019-12-27 15:53:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:44,895 INFO L93 Difference]: Finished difference Result 2218 states and 4789 transitions. [2019-12-27 15:53:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:53:44,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 15:53:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:44,908 INFO L225 Difference]: With dead ends: 2218 [2019-12-27 15:53:44,908 INFO L226 Difference]: Without dead ends: 2218 [2019-12-27 15:53:44,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:53:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-12-27 15:53:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1705. [2019-12-27 15:53:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-27 15:53:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-27 15:53:44,955 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-27 15:53:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:44,955 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-27 15:53:44,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:53:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-27 15:53:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:53:44,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:44,958 INFO L411 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] [2019-12-27 15:53:44,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 15:53:44,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:44,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651242272] [2019-12-27 15:53:44,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:45,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651242272] [2019-12-27 15:53:45,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:45,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:45,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478344052] [2019-12-27 15:53:45,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:45,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:45,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 15:53:45,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:45,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:45,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:45,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:45,026 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-27 15:53:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:45,040 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-27 15:53:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:45,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 15:53:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:45,050 INFO L225 Difference]: With dead ends: 1704 [2019-12-27 15:53:45,051 INFO L226 Difference]: Without dead ends: 1704 [2019-12-27 15:53:45,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-27 15:53:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-27 15:53:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 15:53:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-27 15:53:45,093 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-27 15:53:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:45,093 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-27 15:53:45,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-27 15:53:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:53:45,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:45,096 INFO L411 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] [2019-12-27 15:53:45,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 15:53:45,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:45,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431326789] [2019-12-27 15:53:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:45,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431326789] [2019-12-27 15:53:45,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:45,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:45,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726179604] [2019-12-27 15:53:45,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:45,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:45,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 15:53:45,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:45,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:53:45,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:53:45,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:45,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:53:45,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:53:45,168 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-27 15:53:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:45,211 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-27 15:53:45,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:53:45,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 15:53:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:45,220 INFO L225 Difference]: With dead ends: 2700 [2019-12-27 15:53:45,220 INFO L226 Difference]: Without dead ends: 1250 [2019-12-27 15:53:45,221 INFO L631 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 [2019-12-27 15:53:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-27 15:53:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-27 15:53:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-27 15:53:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-27 15:53:45,256 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-27 15:53:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:45,256 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-27 15:53:45,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:53:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-27 15:53:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:53:45,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:45,259 INFO L411 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] [2019-12-27 15:53:45,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 15:53:45,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:45,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241160612] [2019-12-27 15:53:45,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:45,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241160612] [2019-12-27 15:53:45,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:53:45,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [211287964] [2019-12-27 15:53:45,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:45,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:45,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 15:53:45,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:45,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:53:45,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:53:45,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:53:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:53:45,471 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 8 states. [2019-12-27 15:53:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:46,364 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-27 15:53:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:53:46,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 15:53:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:46,373 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 15:53:46,374 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 15:53:46,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:53:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 15:53:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-27 15:53:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 15:53:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-27 15:53:46,413 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-27 15:53:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:46,414 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-27 15:53:46,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:53:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-27 15:53:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:53:46,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:46,417 INFO L411 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] [2019-12-27 15:53:46,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 15:53:46,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:46,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114322925] [2019-12-27 15:53:46,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:46,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114322925] [2019-12-27 15:53:46,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:46,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:46,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808568877] [2019-12-27 15:53:46,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:46,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:46,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 15:53:46,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:46,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:53:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:53:46,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:53:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:46,501 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 5 states. [2019-12-27 15:53:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:46,525 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 15:53:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 15:53:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:46,533 INFO L225 Difference]: With dead ends: 921 [2019-12-27 15:53:46,533 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 15:53:46,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 15:53:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 15:53:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 15:53:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 15:53:46,555 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 15:53:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:46,555 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 15:53:46,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:53:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 15:53:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:53:46,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:46,560 INFO L411 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] [2019-12-27 15:53:46,560 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-27 15:53:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:46,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913759798] [2019-12-27 15:53:46,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:46,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913759798] [2019-12-27 15:53:46,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:46,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:53:46,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626137441] [2019-12-27 15:53:46,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:46,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:46,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 164 transitions. [2019-12-27 15:53:46,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:46,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:53:46,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:53:46,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:53:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:53:46,850 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 9 states. [2019-12-27 15:53:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:47,192 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 15:53:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:53:47,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 15:53:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:47,196 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 15:53:47,196 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 15:53:47,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:53:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 15:53:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 15:53:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 15:53:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 15:53:47,225 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-27 15:53:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:47,225 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 15:53:47,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:53:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 15:53:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:53:47,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:47,230 INFO L411 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] [2019-12-27 15:53:47,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-27 15:53:47,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353333057] [2019-12-27 15:53:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:47,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353333057] [2019-12-27 15:53:47,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:47,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:53:47,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249161759] [2019-12-27 15:53:47,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:47,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:47,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 163 transitions. [2019-12-27 15:53:47,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:53:47,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:53:47,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:53:47,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:53:47,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:53:47,625 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 10 states. [2019-12-27 15:53:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:48,524 INFO L93 Difference]: Finished difference Result 1157 states and 2371 transitions. [2019-12-27 15:53:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:53:48,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 15:53:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:48,528 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 15:53:48,529 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 15:53:48,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:53:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 15:53:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 838. [2019-12-27 15:53:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-27 15:53:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1748 transitions. [2019-12-27 15:53:48,548 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1748 transitions. Word has length 50 [2019-12-27 15:53:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:48,548 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1748 transitions. [2019-12-27 15:53:48,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:53:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1748 transitions. [2019-12-27 15:53:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 15:53:48,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:48,551 INFO L411 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] [2019-12-27 15:53:48,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-27 15:53:48,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:48,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514125541] [2019-12-27 15:53:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:48,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514125541] [2019-12-27 15:53:48,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:48,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:48,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [622293336] [2019-12-27 15:53:48,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:48,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:48,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 141 transitions. [2019-12-27 15:53:48,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:48,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:48,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:48,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:48,785 INFO L87 Difference]: Start difference. First operand 838 states and 1748 transitions. Second operand 3 states. [2019-12-27 15:53:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:48,833 INFO L93 Difference]: Finished difference Result 1111 states and 2324 transitions. [2019-12-27 15:53:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:48,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 15:53:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:48,838 INFO L225 Difference]: With dead ends: 1111 [2019-12-27 15:53:48,839 INFO L226 Difference]: Without dead ends: 1111 [2019-12-27 15:53:48,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2019-12-27 15:53:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 895. [2019-12-27 15:53:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 15:53:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1884 transitions. [2019-12-27 15:53:48,857 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1884 transitions. Word has length 50 [2019-12-27 15:53:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:48,858 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1884 transitions. [2019-12-27 15:53:48,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1884 transitions. [2019-12-27 15:53:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 15:53:48,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:48,861 INFO L411 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] [2019-12-27 15:53:48,861 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-27 15:53:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:48,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098109674] [2019-12-27 15:53:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:48,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098109674] [2019-12-27 15:53:48,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:48,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:48,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166096408] [2019-12-27 15:53:48,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:48,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:49,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 166 transitions. [2019-12-27 15:53:49,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:49,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:49,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:49,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:49,011 INFO L87 Difference]: Start difference. First operand 895 states and 1884 transitions. Second operand 3 states. [2019-12-27 15:53:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:49,022 INFO L93 Difference]: Finished difference Result 894 states and 1882 transitions. [2019-12-27 15:53:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:49,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 15:53:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:49,026 INFO L225 Difference]: With dead ends: 894 [2019-12-27 15:53:49,026 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 15:53:49,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 15:53:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 800. [2019-12-27 15:53:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 15:53:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1704 transitions. [2019-12-27 15:53:49,042 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1704 transitions. Word has length 51 [2019-12-27 15:53:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:49,042 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1704 transitions. [2019-12-27 15:53:49,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1704 transitions. [2019-12-27 15:53:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 15:53:49,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:49,045 INFO L411 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] [2019-12-27 15:53:49,045 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-27 15:53:49,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:49,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937194919] [2019-12-27 15:53:49,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:49,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:53:49,153 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:53:49,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t305~0.offset_19|) (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= (select .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27|) 0) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t305~0.base_27|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t305~0.base_27| 4)) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27| 1)) (= v_~y~0_150 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27|) |v_ULTIMATE.start_main_~#t305~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t305~0.offset=|v_ULTIMATE.start_main_~#t305~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_~#t305~0.base=|v_ULTIMATE.start_main_~#t305~0.base_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t305~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t305~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t306~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t306~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:53:49,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t306~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t306~0.base_10|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10| 1) |v_#valid_19|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10|) |v_ULTIMATE.start_main_~#t306~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t306~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t306~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t306~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t306~0.offset] because there is no mapped edge [2019-12-27 15:53:49,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff0_thd1~0_Out2037204824 1) (= ~y$r_buff1_thd2~0_Out2037204824 ~y$r_buff0_thd2~0_In2037204824) (= ~y$r_buff1_thd0~0_Out2037204824 ~y$r_buff0_thd0~0_In2037204824) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2037204824 0)) (= ~x~0_In2037204824 ~__unbuffered_p0_EAX~0_Out2037204824) (= ~y$r_buff0_thd1~0_In2037204824 ~y$r_buff1_thd1~0_Out2037204824)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2037204824, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2037204824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2037204824, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2037204824, ~x~0=~x~0_In2037204824} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2037204824, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2037204824, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2037204824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2037204824, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2037204824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2037204824, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2037204824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2037204824, ~x~0=~x~0_In2037204824} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 15:53:49,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-459757536 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-459757536 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-459757536|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-459757536 |P0Thread1of1ForFork0_#t~ite5_Out-459757536|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-459757536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-459757536} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-459757536|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-459757536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-459757536} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 15:53:49,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-711726031 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-711726031 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-711726031 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-711726031 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-711726031 |P0Thread1of1ForFork0_#t~ite6_Out-711726031|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-711726031|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-711726031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-711726031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-711726031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-711726031} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-711726031|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-711726031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-711726031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-711726031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-711726031} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 15:53:49,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1768948669 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1768948669 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1768948669) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1768948669 ~y$r_buff0_thd1~0_Out-1768948669) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768948669, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1768948669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768948669, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1768948669|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1768948669} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:53:49,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1457280941 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1457280941 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1457280941 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1457280941 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1457280941| ~y$r_buff1_thd1~0_In-1457280941) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1457280941|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1457280941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457280941, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1457280941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457280941} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1457280941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457280941, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1457280941|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1457280941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457280941} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 15:53:49,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:53:49,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2040877199 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2040877199 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-2040877199 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-2040877199 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2040877199 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out-2040877199| |P1Thread1of1ForFork1_#t~ite17_Out-2040877199|) (= ~y$w_buff1~0_In-2040877199 |P1Thread1of1ForFork1_#t~ite17_Out-2040877199|)) (and (not .cse0) (= ~y$w_buff1~0_In-2040877199 |P1Thread1of1ForFork1_#t~ite18_Out-2040877199|) (= |P1Thread1of1ForFork1_#t~ite17_In-2040877199| |P1Thread1of1ForFork1_#t~ite17_Out-2040877199|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2040877199, ~y$w_buff1~0=~y$w_buff1~0_In-2040877199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199, ~weak$$choice2~0=~weak$$choice2~0_In-2040877199, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-2040877199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040877199} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2040877199, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-2040877199|, ~y$w_buff1~0=~y$w_buff1~0_In-2040877199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199, ~weak$$choice2~0=~weak$$choice2~0_In-2040877199, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-2040877199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040877199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 15:53:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-527211846 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-527211846| ~y$w_buff0_used~0_In-527211846) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-527211846| |P1Thread1of1ForFork1_#t~ite20_Out-527211846|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-527211846| |P1Thread1of1ForFork1_#t~ite21_Out-527211846|) (= |P1Thread1of1ForFork1_#t~ite20_Out-527211846| ~y$w_buff0_used~0_In-527211846) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-527211846 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-527211846 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-527211846 256))) (= 0 (mod ~y$w_buff0_used~0_In-527211846 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527211846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527211846, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-527211846|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527211846, ~weak$$choice2~0=~weak$$choice2~0_In-527211846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527211846} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527211846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527211846, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-527211846|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527211846, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-527211846|, ~weak$$choice2~0=~weak$$choice2~0_In-527211846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527211846} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 15:53:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-366257062 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-366257062| |P1Thread1of1ForFork1_#t~ite23_Out-366257062|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-366257062 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-366257062 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-366257062 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-366257062 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-366257062| |P1Thread1of1ForFork1_#t~ite22_Out-366257062|) (or (and (= ~y$w_buff1_used~0_In-366257062 |P1Thread1of1ForFork1_#t~ite23_Out-366257062|) .cse0 (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_In-366257062| |P1Thread1of1ForFork1_#t~ite23_Out-366257062|) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite24_Out-366257062| ~y$w_buff1_used~0_In-366257062)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite22_Out-366257062| |P1Thread1of1ForFork1_#t~ite23_Out-366257062|) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out-366257062| 0) (or .cse6 (not .cse1)) (not .cse4))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366257062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366257062, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366257062, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-366257062|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-366257062|, ~weak$$choice2~0=~weak$$choice2~0_In-366257062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366257062} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366257062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366257062, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366257062, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-366257062|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-366257062|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-366257062|, ~weak$$choice2~0=~weak$$choice2~0_In-366257062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366257062} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 15:53:49,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:53:49,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1775114838 256) 0))) (or (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-1775114838 256) 0)))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out-1775114838| 0) (or (not (= (mod ~y$w_buff1_used~0_In-1775114838 256) 0)) .cse1) (not (= (mod ~y$w_buff0_used~0_In-1775114838 256) 0)) (= |P1Thread1of1ForFork1_#t~ite29_Out-1775114838| |P1Thread1of1ForFork1_#t~ite30_Out-1775114838|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1775114838| |P1Thread1of1ForFork1_#t~ite28_Out-1775114838|) (or (not (= (mod ~y$r_buff1_thd2~0_In-1775114838 256) 0)) .cse1))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_In-1775114838| |P1Thread1of1ForFork1_#t~ite28_Out-1775114838|) (= |P1Thread1of1ForFork1_#t~ite29_In-1775114838| |P1Thread1of1ForFork1_#t~ite29_Out-1775114838|) (= ~y$r_buff1_thd2~0_In-1775114838 |P1Thread1of1ForFork1_#t~ite30_Out-1775114838|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1775114838|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1775114838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1775114838, ~weak$$choice2~0=~weak$$choice2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1775114838|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1775114838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1775114838|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1775114838|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1775114838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1775114838, ~weak$$choice2~0=~weak$$choice2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1775114838|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1775114838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:53:49,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 15:53:49,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In1520118846 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1520118846 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1520118846| |P1Thread1of1ForFork1_#t~ite33_Out1520118846|))) (or (and (= ~y~0_In1520118846 |P1Thread1of1ForFork1_#t~ite32_Out1520118846|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1520118846| ~y$w_buff1~0_In1520118846)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1520118846, ~y$w_buff1~0=~y$w_buff1~0_In1520118846, ~y~0=~y~0_In1520118846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520118846} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1520118846, ~y$w_buff1~0=~y$w_buff1~0_In1520118846, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1520118846|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1520118846|, ~y~0=~y~0_In1520118846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520118846} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 15:53:49,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-223354091 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-223354091 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-223354091| ~y$w_buff0_used~0_In-223354091)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-223354091| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-223354091, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-223354091} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-223354091, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-223354091, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-223354091|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 15:53:49,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1185511741 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1185511741 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1185511741 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1185511741 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1185511741|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1185511741 |P1Thread1of1ForFork1_#t~ite35_Out-1185511741|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1185511741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185511741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1185511741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185511741} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1185511741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185511741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1185511741, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1185511741|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185511741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 15:53:49,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1394281640 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1394281640 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1394281640 |P1Thread1of1ForFork1_#t~ite36_Out1394281640|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1394281640| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1394281640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394281640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1394281640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394281640, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1394281640|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 15:53:49,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-364613894 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-364613894 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-364613894 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-364613894 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-364613894|)) (and (= ~y$r_buff1_thd2~0_In-364613894 |P1Thread1of1ForFork1_#t~ite37_Out-364613894|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-364613894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-364613894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-364613894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-364613894} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-364613894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-364613894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-364613894, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-364613894|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-364613894} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 15:53:49,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 15:53:49,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 15:53:49,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In452000607 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In452000607 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out452000607| ~y$w_buff1~0_In452000607) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out452000607| ~y~0_In452000607)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In452000607, ~y~0=~y~0_In452000607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out452000607|, ~y$w_buff1~0=~y$w_buff1~0_In452000607, ~y~0=~y~0_In452000607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 15:53:49,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 15:53:49,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-982319319 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-982319319 256) 0))) (or (and (= ~y$w_buff0_used~0_In-982319319 |ULTIMATE.start_main_#t~ite42_Out-982319319|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-982319319|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-982319319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-982319319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-982319319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-982319319, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-982319319|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 15:53:49,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1332296858 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1332296858 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1332296858 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1332296858 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1332296858 |ULTIMATE.start_main_#t~ite43_Out1332296858|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1332296858|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1332296858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1332296858, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1332296858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332296858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1332296858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1332296858, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1332296858|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1332296858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332296858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 15:53:49,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1807323310 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1807323310 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1807323310 |ULTIMATE.start_main_#t~ite44_Out1807323310|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1807323310|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1807323310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1807323310} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1807323310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1807323310, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1807323310|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 15:53:49,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1155599383 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1155599383 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1155599383 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1155599383 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1155599383| ~y$r_buff1_thd0~0_In1155599383) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1155599383|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1155599383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1155599383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1155599383, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1155599383} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1155599383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1155599383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1155599383, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1155599383|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1155599383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 15:53:49,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:53:49,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:53:49 BasicIcfg [2019-12-27 15:53:49,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:53:49,256 INFO L168 Benchmark]: Toolchain (without parser) took 15316.01 ms. Allocated memory was 141.6 MB in the beginning and 498.1 MB in the end (delta: 356.5 MB). Free memory was 102.4 MB in the beginning and 82.8 MB in the end (delta: 19.6 MB). Peak memory consumption was 376.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,257 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.96 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 102.0 MB in the beginning and 158.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,260 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,261 INFO L168 Benchmark]: RCFGBuilder took 733.40 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,265 INFO L168 Benchmark]: TraceAbstraction took 13637.70 ms. Allocated memory was 203.9 MB in the beginning and 498.1 MB in the end (delta: 294.1 MB). Free memory was 109.0 MB in the beginning and 82.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 320.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:49,272 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.96 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 102.0 MB in the beginning and 158.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.40 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13637.70 ms. Allocated memory was 203.9 MB in the beginning and 498.1 MB in the end (delta: 294.1 MB). Free memory was 109.0 MB in the beginning and 82.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 320.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1442 SDtfs, 1462 SDslu, 3332 SDs, 0 SdLazy, 2296 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1770 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 42637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...