/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:26:12,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:26:12,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:26:12,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:26:12,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:26:12,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:26:12,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:26:12,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:26:12,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:26:12,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:26:12,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:26:12,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:26:12,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:26:12,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:26:12,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:26:12,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:26:12,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:26:12,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:26:12,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:26:12,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:26:12,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:26:12,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:26:12,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:26:12,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:26:12,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:26:12,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:26:12,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:26:12,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:26:12,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:26:12,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:26:12,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:26:12,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:26:12,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:26:12,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:26:12,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:26:12,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:26:12,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:26:12,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:26:12,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:26:12,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:26:12,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:26:12,771 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-VariableLbe.epf [2019-12-27 06:26:12,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:26:12,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:26:12,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:26:12,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:26:12,787 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:26:12,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:26:12,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:26:12,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:26:12,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:26:12,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:26:12,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:26:12,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:26:12,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:26:12,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:26:12,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:26:12,789 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:26:12,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:26:12,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:26:12,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:26:12,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:26:12,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:26:12,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:26:12,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:26:12,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:26:12,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:26:12,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:26:12,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:26:12,791 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:26:12,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:26:12,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:26:13,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:26:13,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:26:13,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:26:13,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:26:13,088 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:26:13,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-27 06:26:13,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fefb6d6a/08a9e705993d4fc6829358474e28a601/FLAG2233cbe20 [2019-12-27 06:26:13,758 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:26:13,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-27 06:26:13,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fefb6d6a/08a9e705993d4fc6829358474e28a601/FLAG2233cbe20 [2019-12-27 06:26:14,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fefb6d6a/08a9e705993d4fc6829358474e28a601 [2019-12-27 06:26:14,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:26:14,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:26:14,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:26:14,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:26:14,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:26:14,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117117bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14, skipping insertion in model container [2019-12-27 06:26:14,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:26:14,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:26:14,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:26:14,654 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:26:14,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:26:14,830 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:26:14,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14 WrapperNode [2019-12-27 06:26:14,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:26:14,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:26:14,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:26:14,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:26:14,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:26:14,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:26:14,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:26:14,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:26:14,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (1/1) ... [2019-12-27 06:26:14,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:26:14,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:26:14,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:26:14,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:26:14,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (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 06:26:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:26:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:26:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:26:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:26:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:26:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:26:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:26:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:26:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:26:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:26:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:26:15,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:26:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:26:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:26:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:26:15,009 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 06:26:15,745 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:26:15,745 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:26:15,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:26:15 BoogieIcfgContainer [2019-12-27 06:26:15,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:26:15,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:26:15,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:26:15,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:26:15,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:26:14" (1/3) ... [2019-12-27 06:26:15,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b1441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:26:15, skipping insertion in model container [2019-12-27 06:26:15,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:26:14" (2/3) ... [2019-12-27 06:26:15,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b1441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:26:15, skipping insertion in model container [2019-12-27 06:26:15,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:26:15" (3/3) ... [2019-12-27 06:26:15,760 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_rmo.opt.i [2019-12-27 06:26:15,773 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:26:15,773 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:26:15,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:26:15,785 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:26:15,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,872 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,872 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,872 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,873 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,873 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,901 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,902 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,907 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,909 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,909 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:26:15,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:26:15,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:26:15,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:26:15,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:26:15,946 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:26:15,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:26:15,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:26:15,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:26:15,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:26:15,963 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-27 06:26:15,965 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 06:26:16,063 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 06:26:16,064 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:26:16,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:26:16,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 06:26:16,152 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 06:26:16,152 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:26:16,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:26:16,175 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:26:16,176 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:26:19,199 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 06:26:19,745 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:26:19,860 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:26:20,215 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:26:20,347 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:26:20,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50510 [2019-12-27 06:26:20,370 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 06:26:20,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-27 06:26:22,571 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 30990 states. [2019-12-27 06:26:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30990 states. [2019-12-27 06:26:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:26:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:22,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:26:22,581 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1670049475, now seen corresponding path program 1 times [2019-12-27 06:26:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997569385] [2019-12-27 06:26:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:22,914 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 06:26:22,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997569385] [2019-12-27 06:26:22,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:22,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:26:22,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630750208] [2019-12-27 06:26:22,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:22,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:22,951 INFO L87 Difference]: Start difference. First operand 30990 states. Second operand 3 states. [2019-12-27 06:26:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:23,694 INFO L93 Difference]: Finished difference Result 29806 states and 128112 transitions. [2019-12-27 06:26:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:23,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:26:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:24,038 INFO L225 Difference]: With dead ends: 29806 [2019-12-27 06:26:24,044 INFO L226 Difference]: Without dead ends: 28014 [2019-12-27 06:26:24,046 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 06:26:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-27 06:26:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 28014. [2019-12-27 06:26:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28014 states. [2019-12-27 06:26:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28014 states to 28014 states and 120256 transitions. [2019-12-27 06:26:26,771 INFO L78 Accepts]: Start accepts. Automaton has 28014 states and 120256 transitions. Word has length 9 [2019-12-27 06:26:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:26,772 INFO L462 AbstractCegarLoop]: Abstraction has 28014 states and 120256 transitions. [2019-12-27 06:26:26,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 28014 states and 120256 transitions. [2019-12-27 06:26:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:26:26,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:26,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:26:26,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 165441832, now seen corresponding path program 1 times [2019-12-27 06:26:26,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:26,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573938242] [2019-12-27 06:26:26,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:26,867 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 06:26:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573938242] [2019-12-27 06:26:26,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:26,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:26:26,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462775245] [2019-12-27 06:26:26,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:26,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:26,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:26,871 INFO L87 Difference]: Start difference. First operand 28014 states and 120256 transitions. Second operand 3 states. [2019-12-27 06:26:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:27,325 INFO L93 Difference]: Finished difference Result 22347 states and 89103 transitions. [2019-12-27 06:26:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:27,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:26:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:28,844 INFO L225 Difference]: With dead ends: 22347 [2019-12-27 06:26:28,844 INFO L226 Difference]: Without dead ends: 22347 [2019-12-27 06:26:28,846 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 06:26:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-12-27 06:26:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 22347. [2019-12-27 06:26:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22347 states. [2019-12-27 06:26:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22347 states to 22347 states and 89103 transitions. [2019-12-27 06:26:30,023 INFO L78 Accepts]: Start accepts. Automaton has 22347 states and 89103 transitions. Word has length 15 [2019-12-27 06:26:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:30,023 INFO L462 AbstractCegarLoop]: Abstraction has 22347 states and 89103 transitions. [2019-12-27 06:26:30,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22347 states and 89103 transitions. [2019-12-27 06:26:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:26:30,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:30,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:26:30,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1942943562, now seen corresponding path program 1 times [2019-12-27 06:26:30,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:30,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811154664] [2019-12-27 06:26:30,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:30,139 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 06:26:30,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811154664] [2019-12-27 06:26:30,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:30,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:26:30,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639104174] [2019-12-27 06:26:30,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:26:30,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:26:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:26:30,142 INFO L87 Difference]: Start difference. First operand 22347 states and 89103 transitions. Second operand 4 states. [2019-12-27 06:26:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:30,227 INFO L93 Difference]: Finished difference Result 10229 states and 34571 transitions. [2019-12-27 06:26:30,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:26:30,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:26:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:30,265 INFO L225 Difference]: With dead ends: 10229 [2019-12-27 06:26:30,266 INFO L226 Difference]: Without dead ends: 10229 [2019-12-27 06:26:30,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:26:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10229 states. [2019-12-27 06:26:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10229 to 10229. [2019-12-27 06:26:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2019-12-27 06:26:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 34571 transitions. [2019-12-27 06:26:30,573 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 34571 transitions. Word has length 16 [2019-12-27 06:26:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:30,574 INFO L462 AbstractCegarLoop]: Abstraction has 10229 states and 34571 transitions. [2019-12-27 06:26:30,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:26:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 34571 transitions. [2019-12-27 06:26:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:26:30,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:30,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:26:30,577 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1127389089, now seen corresponding path program 1 times [2019-12-27 06:26:30,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:30,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320889624] [2019-12-27 06:26:30,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:30,623 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 06:26:30,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320889624] [2019-12-27 06:26:30,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:30,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:26:30,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188775450] [2019-12-27 06:26:30,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:26:30,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:26:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:26:30,626 INFO L87 Difference]: Start difference. First operand 10229 states and 34571 transitions. Second operand 5 states. [2019-12-27 06:26:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:30,683 INFO L93 Difference]: Finished difference Result 2968 states and 9107 transitions. [2019-12-27 06:26:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:26:30,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:26:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:30,697 INFO L225 Difference]: With dead ends: 2968 [2019-12-27 06:26:30,697 INFO L226 Difference]: Without dead ends: 2968 [2019-12-27 06:26:30,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 06:26:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-12-27 06:26:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2019-12-27 06:26:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-27 06:26:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 9107 transitions. [2019-12-27 06:26:30,758 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 9107 transitions. Word has length 17 [2019-12-27 06:26:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:30,759 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 9107 transitions. [2019-12-27 06:26:30,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:26:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 9107 transitions. [2019-12-27 06:26:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:26:30,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:30,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:26:30,762 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash 506293938, now seen corresponding path program 1 times [2019-12-27 06:26:30,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:30,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729571532] [2019-12-27 06:26:30,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:30,817 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 06:26:30,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729571532] [2019-12-27 06:26:30,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:30,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:26:30,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120119020] [2019-12-27 06:26:30,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:26:30,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:26:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:26:30,820 INFO L87 Difference]: Start difference. First operand 2968 states and 9107 transitions. Second operand 4 states. [2019-12-27 06:26:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:30,993 INFO L93 Difference]: Finished difference Result 3751 states and 11312 transitions. [2019-12-27 06:26:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:26:30,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:26:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:31,005 INFO L225 Difference]: With dead ends: 3751 [2019-12-27 06:26:31,005 INFO L226 Difference]: Without dead ends: 3751 [2019-12-27 06:26:31,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:26:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-12-27 06:26:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3583. [2019-12-27 06:26:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-27 06:26:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 10934 transitions. [2019-12-27 06:26:31,098 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 10934 transitions. Word has length 18 [2019-12-27 06:26:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:31,098 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 10934 transitions. [2019-12-27 06:26:31,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:26:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 10934 transitions. [2019-12-27 06:26:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:26:31,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:31,107 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] [2019-12-27 06:26:31,107 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1112111079, now seen corresponding path program 1 times [2019-12-27 06:26:31,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:31,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960632827] [2019-12-27 06:26:31,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:31,168 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 06:26:31,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960632827] [2019-12-27 06:26:31,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:31,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:26:31,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520479090] [2019-12-27 06:26:31,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:26:31,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:26:31,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:26:31,170 INFO L87 Difference]: Start difference. First operand 3583 states and 10934 transitions. Second operand 4 states. [2019-12-27 06:26:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:31,211 INFO L93 Difference]: Finished difference Result 5481 states and 15973 transitions. [2019-12-27 06:26:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:26:31,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-27 06:26:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:31,223 INFO L225 Difference]: With dead ends: 5481 [2019-12-27 06:26:31,223 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 06:26:31,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:26:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 06:26:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3575. [2019-12-27 06:26:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3575 states. [2019-12-27 06:26:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 10798 transitions. [2019-12-27 06:26:31,303 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 10798 transitions. Word has length 32 [2019-12-27 06:26:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:31,303 INFO L462 AbstractCegarLoop]: Abstraction has 3575 states and 10798 transitions. [2019-12-27 06:26:31,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:26:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 10798 transitions. [2019-12-27 06:26:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:26:31,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:31,315 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] [2019-12-27 06:26:31,315 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1047758670, now seen corresponding path program 1 times [2019-12-27 06:26:31,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:31,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960545896] [2019-12-27 06:26:31,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:31,364 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 06:26:31,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960545896] [2019-12-27 06:26:31,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:31,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:26:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582265931] [2019-12-27 06:26:31,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:31,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:31,367 INFO L87 Difference]: Start difference. First operand 3575 states and 10798 transitions. Second operand 3 states. [2019-12-27 06:26:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:31,451 INFO L93 Difference]: Finished difference Result 5225 states and 15665 transitions. [2019-12-27 06:26:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:31,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:26:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:31,532 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 06:26:31,532 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 06:26:31,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 06:26:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4249. [2019-12-27 06:26:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4249 states. [2019-12-27 06:26:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 12995 transitions. [2019-12-27 06:26:31,627 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 12995 transitions. Word has length 32 [2019-12-27 06:26:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:31,627 INFO L462 AbstractCegarLoop]: Abstraction has 4249 states and 12995 transitions. [2019-12-27 06:26:31,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 12995 transitions. [2019-12-27 06:26:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:26:31,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:31,639 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] [2019-12-27 06:26:31,640 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1443701580, now seen corresponding path program 1 times [2019-12-27 06:26:31,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:31,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815133234] [2019-12-27 06:26:31,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:31,711 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 06:26:31,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815133234] [2019-12-27 06:26:31,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:31,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:26:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660272832] [2019-12-27 06:26:31,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:31,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:31,713 INFO L87 Difference]: Start difference. First operand 4249 states and 12995 transitions. Second operand 3 states. [2019-12-27 06:26:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:31,763 INFO L93 Difference]: Finished difference Result 5225 states and 15251 transitions. [2019-12-27 06:26:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:31,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:26:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:31,774 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 06:26:31,774 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 06:26:31,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 06:26:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4213. [2019-12-27 06:26:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2019-12-27 06:26:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 12512 transitions. [2019-12-27 06:26:31,872 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 12512 transitions. Word has length 32 [2019-12-27 06:26:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:31,873 INFO L462 AbstractCegarLoop]: Abstraction has 4213 states and 12512 transitions. [2019-12-27 06:26:31,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 12512 transitions. [2019-12-27 06:26:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:26:31,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:31,886 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] [2019-12-27 06:26:31,886 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash 121864036, now seen corresponding path program 1 times [2019-12-27 06:26:31,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:31,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456285409] [2019-12-27 06:26:31,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:31,956 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 06:26:31,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456285409] [2019-12-27 06:26:31,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:31,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:26:31,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113663484] [2019-12-27 06:26:31,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:26:31,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:26:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:26:31,959 INFO L87 Difference]: Start difference. First operand 4213 states and 12512 transitions. Second operand 6 states. [2019-12-27 06:26:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:32,019 INFO L93 Difference]: Finished difference Result 3178 states and 9948 transitions. [2019-12-27 06:26:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:26:32,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 06:26:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:32,027 INFO L225 Difference]: With dead ends: 3178 [2019-12-27 06:26:32,027 INFO L226 Difference]: Without dead ends: 2924 [2019-12-27 06:26:32,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:26:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-27 06:26:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2744. [2019-12-27 06:26:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-27 06:26:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 8606 transitions. [2019-12-27 06:26:32,083 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 8606 transitions. Word has length 32 [2019-12-27 06:26:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:32,083 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 8606 transitions. [2019-12-27 06:26:32,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:26:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 8606 transitions. [2019-12-27 06:26:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:26:32,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:32,092 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] [2019-12-27 06:26:32,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash 992352402, now seen corresponding path program 1 times [2019-12-27 06:26:32,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:32,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053689760] [2019-12-27 06:26:32,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:32,170 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 06:26:32,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053689760] [2019-12-27 06:26:32,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:32,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:26:32,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728337690] [2019-12-27 06:26:32,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:32,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:32,172 INFO L87 Difference]: Start difference. First operand 2744 states and 8606 transitions. Second operand 3 states. [2019-12-27 06:26:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:32,195 INFO L93 Difference]: Finished difference Result 4096 states and 12179 transitions. [2019-12-27 06:26:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:32,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 06:26:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:32,198 INFO L225 Difference]: With dead ends: 4096 [2019-12-27 06:26:32,198 INFO L226 Difference]: Without dead ends: 1418 [2019-12-27 06:26:32,198 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 06:26:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-12-27 06:26:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2019-12-27 06:26:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 06:26:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3722 transitions. [2019-12-27 06:26:32,222 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3722 transitions. Word has length 47 [2019-12-27 06:26:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:32,223 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 3722 transitions. [2019-12-27 06:26:32,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3722 transitions. [2019-12-27 06:26:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:26:32,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:32,228 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] [2019-12-27 06:26:32,228 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2081953324, now seen corresponding path program 2 times [2019-12-27 06:26:32,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:32,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756503479] [2019-12-27 06:26:32,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:32,339 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 06:26:32,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756503479] [2019-12-27 06:26:32,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:32,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:26:32,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67348786] [2019-12-27 06:26:32,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:26:32,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:26:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:26:32,341 INFO L87 Difference]: Start difference. First operand 1418 states and 3722 transitions. Second operand 7 states. [2019-12-27 06:26:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:32,595 INFO L93 Difference]: Finished difference Result 3765 states and 9849 transitions. [2019-12-27 06:26:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:26:32,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 06:26:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:32,600 INFO L225 Difference]: With dead ends: 3765 [2019-12-27 06:26:32,600 INFO L226 Difference]: Without dead ends: 2471 [2019-12-27 06:26:32,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:26:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-12-27 06:26:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 1595. [2019-12-27 06:26:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 06:26:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 4164 transitions. [2019-12-27 06:26:32,632 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 4164 transitions. Word has length 47 [2019-12-27 06:26:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:32,633 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 4164 transitions. [2019-12-27 06:26:32,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:26:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 4164 transitions. [2019-12-27 06:26:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:26:32,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:32,637 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] [2019-12-27 06:26:32,637 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1032275112, now seen corresponding path program 3 times [2019-12-27 06:26:32,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:32,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454136474] [2019-12-27 06:26:32,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:32,897 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 06:26:32,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454136474] [2019-12-27 06:26:32,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:32,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:26:32,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200839676] [2019-12-27 06:26:32,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:26:32,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:26:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:26:32,899 INFO L87 Difference]: Start difference. First operand 1595 states and 4164 transitions. Second operand 9 states. [2019-12-27 06:26:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:34,241 INFO L93 Difference]: Finished difference Result 2819 states and 7017 transitions. [2019-12-27 06:26:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:26:34,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-27 06:26:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:34,246 INFO L225 Difference]: With dead ends: 2819 [2019-12-27 06:26:34,246 INFO L226 Difference]: Without dead ends: 2783 [2019-12-27 06:26:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:26:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2019-12-27 06:26:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 1679. [2019-12-27 06:26:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2019-12-27 06:26:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 4227 transitions. [2019-12-27 06:26:34,286 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 4227 transitions. Word has length 47 [2019-12-27 06:26:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:34,286 INFO L462 AbstractCegarLoop]: Abstraction has 1679 states and 4227 transitions. [2019-12-27 06:26:34,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:26:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 4227 transitions. [2019-12-27 06:26:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:26:34,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:34,291 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] [2019-12-27 06:26:34,291 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash 650117112, now seen corresponding path program 4 times [2019-12-27 06:26:34,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:34,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163887812] [2019-12-27 06:26:34,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:34,400 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 06:26:34,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163887812] [2019-12-27 06:26:34,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:34,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:26:34,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706328095] [2019-12-27 06:26:34,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:26:34,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:26:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:26:34,403 INFO L87 Difference]: Start difference. First operand 1679 states and 4227 transitions. Second operand 7 states. [2019-12-27 06:26:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:35,324 INFO L93 Difference]: Finished difference Result 2974 states and 7409 transitions. [2019-12-27 06:26:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:26:35,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 06:26:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:35,330 INFO L225 Difference]: With dead ends: 2974 [2019-12-27 06:26:35,330 INFO L226 Difference]: Without dead ends: 2974 [2019-12-27 06:26:35,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:26:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2019-12-27 06:26:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1761. [2019-12-27 06:26:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-12-27 06:26:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 4470 transitions. [2019-12-27 06:26:35,364 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 4470 transitions. Word has length 47 [2019-12-27 06:26:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:35,364 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 4470 transitions. [2019-12-27 06:26:35,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:26:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 4470 transitions. [2019-12-27 06:26:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:26:35,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:35,368 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] [2019-12-27 06:26:35,368 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 88691356, now seen corresponding path program 5 times [2019-12-27 06:26:35,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:35,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265543312] [2019-12-27 06:26:35,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:26:35,431 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 06:26:35,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265543312] [2019-12-27 06:26:35,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:26:35,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:26:35,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300427623] [2019-12-27 06:26:35,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:26:35,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:26:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:26:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:26:35,433 INFO L87 Difference]: Start difference. First operand 1761 states and 4470 transitions. Second operand 3 states. [2019-12-27 06:26:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:26:35,452 INFO L93 Difference]: Finished difference Result 1759 states and 4465 transitions. [2019-12-27 06:26:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:26:35,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 06:26:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:26:35,455 INFO L225 Difference]: With dead ends: 1759 [2019-12-27 06:26:35,455 INFO L226 Difference]: Without dead ends: 1759 [2019-12-27 06:26:35,456 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 06:26:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-27 06:26:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1463. [2019-12-27 06:26:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2019-12-27 06:26:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 3731 transitions. [2019-12-27 06:26:35,481 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 3731 transitions. Word has length 47 [2019-12-27 06:26:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:26:35,482 INFO L462 AbstractCegarLoop]: Abstraction has 1463 states and 3731 transitions. [2019-12-27 06:26:35,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:26:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 3731 transitions. [2019-12-27 06:26:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:26:35,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:26:35,485 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] [2019-12-27 06:26:35,486 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:26:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:26:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 378110637, now seen corresponding path program 1 times [2019-12-27 06:26:35,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:26:35,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357407526] [2019-12-27 06:26:35,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:26:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:26:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:26:35,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:26:35,588 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:26:35,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~y~0_18 0) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd3~0_63 0) (= v_~z$mem_tmp~0_11 0) (= |v_ULTIMATE.start_main_~#t1077~0.offset_22| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~__unbuffered_p3_EAX~0_17) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~__unbuffered_p2_EAX~0_17) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= v_~z~0_23 0) (= v_~z$w_buff0_used~0_91 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed~0_7 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_28| 1)) (= 0 v_~z$r_buff1_thd4~0_17) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff0~0_25) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_28|) 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1077~0.base_28| 4)) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1077~0.base_28| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1077~0.base_28|) |v_ULTIMATE.start_main_~#t1077~0.offset_22| 0)) |v_#memory_int_29|) (= 0 v_~z$w_buff1_used~0_57) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1077~0.base_28|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_27|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_17, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_27|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_17|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_28|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1080~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:26:35,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-12-27 06:26:35,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:26:35,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-12-27 06:26:35,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_4 |v_P3Thread1of1ForFork1_#in~arg.base_4|) (= v_~z$w_buff0_used~0_61 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6) (= v_~z$w_buff0_used~0_60 1) (= v_~z$w_buff0~0_14 v_~z$w_buff1~0_12) (= |v_P3Thread1of1ForFork1_#in~arg.offset_4| v_P3Thread1of1ForFork1_~arg.offset_4) (= 1 v_~z$w_buff0~0_13)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_61, ~z$w_buff0~0=v_~z$w_buff0~0_14, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_60, ~z$w_buff0~0=v_~z$w_buff0~0_13, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, ~z$w_buff1~0=v_~z$w_buff1~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_4, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:26:35,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~x~0_7) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= 1 v_~b~0_6)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~b~0=v_~b~0_6, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:26:35,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_8) (= v_P1Thread1of1ForFork3_~arg.offset_4 |v_P1Thread1of1ForFork3_#in~arg.offset_4|) (= v_P1Thread1of1ForFork3_~arg.base_4 |v_P1Thread1of1ForFork3_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_4, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_4, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|, ~y~0=v_~y~0_8, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 06:26:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In214800990 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite8_In214800990| |P2Thread1of1ForFork0_#t~ite8_Out214800990|) (= ~z$w_buff0~0_In214800990 |P2Thread1of1ForFork0_#t~ite9_Out214800990|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite9_Out214800990| |P2Thread1of1ForFork0_#t~ite8_Out214800990|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In214800990 256) 0))) (or (= (mod ~z$w_buff0_used~0_In214800990 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In214800990 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In214800990 256))))) (= ~z$w_buff0~0_In214800990 |P2Thread1of1ForFork0_#t~ite8_Out214800990|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In214800990|, ~z$w_buff0~0=~z$w_buff0~0_In214800990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In214800990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In214800990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In214800990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In214800990, ~weak$$choice2~0=~weak$$choice2~0_In214800990} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out214800990|, ~z$w_buff0~0=~z$w_buff0~0_In214800990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In214800990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In214800990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In214800990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In214800990, ~weak$$choice2~0=~weak$$choice2~0_In214800990, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out214800990|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:26:35,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-927511798 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out-927511798| ~z$w_buff1~0_In-927511798) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_In-927511798| |P2Thread1of1ForFork0_#t~ite11_Out-927511798|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-927511798 256)))) (or (= (mod ~z$w_buff0_used~0_In-927511798 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-927511798 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-927511798 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite11_Out-927511798| ~z$w_buff1~0_In-927511798) (= |P2Thread1of1ForFork0_#t~ite11_Out-927511798| |P2Thread1of1ForFork0_#t~ite12_Out-927511798|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-927511798, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-927511798|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-927511798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-927511798, ~z$w_buff1~0=~z$w_buff1~0_In-927511798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-927511798, ~weak$$choice2~0=~weak$$choice2~0_In-927511798} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-927511798|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-927511798, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-927511798|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-927511798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-927511798, ~z$w_buff1~0=~z$w_buff1~0_In-927511798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-927511798, ~weak$$choice2~0=~weak$$choice2~0_In-927511798} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:26:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1603231943 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1603231943 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1603231943 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In-1603231943 256) 0)) (= (mod ~z$w_buff0_used~0_In-1603231943 256) 0))) .cse1 (= ~z$w_buff0_used~0_In-1603231943 |P2Thread1of1ForFork0_#t~ite14_Out-1603231943|) (= |P2Thread1of1ForFork0_#t~ite14_Out-1603231943| |P2Thread1of1ForFork0_#t~ite15_Out-1603231943|)) (and (= ~z$w_buff0_used~0_In-1603231943 |P2Thread1of1ForFork0_#t~ite15_Out-1603231943|) (= |P2Thread1of1ForFork0_#t~ite14_In-1603231943| |P2Thread1of1ForFork0_#t~ite14_Out-1603231943|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-1603231943|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603231943, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1603231943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603231943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1603231943, ~weak$$choice2~0=~weak$$choice2~0_In-1603231943} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1603231943|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-1603231943|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603231943, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1603231943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603231943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1603231943, ~weak$$choice2~0=~weak$$choice2~0_In-1603231943} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 06:26:35,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (= v_~z$r_buff0_thd3~0_43 v_~z$r_buff0_thd3~0_42) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 06:26:35,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-920799879 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-920799879 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-920799879 |P3Thread1of1ForFork1_#t~ite28_Out-920799879|)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out-920799879| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-920799879, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-920799879} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-920799879, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-920799879|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-920799879} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:26:35,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_12 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:26:35,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-766089661 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-766089661 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-766089661 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-766089661 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out-766089661| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out-766089661| ~z$w_buff1_used~0_In-766089661)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-766089661, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-766089661, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-766089661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-766089661} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-766089661, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-766089661|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-766089661, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-766089661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-766089661} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 06:26:35,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1960925397 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1960925397 256)))) (or (and (= ~z$r_buff0_thd4~0_In-1960925397 ~z$r_buff0_thd4~0_Out-1960925397) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1960925397) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960925397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1960925397} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960925397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1960925397, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1960925397|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 06:26:35,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In438984902 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In438984902 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In438984902 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In438984902 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out438984902|)) (and (= ~z$r_buff1_thd4~0_In438984902 |P3Thread1of1ForFork1_#t~ite31_Out438984902|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In438984902, ~z$w_buff0_used~0=~z$w_buff0_used~0_In438984902, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In438984902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In438984902} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In438984902, ~z$w_buff0_used~0=~z$w_buff0_used~0_In438984902, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In438984902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In438984902, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out438984902|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:26:35,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:26:35,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:26:35,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1912170298 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1912170298 256)))) (or (and (= ~z~0_In-1912170298 |ULTIMATE.start_main_#t~ite36_Out-1912170298|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-1912170298 |ULTIMATE.start_main_#t~ite36_Out-1912170298|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1912170298, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1912170298, ~z$w_buff1~0=~z$w_buff1~0_In-1912170298, ~z~0=~z~0_In-1912170298} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1912170298, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1912170298, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1912170298|, ~z$w_buff1~0=~z$w_buff1~0_In-1912170298, ~z~0=~z~0_In-1912170298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:26:35,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite36_8|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_8|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 06:26:35,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-115851850 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-115851850 256)))) (or (and (= ~z$w_buff0_used~0_In-115851850 |ULTIMATE.start_main_#t~ite38_Out-115851850|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-115851850| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115851850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115851850} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115851850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115851850, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-115851850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:26:35,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-2095444268 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2095444268 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2095444268 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2095444268 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2095444268|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2095444268 |ULTIMATE.start_main_#t~ite39_Out-2095444268|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2095444268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2095444268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2095444268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2095444268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2095444268, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2095444268|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2095444268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2095444268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2095444268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:26:35,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In735408909 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In735408909 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In735408909 |ULTIMATE.start_main_#t~ite40_Out735408909|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out735408909|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In735408909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In735408909} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In735408909, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out735408909|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In735408909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:26:35,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1360740081 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1360740081 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1360740081 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1360740081 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-1360740081| 0)) (and (= ~z$r_buff1_thd0~0_In-1360740081 |ULTIMATE.start_main_#t~ite41_Out-1360740081|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1360740081, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1360740081, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1360740081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1360740081} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1360740081|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1360740081, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1360740081, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1360740081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1360740081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:26:35,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~x~0_10 2) (= v_~y~0_10 2) (= 1 v_~__unbuffered_p3_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start_main_#t~ite41_13| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_8)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:26:35,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:26:35 BasicIcfg [2019-12-27 06:26:35,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:26:35,706 INFO L168 Benchmark]: Toolchain (without parser) took 21640.86 ms. Allocated memory was 145.2 MB in the beginning and 1.1 GB in the end (delta: 944.8 MB). Free memory was 100.2 MB in the beginning and 494.7 MB in the end (delta: -394.6 MB). Peak memory consumption was 550.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,707 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.49 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,710 INFO L168 Benchmark]: Boogie Preprocessor took 43.42 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,711 INFO L168 Benchmark]: RCFGBuilder took 806.68 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 106.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,711 INFO L168 Benchmark]: TraceAbstraction took 19955.11 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 886.6 MB). Free memory was 105.7 MB in the beginning and 494.7 MB in the end (delta: -389.1 MB). Peak memory consumption was 497.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:26:35,714 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.19 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.49 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.42 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.68 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 106.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19955.11 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 886.6 MB). Free memory was 105.7 MB in the beginning and 494.7 MB in the end (delta: -389.1 MB). Peak memory consumption was 497.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 169 ProgramPointsBefore, 82 ProgramPointsAfterwards, 191 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 21 ChoiceCompositions, 5425 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50510 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1077, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1078, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1079, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1080, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1832 SDtfs, 2087 SDslu, 3742 SDs, 0 SdLazy, 1967 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30990occurred 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: 4.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 5857 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 50737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...