/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:23:14,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:23:14,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:23:14,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:23:14,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:23:14,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:23:14,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:23:14,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:23:14,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:23:14,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:23:14,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:23:14,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:23:14,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:23:14,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:23:14,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:23:14,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:23:14,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:23:14,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:23:14,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:23:14,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:23:14,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:23:14,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:23:14,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:23:14,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:23:14,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:23:14,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:23:14,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:23:14,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:23:14,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:23:14,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:23:14,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:23:14,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:23:14,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:23:14,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:23:14,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:23:14,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:23:14,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:23:14,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:23:14,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:23:14,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:23:14,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:23:14,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:23:14,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:23:14,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:23:14,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:23:14,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:23:14,830 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:23:14,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:23:14,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:23:14,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:23:14,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:23:14,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:23:14,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:23:14,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:23:14,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:23:14,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:23:14,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:23:14,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:23:14,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:23:14,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:23:14,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:23:14,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:23:14,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:23:14,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:23:14,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:23:14,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:23:14,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:23:14,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:23:14,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:23:14,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:23:14,835 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:23:14,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:23:15,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:23:15,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:23:15,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:23:15,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:23:15,135 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:23:15,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i [2019-12-26 21:23:15,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0692b52b3/62af74fa043140248da6213374397464/FLAG337aa11dd [2019-12-26 21:23:15,767 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:23:15,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.opt.i [2019-12-26 21:23:15,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0692b52b3/62af74fa043140248da6213374397464/FLAG337aa11dd [2019-12-26 21:23:16,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0692b52b3/62af74fa043140248da6213374397464 [2019-12-26 21:23:16,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:23:16,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:23:16,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:23:16,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:23:16,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:23:16,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16, skipping insertion in model container [2019-12-26 21:23:16,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:23:16,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:23:16,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:23:16,710 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:23:16,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:23:16,897 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:23:16,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16 WrapperNode [2019-12-26 21:23:16,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:23:16,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:23:16,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:23:16,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:23:16,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:23:16,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:23:16,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:23:16,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:23:16,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:16,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:17,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:17,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (1/1) ... [2019-12-26 21:23:17,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:23:17,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:23:17,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:23:17,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:23:17,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (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-26 21:23:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:23:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:23:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:23:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:23:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:23:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:23:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:23:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:23:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:23:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:23:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 21:23:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 21:23:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:23:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:23:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:23:17,100 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:23:17,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:23:17,924 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:23:17,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:23:17 BoogieIcfgContainer [2019-12-26 21:23:17,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:23:17,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:23:17,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:23:17,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:23:17,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:23:16" (1/3) ... [2019-12-26 21:23:17,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf635d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:23:17, skipping insertion in model container [2019-12-26 21:23:17,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:23:16" (2/3) ... [2019-12-26 21:23:17,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf635d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:23:17, skipping insertion in model container [2019-12-26 21:23:17,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:23:17" (3/3) ... [2019-12-26 21:23:17,934 INFO L109 eAbstractionObserver]: Analyzing ICFG mix008_power.opt.i [2019-12-26 21:23:17,943 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:23:17,943 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:23:17,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:23:17,951 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:23:18,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,017 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,037 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,037 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,037 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,038 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,038 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,038 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,039 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,042 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,051 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,052 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,053 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,055 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,065 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,069 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,071 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,077 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,077 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,079 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,080 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,080 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:23:18,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 21:23:18,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:23:18,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:23:18,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:23:18,125 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:23:18,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:23:18,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:23:18,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:23:18,126 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:23:18,152 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-26 21:23:18,154 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-26 21:23:18,297 INFO L132 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-26 21:23:18,297 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:23:18,319 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 575 event pairs. 0/192 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-26 21:23:18,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-26 21:23:18,436 INFO L132 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-26 21:23:18,437 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:23:18,452 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 575 event pairs. 0/192 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-26 21:23:18,489 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-26 21:23:18,490 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:23:24,702 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:23:24,844 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:23:24,875 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147708 [2019-12-26 21:23:24,875 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-26 21:23:24,878 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 134 transitions [2019-12-26 21:23:35,557 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92086 states. [2019-12-26 21:23:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 92086 states. [2019-12-26 21:23:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 21:23:35,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:23:35,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:23:35,567 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-26 21:23:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:23:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1095689236, now seen corresponding path program 1 times [2019-12-26 21:23:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:23:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250936257] [2019-12-26 21:23:35,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:23:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:23:35,890 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-26 21:23:35,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250936257] [2019-12-26 21:23:35,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:23:35,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:23:35,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745604475] [2019-12-26 21:23:35,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:23:35,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:23:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:23:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:23:35,915 INFO L87 Difference]: Start difference. First operand 92086 states. Second operand 3 states. [2019-12-26 21:23:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:23:37,602 INFO L93 Difference]: Finished difference Result 91382 states and 423776 transitions. [2019-12-26 21:23:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:23:37,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 21:23:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:23:38,220 INFO L225 Difference]: With dead ends: 91382 [2019-12-26 21:23:38,220 INFO L226 Difference]: Without dead ends: 85534 [2019-12-26 21:23:38,222 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-26 21:23:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85534 states. [2019-12-26 21:23:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85534 to 85534. [2019-12-26 21:23:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85534 states. [2019-12-26 21:23:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85534 states to 85534 states and 396416 transitions. [2019-12-26 21:23:46,009 INFO L78 Accepts]: Start accepts. Automaton has 85534 states and 396416 transitions. Word has length 9 [2019-12-26 21:23:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:23:46,010 INFO L462 AbstractCegarLoop]: Abstraction has 85534 states and 396416 transitions. [2019-12-26 21:23:46,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:23:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 85534 states and 396416 transitions. [2019-12-26 21:23:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:23:46,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:23:46,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:23:46,022 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-26 21:23:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:23:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1576682706, now seen corresponding path program 1 times [2019-12-26 21:23:46,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:23:46,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654911140] [2019-12-26 21:23:46,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:23:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:23:46,135 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-26 21:23:46,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654911140] [2019-12-26 21:23:46,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:23:46,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:23:46,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216808659] [2019-12-26 21:23:46,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:23:46,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:23:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:23:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:23:46,138 INFO L87 Difference]: Start difference. First operand 85534 states and 396416 transitions. Second operand 4 states. [2019-12-26 21:23:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:23:50,873 INFO L93 Difference]: Finished difference Result 132766 states and 593324 transitions. [2019-12-26 21:23:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:23:50,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 21:23:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:23:51,984 INFO L225 Difference]: With dead ends: 132766 [2019-12-26 21:23:51,984 INFO L226 Difference]: Without dead ends: 132702 [2019-12-26 21:23:51,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:23:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132702 states. [2019-12-26 21:24:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132702 to 129166. [2019-12-26 21:24:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129166 states. [2019-12-26 21:24:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129166 states to 129166 states and 580344 transitions. [2019-12-26 21:24:01,897 INFO L78 Accepts]: Start accepts. Automaton has 129166 states and 580344 transitions. Word has length 15 [2019-12-26 21:24:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:24:01,897 INFO L462 AbstractCegarLoop]: Abstraction has 129166 states and 580344 transitions. [2019-12-26 21:24:01,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:24:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 129166 states and 580344 transitions. [2019-12-26 21:24:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 21:24:01,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:24:01,909 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-26 21:24:01,909 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-26 21:24:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:24:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash -959167775, now seen corresponding path program 1 times [2019-12-26 21:24:01,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:24:01,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240708766] [2019-12-26 21:24:01,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:24:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:24:02,005 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-26 21:24:02,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240708766] [2019-12-26 21:24:02,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:24:02,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:24:02,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527612188] [2019-12-26 21:24:02,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:24:02,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:24:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:24:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:24:02,011 INFO L87 Difference]: Start difference. First operand 129166 states and 580344 transitions. Second operand 4 states. [2019-12-26 21:24:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:24:07,265 INFO L93 Difference]: Finished difference Result 166838 states and 738668 transitions. [2019-12-26 21:24:07,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:24:07,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 21:24:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:24:08,546 INFO L225 Difference]: With dead ends: 166838 [2019-12-26 21:24:08,546 INFO L226 Difference]: Without dead ends: 166782 [2019-12-26 21:24:08,547 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-26 21:24:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166782 states. [2019-12-26 21:24:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166782 to 149598. [2019-12-26 21:24:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149598 states. [2019-12-26 21:24:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149598 states to 149598 states and 668132 transitions. [2019-12-26 21:24:22,051 INFO L78 Accepts]: Start accepts. Automaton has 149598 states and 668132 transitions. Word has length 18 [2019-12-26 21:24:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:24:22,052 INFO L462 AbstractCegarLoop]: Abstraction has 149598 states and 668132 transitions. [2019-12-26 21:24:22,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:24:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 149598 states and 668132 transitions. [2019-12-26 21:24:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:24:22,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:24:22,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:24:22,067 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-26 21:24:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:24:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash 330599914, now seen corresponding path program 1 times [2019-12-26 21:24:22,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:24:22,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792092256] [2019-12-26 21:24:22,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:24:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:24:22,141 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-26 21:24:22,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792092256] [2019-12-26 21:24:22,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:24:22,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:24:22,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405102663] [2019-12-26 21:24:22,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:24:22,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:24:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:24:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:24:22,145 INFO L87 Difference]: Start difference. First operand 149598 states and 668132 transitions. Second operand 3 states. [2019-12-26 21:24:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:24:30,030 INFO L93 Difference]: Finished difference Result 254938 states and 1095516 transitions. [2019-12-26 21:24:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:24:30,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 21:24:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:24:30,967 INFO L225 Difference]: With dead ends: 254938 [2019-12-26 21:24:30,968 INFO L226 Difference]: Without dead ends: 254938 [2019-12-26 21:24:30,968 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-26 21:24:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254938 states. [2019-12-26 21:24:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254938 to 226954. [2019-12-26 21:24:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226954 states. [2019-12-26 21:24:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226954 states to 226954 states and 987664 transitions. [2019-12-26 21:24:39,578 INFO L78 Accepts]: Start accepts. Automaton has 226954 states and 987664 transitions. Word has length 19 [2019-12-26 21:24:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:24:39,578 INFO L462 AbstractCegarLoop]: Abstraction has 226954 states and 987664 transitions. [2019-12-26 21:24:39,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:24:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 226954 states and 987664 transitions. [2019-12-26 21:24:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 21:24:39,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:24:39,599 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] [2019-12-26 21:24:39,600 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-26 21:24:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:24:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1619055659, now seen corresponding path program 1 times [2019-12-26 21:24:39,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:24:39,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940090274] [2019-12-26 21:24:39,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:24:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:24:39,660 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-26 21:24:39,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940090274] [2019-12-26 21:24:39,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:24:39,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:24:39,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264585692] [2019-12-26 21:24:39,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:24:39,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:24:39,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:24:39,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:24:39,662 INFO L87 Difference]: Start difference. First operand 226954 states and 987664 transitions. Second operand 3 states. [2019-12-26 21:24:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:24:47,082 INFO L93 Difference]: Finished difference Result 214858 states and 934100 transitions. [2019-12-26 21:24:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:24:47,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-26 21:24:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:24:48,608 INFO L225 Difference]: With dead ends: 214858 [2019-12-26 21:24:48,609 INFO L226 Difference]: Without dead ends: 214858 [2019-12-26 21:24:48,609 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-26 21:24:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214858 states. [2019-12-26 21:24:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214858 to 214858. [2019-12-26 21:24:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214858 states. [2019-12-26 21:25:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214858 states to 214858 states and 934100 transitions. [2019-12-26 21:25:00,412 INFO L78 Accepts]: Start accepts. Automaton has 214858 states and 934100 transitions. Word has length 20 [2019-12-26 21:25:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:25:00,413 INFO L462 AbstractCegarLoop]: Abstraction has 214858 states and 934100 transitions. [2019-12-26 21:25:00,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:25:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 214858 states and 934100 transitions. [2019-12-26 21:25:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 21:25:00,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:25:00,431 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] [2019-12-26 21:25:00,431 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-26 21:25:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:25:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2037270664, now seen corresponding path program 1 times [2019-12-26 21:25:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:25:00,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141351207] [2019-12-26 21:25:00,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:25:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:25:00,531 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-26 21:25:00,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141351207] [2019-12-26 21:25:00,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:25:00,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:25:00,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853420329] [2019-12-26 21:25:00,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:25:00,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:25:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:25:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:25:00,534 INFO L87 Difference]: Start difference. First operand 214858 states and 934100 transitions. Second operand 4 states. [2019-12-26 21:25:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:25:08,914 INFO L93 Difference]: Finished difference Result 268078 states and 1150628 transitions. [2019-12-26 21:25:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:25:08,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-26 21:25:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:25:09,840 INFO L225 Difference]: With dead ends: 268078 [2019-12-26 21:25:09,840 INFO L226 Difference]: Without dead ends: 268010 [2019-12-26 21:25:09,840 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-26 21:25:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268010 states. [2019-12-26 21:25:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268010 to 217890. [2019-12-26 21:25:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217890 states. [2019-12-26 21:25:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217890 states to 217890 states and 947032 transitions. [2019-12-26 21:25:24,067 INFO L78 Accepts]: Start accepts. Automaton has 217890 states and 947032 transitions. Word has length 21 [2019-12-26 21:25:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:25:24,067 INFO L462 AbstractCegarLoop]: Abstraction has 217890 states and 947032 transitions. [2019-12-26 21:25:24,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:25:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 217890 states and 947032 transitions. [2019-12-26 21:25:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:25:24,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:25:24,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:25:24,111 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-26 21:25:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:25:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 984863619, now seen corresponding path program 1 times [2019-12-26 21:25:24,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:25:24,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196498455] [2019-12-26 21:25:24,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:25:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:25:24,216 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-26 21:25:24,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196498455] [2019-12-26 21:25:24,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:25:24,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:25:24,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370599795] [2019-12-26 21:25:24,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:25:24,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:25:24,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:25:24,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:25:24,219 INFO L87 Difference]: Start difference. First operand 217890 states and 947032 transitions. Second operand 4 states. [2019-12-26 21:25:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:25:32,364 INFO L93 Difference]: Finished difference Result 182759 states and 729985 transitions. [2019-12-26 21:25:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:25:32,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-26 21:25:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:25:32,907 INFO L225 Difference]: With dead ends: 182759 [2019-12-26 21:25:32,908 INFO L226 Difference]: Without dead ends: 168943 [2019-12-26 21:25:32,908 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-26 21:25:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168943 states. [2019-12-26 21:25:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168943 to 168943. [2019-12-26 21:25:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168943 states. [2019-12-26 21:25:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168943 states to 168943 states and 679987 transitions. [2019-12-26 21:25:38,772 INFO L78 Accepts]: Start accepts. Automaton has 168943 states and 679987 transitions. Word has length 24 [2019-12-26 21:25:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:25:38,772 INFO L462 AbstractCegarLoop]: Abstraction has 168943 states and 679987 transitions. [2019-12-26 21:25:38,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:25:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 168943 states and 679987 transitions. [2019-12-26 21:25:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:25:38,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:25:38,807 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] [2019-12-26 21:25:38,807 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-26 21:25:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:25:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 287139749, now seen corresponding path program 1 times [2019-12-26 21:25:38,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:25:38,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840260120] [2019-12-26 21:25:38,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:25:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:25:38,942 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-26 21:25:38,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840260120] [2019-12-26 21:25:38,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:25:38,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:25:38,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954534953] [2019-12-26 21:25:38,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:25:38,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:25:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:25:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:25:38,944 INFO L87 Difference]: Start difference. First operand 168943 states and 679987 transitions. Second operand 5 states. [2019-12-26 21:25:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:25:47,190 INFO L93 Difference]: Finished difference Result 240354 states and 945495 transitions. [2019-12-26 21:25:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:25:47,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 21:25:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:25:47,948 INFO L225 Difference]: With dead ends: 240354 [2019-12-26 21:25:47,948 INFO L226 Difference]: Without dead ends: 240311 [2019-12-26 21:25:47,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:25:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240311 states. [2019-12-26 21:25:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240311 to 185842. [2019-12-26 21:25:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185842 states. [2019-12-26 21:25:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185842 states to 185842 states and 744730 transitions. [2019-12-26 21:25:54,569 INFO L78 Accepts]: Start accepts. Automaton has 185842 states and 744730 transitions. Word has length 25 [2019-12-26 21:25:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:25:54,569 INFO L462 AbstractCegarLoop]: Abstraction has 185842 states and 744730 transitions. [2019-12-26 21:25:54,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:25:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 185842 states and 744730 transitions. [2019-12-26 21:25:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:25:54,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:25:54,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:25:54,633 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-26 21:25:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:25:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -640922618, now seen corresponding path program 1 times [2019-12-26 21:25:54,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:25:54,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558825544] [2019-12-26 21:25:54,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:25:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:25:54,718 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-26 21:25:54,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558825544] [2019-12-26 21:25:54,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:25:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:25:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698402595] [2019-12-26 21:25:54,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:25:54,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:25:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:25:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:25:54,720 INFO L87 Difference]: Start difference. First operand 185842 states and 744730 transitions. Second operand 5 states. [2019-12-26 21:25:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:25:56,297 INFO L93 Difference]: Finished difference Result 90746 states and 310609 transitions. [2019-12-26 21:25:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:25:56,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:25:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:25:56,464 INFO L225 Difference]: With dead ends: 90746 [2019-12-26 21:25:56,464 INFO L226 Difference]: Without dead ends: 77811 [2019-12-26 21:25:56,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:25:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77811 states. [2019-12-26 21:26:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77811 to 77811. [2019-12-26 21:26:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77811 states. [2019-12-26 21:26:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77811 states to 77811 states and 263431 transitions. [2019-12-26 21:26:03,897 INFO L78 Accepts]: Start accepts. Automaton has 77811 states and 263431 transitions. Word has length 28 [2019-12-26 21:26:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:03,897 INFO L462 AbstractCegarLoop]: Abstraction has 77811 states and 263431 transitions. [2019-12-26 21:26:03,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:26:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 77811 states and 263431 transitions. [2019-12-26 21:26:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 21:26:03,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:03,919 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] [2019-12-26 21:26:03,919 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-26 21:26:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -420917345, now seen corresponding path program 1 times [2019-12-26 21:26:03,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:03,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083280874] [2019-12-26 21:26:03,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:04,021 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-26 21:26:04,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083280874] [2019-12-26 21:26:04,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:04,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:26:04,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471962635] [2019-12-26 21:26:04,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:26:04,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:04,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:26:04,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:26:04,023 INFO L87 Difference]: Start difference. First operand 77811 states and 263431 transitions. Second operand 6 states. [2019-12-26 21:26:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:04,199 INFO L93 Difference]: Finished difference Result 24653 states and 79329 transitions. [2019-12-26 21:26:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:26:04,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 21:26:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:04,232 INFO L225 Difference]: With dead ends: 24653 [2019-12-26 21:26:04,233 INFO L226 Difference]: Without dead ends: 19871 [2019-12-26 21:26:04,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:26:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19871 states. [2019-12-26 21:26:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19871 to 19679. [2019-12-26 21:26:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19679 states. [2019-12-26 21:26:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19679 states to 19679 states and 63061 transitions. [2019-12-26 21:26:04,513 INFO L78 Accepts]: Start accepts. Automaton has 19679 states and 63061 transitions. Word has length 29 [2019-12-26 21:26:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:04,514 INFO L462 AbstractCegarLoop]: Abstraction has 19679 states and 63061 transitions. [2019-12-26 21:26:04,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:26:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 19679 states and 63061 transitions. [2019-12-26 21:26:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 21:26:04,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:04,530 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] [2019-12-26 21:26:04,530 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-26 21:26:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1941437234, now seen corresponding path program 1 times [2019-12-26 21:26:04,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:04,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493415333] [2019-12-26 21:26:04,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:04,582 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-26 21:26:04,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493415333] [2019-12-26 21:26:04,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:04,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:26:04,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946011976] [2019-12-26 21:26:04,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:26:04,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:26:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:26:04,585 INFO L87 Difference]: Start difference. First operand 19679 states and 63061 transitions. Second operand 3 states. [2019-12-26 21:26:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:04,741 INFO L93 Difference]: Finished difference Result 21024 states and 64059 transitions. [2019-12-26 21:26:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:26:04,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-26 21:26:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:04,785 INFO L225 Difference]: With dead ends: 21024 [2019-12-26 21:26:04,785 INFO L226 Difference]: Without dead ends: 21024 [2019-12-26 21:26:04,786 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-26 21:26:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21024 states. [2019-12-26 21:26:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21024 to 19831. [2019-12-26 21:26:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19831 states. [2019-12-26 21:26:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19831 states to 19831 states and 60918 transitions. [2019-12-26 21:26:05,533 INFO L78 Accepts]: Start accepts. Automaton has 19831 states and 60918 transitions. Word has length 37 [2019-12-26 21:26:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:05,533 INFO L462 AbstractCegarLoop]: Abstraction has 19831 states and 60918 transitions. [2019-12-26 21:26:05,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:26:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19831 states and 60918 transitions. [2019-12-26 21:26:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:26:05,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:05,555 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] [2019-12-26 21:26:05,555 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-26 21:26:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1588768954, now seen corresponding path program 1 times [2019-12-26 21:26:05,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:05,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785525604] [2019-12-26 21:26:05,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:05,649 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-26 21:26:05,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785525604] [2019-12-26 21:26:05,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:05,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:26:05,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669251994] [2019-12-26 21:26:05,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:26:05,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:26:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:26:05,651 INFO L87 Difference]: Start difference. First operand 19831 states and 60918 transitions. Second operand 7 states. [2019-12-26 21:26:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:05,852 INFO L93 Difference]: Finished difference Result 17438 states and 55521 transitions. [2019-12-26 21:26:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:26:05,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-26 21:26:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:05,891 INFO L225 Difference]: With dead ends: 17438 [2019-12-26 21:26:05,891 INFO L226 Difference]: Without dead ends: 17160 [2019-12-26 21:26:05,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:26:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17160 states. [2019-12-26 21:26:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17160 to 14276. [2019-12-26 21:26:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14276 states. [2019-12-26 21:26:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14276 states to 14276 states and 46508 transitions. [2019-12-26 21:26:06,209 INFO L78 Accepts]: Start accepts. Automaton has 14276 states and 46508 transitions. Word has length 40 [2019-12-26 21:26:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:06,210 INFO L462 AbstractCegarLoop]: Abstraction has 14276 states and 46508 transitions. [2019-12-26 21:26:06,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:26:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14276 states and 46508 transitions. [2019-12-26 21:26:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:26:06,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:06,228 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-26 21:26:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1937592970, now seen corresponding path program 1 times [2019-12-26 21:26:06,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:06,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039463496] [2019-12-26 21:26:06,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:06,298 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-26 21:26:06,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039463496] [2019-12-26 21:26:06,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:06,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:26:06,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553229937] [2019-12-26 21:26:06,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:26:06,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:06,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:26:06,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:26:06,301 INFO L87 Difference]: Start difference. First operand 14276 states and 46508 transitions. Second operand 4 states. [2019-12-26 21:26:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:06,373 INFO L93 Difference]: Finished difference Result 16263 states and 51746 transitions. [2019-12-26 21:26:06,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:26:06,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-26 21:26:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:06,394 INFO L225 Difference]: With dead ends: 16263 [2019-12-26 21:26:06,394 INFO L226 Difference]: Without dead ends: 9120 [2019-12-26 21:26:06,394 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-26 21:26:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2019-12-26 21:26:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 9120. [2019-12-26 21:26:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9120 states. [2019-12-26 21:26:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9120 states to 9120 states and 26895 transitions. [2019-12-26 21:26:06,524 INFO L78 Accepts]: Start accepts. Automaton has 9120 states and 26895 transitions. Word has length 64 [2019-12-26 21:26:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:06,524 INFO L462 AbstractCegarLoop]: Abstraction has 9120 states and 26895 transitions. [2019-12-26 21:26:06,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:26:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9120 states and 26895 transitions. [2019-12-26 21:26:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:26:06,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:06,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:06,534 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-26 21:26:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash -357172964, now seen corresponding path program 2 times [2019-12-26 21:26:06,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:06,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994620931] [2019-12-26 21:26:06,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:06,610 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-26 21:26:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994620931] [2019-12-26 21:26:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:26:06,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200644653] [2019-12-26 21:26:06,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:26:06,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:26:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:26:06,612 INFO L87 Difference]: Start difference. First operand 9120 states and 26895 transitions. Second operand 3 states. [2019-12-26 21:26:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:06,654 INFO L93 Difference]: Finished difference Result 10120 states and 29028 transitions. [2019-12-26 21:26:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:26:06,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:26:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:06,665 INFO L225 Difference]: With dead ends: 10120 [2019-12-26 21:26:06,666 INFO L226 Difference]: Without dead ends: 5556 [2019-12-26 21:26:06,667 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-26 21:26:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2019-12-26 21:26:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 5556. [2019-12-26 21:26:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2019-12-26 21:26:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 14287 transitions. [2019-12-26 21:26:06,771 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 14287 transitions. Word has length 64 [2019-12-26 21:26:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:06,771 INFO L462 AbstractCegarLoop]: Abstraction has 5556 states and 14287 transitions. [2019-12-26 21:26:06,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:26:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 14287 transitions. [2019-12-26 21:26:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:26:06,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:06,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:06,781 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-26 21:26:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2011569808, now seen corresponding path program 3 times [2019-12-26 21:26:06,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:06,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153743484] [2019-12-26 21:26:06,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:06,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-26 21:26:06,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153743484] [2019-12-26 21:26:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:26:06,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857700116] [2019-12-26 21:26:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:26:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:26:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:26:06,869 INFO L87 Difference]: Start difference. First operand 5556 states and 14287 transitions. Second operand 3 states. [2019-12-26 21:26:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:06,898 INFO L93 Difference]: Finished difference Result 6048 states and 15344 transitions. [2019-12-26 21:26:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:26:06,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:26:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:06,900 INFO L225 Difference]: With dead ends: 6048 [2019-12-26 21:26:06,900 INFO L226 Difference]: Without dead ends: 577 [2019-12-26 21:26:06,902 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-26 21:26:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-26 21:26:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-12-26 21:26:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-26 21:26:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1186 transitions. [2019-12-26 21:26:06,910 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1186 transitions. Word has length 64 [2019-12-26 21:26:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1186 transitions. [2019-12-26 21:26:06,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:26:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1186 transitions. [2019-12-26 21:26:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:26:06,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:06,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:06,911 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:26:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash 332966896, now seen corresponding path program 4 times [2019-12-26 21:26:06,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379313356] [2019-12-26 21:26:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:07,020 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-26 21:26:07,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379313356] [2019-12-26 21:26:07,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:07,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:26:07,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242908980] [2019-12-26 21:26:07,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:26:07,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:26:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:26:07,024 INFO L87 Difference]: Start difference. First operand 577 states and 1186 transitions. Second operand 8 states. [2019-12-26 21:26:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:07,235 INFO L93 Difference]: Finished difference Result 1001 states and 2026 transitions. [2019-12-26 21:26:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:26:07,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 21:26:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:07,236 INFO L225 Difference]: With dead ends: 1001 [2019-12-26 21:26:07,237 INFO L226 Difference]: Without dead ends: 685 [2019-12-26 21:26:07,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:26:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-12-26 21:26:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 638. [2019-12-26 21:26:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-26 21:26:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1275 transitions. [2019-12-26 21:26:07,246 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1275 transitions. Word has length 64 [2019-12-26 21:26:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:07,246 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1275 transitions. [2019-12-26 21:26:07,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:26:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1275 transitions. [2019-12-26 21:26:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:26:07,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:07,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:07,248 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:26:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash -110181072, now seen corresponding path program 5 times [2019-12-26 21:26:07,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:07,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828204973] [2019-12-26 21:26:07,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:07,318 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-26 21:26:07,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828204973] [2019-12-26 21:26:07,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:07,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:26:07,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539604268] [2019-12-26 21:26:07,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:26:07,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:07,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:26:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:26:07,320 INFO L87 Difference]: Start difference. First operand 638 states and 1275 transitions. Second operand 5 states. [2019-12-26 21:26:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:07,377 INFO L93 Difference]: Finished difference Result 1261 states and 2534 transitions. [2019-12-26 21:26:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:26:07,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 21:26:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:07,378 INFO L225 Difference]: With dead ends: 1261 [2019-12-26 21:26:07,378 INFO L226 Difference]: Without dead ends: 637 [2019-12-26 21:26:07,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:26:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-12-26 21:26:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-12-26 21:26:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-12-26 21:26:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1273 transitions. [2019-12-26 21:26:07,387 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1273 transitions. Word has length 64 [2019-12-26 21:26:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:07,388 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 1273 transitions. [2019-12-26 21:26:07,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:26:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1273 transitions. [2019-12-26 21:26:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:26:07,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:07,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:07,389 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:26:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash -566717547, now seen corresponding path program 1 times [2019-12-26 21:26:07,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:07,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716907613] [2019-12-26 21:26:07,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:26:07,514 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-26 21:26:07,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716907613] [2019-12-26 21:26:07,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:26:07,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:26:07,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893300904] [2019-12-26 21:26:07,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:26:07,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:26:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:26:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:26:07,520 INFO L87 Difference]: Start difference. First operand 637 states and 1273 transitions. Second operand 3 states. [2019-12-26 21:26:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:26:07,533 INFO L93 Difference]: Finished difference Result 636 states and 1271 transitions. [2019-12-26 21:26:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:26:07,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:26:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:26:07,534 INFO L225 Difference]: With dead ends: 636 [2019-12-26 21:26:07,535 INFO L226 Difference]: Without dead ends: 636 [2019-12-26 21:26:07,535 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-26 21:26:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-12-26 21:26:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-12-26 21:26:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-26 21:26:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1271 transitions. [2019-12-26 21:26:07,545 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1271 transitions. Word has length 65 [2019-12-26 21:26:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:26:07,545 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1271 transitions. [2019-12-26 21:26:07,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:26:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1271 transitions. [2019-12-26 21:26:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:26:07,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:26:07,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:26:07,547 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:26:07,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:26:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1740782390, now seen corresponding path program 1 times [2019-12-26 21:26:07,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:26:07,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381253005] [2019-12-26 21:26:07,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:26:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:26:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:26:07,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:26:07,736 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:26:07,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= v_~z$r_buff1_thd2~0_128 0) (= |v_#valid_120| (store .cse0 |v_ULTIMATE.start_main_~#t213~0.base_70| 1)) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t213~0.base_70| 4) |v_#length_29|) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t213~0.base_70|) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t213~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t213~0.base_70|) |v_ULTIMATE.start_main_~#t213~0.offset_44| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t213~0.base_70|)) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= |v_ULTIMATE.start_main_~#t213~0.offset_44| 0) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 v_~weak$$choice0~0_170) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t215~0.offset=|v_ULTIMATE.start_main_~#t215~0.offset_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t215~0.base=|v_ULTIMATE.start_main_~#t215~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ULTIMATE.start_main_~#t216~0.offset=|v_ULTIMATE.start_main_~#t216~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~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_336, ULTIMATE.start_main_~#t214~0.base=|v_ULTIMATE.start_main_~#t214~0.base_62|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t214~0.offset=|v_ULTIMATE.start_main_~#t214~0.offset_37|, ULTIMATE.start_main_~#t213~0.base=|v_ULTIMATE.start_main_~#t213~0.base_70|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ULTIMATE.start_main_~#t213~0.offset=|v_ULTIMATE.start_main_~#t213~0.offset_44|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_~#t216~0.base=|v_ULTIMATE.start_main_~#t216~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t215~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t215~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t216~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t214~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t214~0.offset, ULTIMATE.start_main_~#t213~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t213~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t216~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:26:07,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t214~0.base_11|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t214~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t214~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t214~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t214~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t214~0.base_11|) |v_ULTIMATE.start_main_~#t214~0.offset_10| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t214~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t214~0.base_11| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t214~0.offset=|v_ULTIMATE.start_main_~#t214~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t214~0.base=|v_ULTIMATE.start_main_~#t214~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t214~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t214~0.base, #length] because there is no mapped edge [2019-12-26 21:26:07,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t215~0.base_13| 1) |v_#valid_52|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t215~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t215~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t215~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t215~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t215~0.base_13|) |v_ULTIMATE.start_main_~#t215~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t215~0.base_13|) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t215~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t215~0.offset=|v_ULTIMATE.start_main_~#t215~0.offset_11|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_~#t215~0.base=|v_ULTIMATE.start_main_~#t215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t215~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t215~0.base] because there is no mapped edge [2019-12-26 21:26:07,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t216~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t216~0.base_10|) |v_ULTIMATE.start_main_~#t216~0.offset_9| 3))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t216~0.base_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t216~0.base_10| 1) |v_#valid_37|) (not (= 0 |v_ULTIMATE.start_main_~#t216~0.base_10|)) (= |v_ULTIMATE.start_main_~#t216~0.offset_9| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t216~0.base_10| 4) |v_#length_17|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t216~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t216~0.base=|v_ULTIMATE.start_main_~#t216~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t216~0.offset=|v_ULTIMATE.start_main_~#t216~0.offset_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t216~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t216~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:26:07,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (mod v_~z$w_buff1_used~0_58 256) 0) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_12 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_10|) (= v_P3Thread1of1ForFork2_~arg.offset_10 |v_P3Thread1of1ForFork2_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_10| 1) (= |v_P3Thread1of1ForFork2_#in~arg.base_10| v_P3Thread1of1ForFork2_~arg.base_10) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_12, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_10|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_10, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 21:26:07,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1863105919 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1863105919 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1863105919| ~z$w_buff1~0_In-1863105919) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1863105919| ~z$w_buff0~0_In-1863105919) (not .cse1) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1863105919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1863105919, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1863105919, ~z$w_buff1~0=~z$w_buff1~0_In-1863105919} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1863105919|, ~z$w_buff0~0=~z$w_buff0~0_In-1863105919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1863105919, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1863105919, ~z$w_buff1~0=~z$w_buff1~0_In-1863105919} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-26 21:26:07,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_12|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_12|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_7|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_11|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-26 21:26:07,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 21:26:07,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In527359251 256)))) (or (and .cse0 (= ~z~0_In527359251 |P3Thread1of1ForFork2_#t~ite48_Out527359251|)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out527359251| ~z$mem_tmp~0_In527359251)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In527359251, ~z$flush_delayed~0=~z$flush_delayed~0_In527359251, ~z~0=~z~0_In527359251} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In527359251, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out527359251|, ~z$flush_delayed~0=~z$flush_delayed~0_In527359251, ~z~0=~z~0_In527359251} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-26 21:26:07,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_8) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-26 21:26:07,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~y~0_51 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 21:26:07,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2135489903 256)))) (or (and (= ~z$mem_tmp~0_In-2135489903 |P2Thread1of1ForFork1_#t~ite25_Out-2135489903|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-2135489903| ~z~0_In-2135489903) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2135489903, ~z$flush_delayed~0=~z$flush_delayed~0_In-2135489903, ~z~0=~z~0_In-2135489903} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2135489903, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-2135489903|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2135489903, ~z~0=~z~0_In-2135489903} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-26 21:26:07,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_52|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_51|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 21:26:07,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1493022409 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1493022409 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-1493022409| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out-1493022409| ~z$w_buff0_used~0_In-1493022409) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1493022409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1493022409} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1493022409|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1493022409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1493022409} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-26 21:26:07,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-926272722 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-926272722 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-926272722 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-926272722 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-926272722| ~z$w_buff1_used~0_In-926272722) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite52_Out-926272722| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-926272722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-926272722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-926272722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-926272722} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-926272722|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-926272722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-926272722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-926272722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-926272722} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-26 21:26:07,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In218843981 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In218843981 256)))) (or (and (= ~z$r_buff0_thd4~0_Out218843981 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out218843981 ~z$r_buff0_thd4~0_In218843981)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In218843981, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In218843981} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out218843981|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218843981, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out218843981} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 21:26:07,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1368333492 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1368333492 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1368333492 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1368333492 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite54_Out1368333492| ~z$r_buff1_thd4~0_In1368333492)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork2_#t~ite54_Out1368333492| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1368333492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368333492, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1368333492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368333492} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1368333492|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1368333492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368333492, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1368333492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368333492} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-26 21:26:07,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:26:07,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:26:07,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1242341902 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1242341902 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1242341902| ~z~0_In1242341902)) (and (= ~z$w_buff1~0_In1242341902 |ULTIMATE.start_main_#t~ite59_Out1242341902|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1242341902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242341902, ~z$w_buff1~0=~z$w_buff1~0_In1242341902, ~z~0=~z~0_In1242341902} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1242341902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242341902, ~z$w_buff1~0=~z$w_buff1~0_In1242341902, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1242341902|, ~z~0=~z~0_In1242341902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:26:07,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-26 21:26:07,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In31362752 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In31362752 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out31362752|)) (and (= |ULTIMATE.start_main_#t~ite61_Out31362752| ~z$w_buff0_used~0_In31362752) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In31362752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In31362752} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In31362752, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out31362752|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In31362752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:26:07,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In510896691 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In510896691 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In510896691 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In510896691 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out510896691| ~z$w_buff1_used~0_In510896691) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out510896691| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In510896691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In510896691, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In510896691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In510896691} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out510896691|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In510896691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In510896691, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In510896691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In510896691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:26:07,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1854764737 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1854764737 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1854764737| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out1854764737| ~z$r_buff0_thd0~0_In1854764737)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1854764737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1854764737} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1854764737|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1854764737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1854764737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:26:07,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In92861970 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In92861970 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In92861970 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In92861970 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out92861970| 0)) (and (= |ULTIMATE.start_main_#t~ite64_Out92861970| ~z$r_buff1_thd0~0_In92861970) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In92861970, ~z$w_buff0_used~0=~z$w_buff0_used~0_In92861970, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In92861970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In92861970} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In92861970, ~z$w_buff0_used~0=~z$w_buff0_used~0_In92861970, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In92861970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In92861970, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out92861970|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-26 21:26:07,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~main$tmp_guard1~0_46 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:26:08,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:26:08 BasicIcfg [2019-12-26 21:26:08,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:26:08,156 INFO L168 Benchmark]: Toolchain (without parser) took 172101.03 ms. Allocated memory was 144.2 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 100.1 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,156 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 153.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.05 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,158 INFO L168 Benchmark]: Boogie Preprocessor took 43.67 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,159 INFO L168 Benchmark]: RCFGBuilder took 911.31 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 89.9 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,160 INFO L168 Benchmark]: TraceAbstraction took 170227.95 ms. Allocated memory was 201.3 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 89.2 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:26:08,163 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.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 153.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.05 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.67 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 911.31 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 89.9 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170227.95 ms. Allocated memory was 201.3 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 89.2 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 211 ProgramPointsBefore, 113 ProgramPointsAfterwards, 254 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 27 ChoiceCompositions, 10992 VarBasedMoverChecksPositive, 301 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 147708 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L854] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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] [L856] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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] [L858] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L860] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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] [L816] 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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] [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L817] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L819] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L820] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L822] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L831] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L768] 3 y = 2 [L771] 3 __unbuffered_p2_EAX = y [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L778] 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=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L778] 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) [L779] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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] [L779] 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)) [L780] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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] [L780] 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)) [L781] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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] [L781] 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)) [L782] 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=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L782] 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)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=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] [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] 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=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L784] 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)) [L785] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L831] 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) [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=1, 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] [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 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 [L869] 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, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 169.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 62.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3429 SDtfs, 4154 SDslu, 5311 SDs, 0 SdLazy, 1370 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226954occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 87.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 157609 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 133606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...