/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:52:12,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:52:12,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:52:12,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:52:12,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:52:12,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:52:12,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:52:12,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:52:12,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:52:12,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:52:12,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:52:12,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:52:12,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:52:12,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:52:12,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:52:12,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:52:12,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:52:12,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:52:12,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:52:12,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:52:12,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:52:12,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:52:12,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:52:12,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:52:12,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:52:12,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:52:12,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:52:12,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:52:12,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:52:12,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:52:12,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:52:12,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:52:12,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:52:12,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:52:12,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:52:12,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:52:12,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:52:12,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:52:12,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:52:12,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:52:12,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:52:12,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:52:12,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:52:12,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:52:12,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:52:12,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:52:12,788 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:52:12,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:52:12,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:52:12,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:52:12,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:52:12,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:52:12,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:52:12,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:52:12,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:52:12,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:52:12,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:52:12,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:52:12,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:52:12,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:52:12,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:52:12,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:52:12,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:52:12,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:52:12,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:52:12,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:52:12,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:52:12,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:52:12,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:52:12,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:52:12,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:52:13,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:52:13,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:52:13,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:52:13,134 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:52:13,134 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:52:13,135 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-27 02:52:13,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3f01ca5/08c32c107f114908834f0daf68c18549/FLAG876dc6632 [2019-12-27 02:52:13,742 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:52:13,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-27 02:52:13,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3f01ca5/08c32c107f114908834f0daf68c18549/FLAG876dc6632 [2019-12-27 02:52:14,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3f01ca5/08c32c107f114908834f0daf68c18549 [2019-12-27 02:52:14,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:52:14,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:52:14,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:14,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:52:14,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:52:14,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14, skipping insertion in model container [2019-12-27 02:52:14,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:52:14,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:52:14,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:14,657 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:52:14,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:14,873 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:52:14,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14 WrapperNode [2019-12-27 02:52:14,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:14,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:14,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:52:14,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:52:14,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:14,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:52:14,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:52:14,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:52:14,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... [2019-12-27 02:52:14,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:52:14,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:52:14,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:52:14,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:52:14,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:52:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:52:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:52:15,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:52:15,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:52:15,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:52:15,059 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:52:15,743 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:52:15,743 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:52:15,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:15 BoogieIcfgContainer [2019-12-27 02:52:15,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:52:15,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:52:15,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:52:15,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:52:15,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:52:14" (1/3) ... [2019-12-27 02:52:15,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0067d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:15, skipping insertion in model container [2019-12-27 02:52:15,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:14" (2/3) ... [2019-12-27 02:52:15,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d0067d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:15, skipping insertion in model container [2019-12-27 02:52:15,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:15" (3/3) ... [2019-12-27 02:52:15,754 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_tso.opt.i [2019-12-27 02:52:15,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:52:15,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:52:15,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:52:15,774 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:52:15,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,820 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,869 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,869 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,870 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,870 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,870 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,883 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,888 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,890 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,890 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,897 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:15,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:52:15,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:52:15,936 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:52:15,936 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:52:15,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:52:15,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:52:15,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:52:15,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:52:15,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:52:15,955 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-27 02:52:15,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:52:16,089 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:52:16,090 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:16,110 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:52:16,133 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:52:16,223 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:52:16,223 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:16,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:52:16,246 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:52:16,248 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:52:21,900 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:52:22,036 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:52:22,071 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-27 02:52:22,071 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 02:52:22,075 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-27 02:52:23,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-27 02:52:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-27 02:52:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:52:23,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:23,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:23,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-27 02:52:23,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:23,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630759467] [2019-12-27 02:52:23,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:23,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630759467] [2019-12-27 02:52:23,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:23,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:52:23,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465484191] [2019-12-27 02:52:23,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:23,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:23,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:23,937 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-27 02:52:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:25,509 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-27 02:52:25,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:25,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:52:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:25,718 INFO L225 Difference]: With dead ends: 23966 [2019-12-27 02:52:25,718 INFO L226 Difference]: Without dead ends: 22574 [2019-12-27 02:52:25,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-27 02:52:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-27 02:52:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-27 02:52:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-27 02:52:26,888 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-27 02:52:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:26,889 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-27 02:52:26,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-27 02:52:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:52:26,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:26,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:26,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-27 02:52:26,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:26,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898433252] [2019-12-27 02:52:26,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:27,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898433252] [2019-12-27 02:52:27,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:27,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:27,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346596686] [2019-12-27 02:52:27,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:27,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:27,049 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-27 02:52:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:27,437 INFO L93 Difference]: Finished difference Result 19633 states and 78772 transitions. [2019-12-27 02:52:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:27,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:52:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:27,529 INFO L225 Difference]: With dead ends: 19633 [2019-12-27 02:52:27,529 INFO L226 Difference]: Without dead ends: 18241 [2019-12-27 02:52:27,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18241 states. [2019-12-27 02:52:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18241 to 18241. [2019-12-27 02:52:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18241 states. [2019-12-27 02:52:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18241 states to 18241 states and 73671 transitions. [2019-12-27 02:52:29,338 INFO L78 Accepts]: Start accepts. Automaton has 18241 states and 73671 transitions. Word has length 15 [2019-12-27 02:52:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:29,339 INFO L462 AbstractCegarLoop]: Abstraction has 18241 states and 73671 transitions. [2019-12-27 02:52:29,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18241 states and 73671 transitions. [2019-12-27 02:52:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:52:29,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:29,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:29,343 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1455959988, now seen corresponding path program 1 times [2019-12-27 02:52:29,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:29,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700106860] [2019-12-27 02:52:29,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:29,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700106860] [2019-12-27 02:52:29,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:29,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:52:29,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041517750] [2019-12-27 02:52:29,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:52:29,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:52:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:29,443 INFO L87 Difference]: Start difference. First operand 18241 states and 73671 transitions. Second operand 5 states. [2019-12-27 02:52:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:29,565 INFO L93 Difference]: Finished difference Result 9791 states and 33826 transitions. [2019-12-27 02:52:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:29,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:52:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:29,597 INFO L225 Difference]: With dead ends: 9791 [2019-12-27 02:52:29,597 INFO L226 Difference]: Without dead ends: 8696 [2019-12-27 02:52:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8696 states. [2019-12-27 02:52:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8696 to 8578. [2019-12-27 02:52:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8578 states. [2019-12-27 02:52:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 29475 transitions. [2019-12-27 02:52:30,010 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 29475 transitions. Word has length 16 [2019-12-27 02:52:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:30,011 INFO L462 AbstractCegarLoop]: Abstraction has 8578 states and 29475 transitions. [2019-12-27 02:52:30,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:52:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 29475 transitions. [2019-12-27 02:52:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:52:30,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:30,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:30,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1467159994, now seen corresponding path program 1 times [2019-12-27 02:52:30,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:30,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570291118] [2019-12-27 02:52:30,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:30,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570291118] [2019-12-27 02:52:30,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:30,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:52:30,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495934509] [2019-12-27 02:52:30,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:52:30,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:52:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:52:30,163 INFO L87 Difference]: Start difference. First operand 8578 states and 29475 transitions. Second operand 6 states. [2019-12-27 02:52:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:30,276 INFO L93 Difference]: Finished difference Result 3179 states and 9986 transitions. [2019-12-27 02:52:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:52:30,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 02:52:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:30,288 INFO L225 Difference]: With dead ends: 3179 [2019-12-27 02:52:30,288 INFO L226 Difference]: Without dead ends: 2727 [2019-12-27 02:52:30,289 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-27 02:52:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-12-27 02:52:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2681. [2019-12-27 02:52:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2681 states. [2019-12-27 02:52:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 8397 transitions. [2019-12-27 02:52:30,358 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 8397 transitions. Word has length 17 [2019-12-27 02:52:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:30,358 INFO L462 AbstractCegarLoop]: Abstraction has 2681 states and 8397 transitions. [2019-12-27 02:52:30,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:52:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 8397 transitions. [2019-12-27 02:52:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:52:30,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:30,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:30,361 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-27 02:52:30,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:30,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816602366] [2019-12-27 02:52:30,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:30,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816602366] [2019-12-27 02:52:30,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:30,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:30,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055815365] [2019-12-27 02:52:30,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:30,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:30,397 INFO L87 Difference]: Start difference. First operand 2681 states and 8397 transitions. Second operand 3 states. [2019-12-27 02:52:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:30,461 INFO L93 Difference]: Finished difference Result 3824 states and 11599 transitions. [2019-12-27 02:52:30,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:30,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 02:52:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:30,473 INFO L225 Difference]: With dead ends: 3824 [2019-12-27 02:52:30,473 INFO L226 Difference]: Without dead ends: 3824 [2019-12-27 02:52:30,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2019-12-27 02:52:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3005. [2019-12-27 02:52:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-12-27 02:52:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 9329 transitions. [2019-12-27 02:52:30,545 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 9329 transitions. Word has length 18 [2019-12-27 02:52:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:30,546 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 9329 transitions. [2019-12-27 02:52:30,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 9329 transitions. [2019-12-27 02:52:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:52:30,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:30,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:30,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-27 02:52:30,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:30,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704172025] [2019-12-27 02:52:30,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:30,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704172025] [2019-12-27 02:52:30,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:30,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:30,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878845786] [2019-12-27 02:52:30,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:30,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:30,630 INFO L87 Difference]: Start difference. First operand 3005 states and 9329 transitions. Second operand 4 states. [2019-12-27 02:52:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:30,795 INFO L93 Difference]: Finished difference Result 3798 states and 11512 transitions. [2019-12-27 02:52:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:30,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:52:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:30,808 INFO L225 Difference]: With dead ends: 3798 [2019-12-27 02:52:30,809 INFO L226 Difference]: Without dead ends: 3746 [2019-12-27 02:52:30,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2019-12-27 02:52:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3550. [2019-12-27 02:52:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-12-27 02:52:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 10919 transitions. [2019-12-27 02:52:30,886 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 10919 transitions. Word has length 18 [2019-12-27 02:52:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:30,887 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 10919 transitions. [2019-12-27 02:52:30,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 10919 transitions. [2019-12-27 02:52:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:52:30,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:30,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:30,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-27 02:52:30,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:30,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55448538] [2019-12-27 02:52:30,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:31,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55448538] [2019-12-27 02:52:31,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:31,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:31,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462949317] [2019-12-27 02:52:31,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:31,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:31,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:31,011 INFO L87 Difference]: Start difference. First operand 3550 states and 10919 transitions. Second operand 4 states. [2019-12-27 02:52:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:31,201 INFO L93 Difference]: Finished difference Result 4315 states and 12964 transitions. [2019-12-27 02:52:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:31,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:52:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:31,212 INFO L225 Difference]: With dead ends: 4315 [2019-12-27 02:52:31,212 INFO L226 Difference]: Without dead ends: 4231 [2019-12-27 02:52:31,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-12-27 02:52:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 3556. [2019-12-27 02:52:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-12-27 02:52:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 10868 transitions. [2019-12-27 02:52:31,305 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 10868 transitions. Word has length 18 [2019-12-27 02:52:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:31,305 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 10868 transitions. [2019-12-27 02:52:31,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 10868 transitions. [2019-12-27 02:52:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 02:52:31,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:31,317 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] [2019-12-27 02:52:31,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-27 02:52:31,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:31,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833401030] [2019-12-27 02:52:31,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:31,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833401030] [2019-12-27 02:52:31,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:31,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:52:31,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818170203] [2019-12-27 02:52:31,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:52:31,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:52:31,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:31,460 INFO L87 Difference]: Start difference. First operand 3556 states and 10868 transitions. Second operand 7 states. [2019-12-27 02:52:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:31,588 INFO L93 Difference]: Finished difference Result 2772 states and 8828 transitions. [2019-12-27 02:52:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:52:31,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-27 02:52:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:31,598 INFO L225 Difference]: With dead ends: 2772 [2019-12-27 02:52:31,598 INFO L226 Difference]: Without dead ends: 2670 [2019-12-27 02:52:31,598 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-27 02:52:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2019-12-27 02:52:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2510. [2019-12-27 02:52:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-12-27 02:52:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 8106 transitions. [2019-12-27 02:52:31,658 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 8106 transitions. Word has length 31 [2019-12-27 02:52:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:31,659 INFO L462 AbstractCegarLoop]: Abstraction has 2510 states and 8106 transitions. [2019-12-27 02:52:31,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:52:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 8106 transitions. [2019-12-27 02:52:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:31,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:31,667 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] [2019-12-27 02:52:31,667 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 84854841, now seen corresponding path program 1 times [2019-12-27 02:52:31,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:31,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543321429] [2019-12-27 02:52:31,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:31,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543321429] [2019-12-27 02:52:31,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:31,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:31,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917464667] [2019-12-27 02:52:31,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:31,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:31,882 INFO L87 Difference]: Start difference. First operand 2510 states and 8106 transitions. Second operand 4 states. [2019-12-27 02:52:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:31,911 INFO L93 Difference]: Finished difference Result 3512 states and 10849 transitions. [2019-12-27 02:52:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:31,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 02:52:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:31,917 INFO L225 Difference]: With dead ends: 3512 [2019-12-27 02:52:31,918 INFO L226 Difference]: Without dead ends: 2246 [2019-12-27 02:52:31,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-12-27 02:52:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2019-12-27 02:52:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-12-27 02:52:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 7133 transitions. [2019-12-27 02:52:31,966 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 7133 transitions. Word has length 46 [2019-12-27 02:52:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:31,966 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 7133 transitions. [2019-12-27 02:52:31,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 7133 transitions. [2019-12-27 02:52:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:31,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:31,973 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] [2019-12-27 02:52:31,973 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1609514685, now seen corresponding path program 2 times [2019-12-27 02:52:31,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:31,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105606648] [2019-12-27 02:52:31,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:32,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105606648] [2019-12-27 02:52:32,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:32,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:32,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432157160] [2019-12-27 02:52:32,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:32,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:32,033 INFO L87 Difference]: Start difference. First operand 2246 states and 7133 transitions. Second operand 3 states. [2019-12-27 02:52:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:32,051 INFO L93 Difference]: Finished difference Result 2760 states and 8282 transitions. [2019-12-27 02:52:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:32,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 02:52:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:32,056 INFO L225 Difference]: With dead ends: 2760 [2019-12-27 02:52:32,056 INFO L226 Difference]: Without dead ends: 1627 [2019-12-27 02:52:32,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-27 02:52:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2019-12-27 02:52:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2019-12-27 02:52:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4632 transitions. [2019-12-27 02:52:32,087 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4632 transitions. Word has length 46 [2019-12-27 02:52:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:32,087 INFO L462 AbstractCegarLoop]: Abstraction has 1627 states and 4632 transitions. [2019-12-27 02:52:32,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4632 transitions. [2019-12-27 02:52:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:32,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:32,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:32,092 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1054276201, now seen corresponding path program 3 times [2019-12-27 02:52:32,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:32,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757713101] [2019-12-27 02:52:32,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:32,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757713101] [2019-12-27 02:52:32,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:32,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:32,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234493522] [2019-12-27 02:52:32,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:32,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:32,160 INFO L87 Difference]: Start difference. First operand 1627 states and 4632 transitions. Second operand 4 states. [2019-12-27 02:52:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:32,180 INFO L93 Difference]: Finished difference Result 2003 states and 5495 transitions. [2019-12-27 02:52:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:32,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 02:52:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:32,182 INFO L225 Difference]: With dead ends: 2003 [2019-12-27 02:52:32,182 INFO L226 Difference]: Without dead ends: 421 [2019-12-27 02:52:32,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-27 02:52:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-27 02:52:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-27 02:52:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 942 transitions. [2019-12-27 02:52:32,190 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 942 transitions. Word has length 46 [2019-12-27 02:52:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:32,190 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 942 transitions. [2019-12-27 02:52:32,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 942 transitions. [2019-12-27 02:52:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:32,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:32,192 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] [2019-12-27 02:52:32,192 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash 401636329, now seen corresponding path program 4 times [2019-12-27 02:52:32,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:32,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607713426] [2019-12-27 02:52:32,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:32,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607713426] [2019-12-27 02:52:32,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:32,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:52:32,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905437704] [2019-12-27 02:52:32,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:52:32,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:52:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:32,272 INFO L87 Difference]: Start difference. First operand 421 states and 942 transitions. Second operand 7 states. [2019-12-27 02:52:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:32,473 INFO L93 Difference]: Finished difference Result 808 states and 1765 transitions. [2019-12-27 02:52:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:52:32,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-27 02:52:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:32,475 INFO L225 Difference]: With dead ends: 808 [2019-12-27 02:52:32,476 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 02:52:32,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:52:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 02:52:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 484. [2019-12-27 02:52:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-27 02:52:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1050 transitions. [2019-12-27 02:52:32,487 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1050 transitions. Word has length 46 [2019-12-27 02:52:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:32,487 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1050 transitions. [2019-12-27 02:52:32,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:52:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1050 transitions. [2019-12-27 02:52:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:32,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:32,489 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] [2019-12-27 02:52:32,489 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash -683037313, now seen corresponding path program 5 times [2019-12-27 02:52:32,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:32,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099605945] [2019-12-27 02:52:32,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:32,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099605945] [2019-12-27 02:52:32,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:32,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:32,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461736018] [2019-12-27 02:52:32,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:32,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:32,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:32,626 INFO L87 Difference]: Start difference. First operand 484 states and 1050 transitions. Second operand 3 states. [2019-12-27 02:52:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:32,646 INFO L93 Difference]: Finished difference Result 482 states and 1045 transitions. [2019-12-27 02:52:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:32,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 02:52:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:32,648 INFO L225 Difference]: With dead ends: 482 [2019-12-27 02:52:32,648 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 02:52:32,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 02:52:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-27 02:52:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 02:52:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1045 transitions. [2019-12-27 02:52:32,657 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1045 transitions. Word has length 46 [2019-12-27 02:52:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:32,658 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1045 transitions. [2019-12-27 02:52:32,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1045 transitions. [2019-12-27 02:52:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:52:32,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:32,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:32,661 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 1 times [2019-12-27 02:52:32,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:32,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731243476] [2019-12-27 02:52:32,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:32,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:52:32,831 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:52:32,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36| 1)) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36|)) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 |v_ULTIMATE.start_main_~#t1381~0.offset_23|) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36|) |v_ULTIMATE.start_main_~#t1381~0.offset_23| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1381~0.base_36|) (= |v_#NULL.offset_5| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1381~0.base_36| 4)) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ULTIMATE.start_main_~#t1381~0.base=|v_ULTIMATE.start_main_~#t1381~0.base_36|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_17|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_24|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_37|, ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t1381~0.offset=|v_ULTIMATE.start_main_~#t1381~0.offset_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1381~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1384~0.base, #length, ULTIMATE.start_main_~#t1382~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1382~0.base, ULTIMATE.start_main_~#t1384~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1383~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1383~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1381~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, 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-27 02:52:32,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11| 1) |v_#valid_43|) (= 0 |v_ULTIMATE.start_main_~#t1382~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1382~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1382~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) |v_ULTIMATE.start_main_~#t1382~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1382~0.offset, #length, ULTIMATE.start_main_~#t1382~0.base] because there is no mapped edge [2019-12-27 02:52:32,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1383~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11|) |v_ULTIMATE.start_main_~#t1383~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1383~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1383~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11| 1) |v_#valid_41|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1383~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1383~0.offset] because there is no mapped edge [2019-12-27 02:52:32,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1384~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13|) |v_ULTIMATE.start_main_~#t1384~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1384~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1384~0.base_13| 4) |v_#length_23|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1384~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1384~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1384~0.base, #length] because there is no mapped edge [2019-12-27 02:52:32,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22)) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:52:32,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= 0 |v_P0Thread1of1ForFork2_#res.offset_13|) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= v_~x~0_51 1) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 02:52:32,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|) (= v_~x~0_33 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 02:52:32,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-290652379 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-290652379 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-290652379| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out-290652379| ~z$w_buff0_used~0_In-290652379) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-290652379, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-290652379} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-290652379, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-290652379|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-290652379} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:52:32,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1178604955 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1178604955 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1178604955 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1178604955 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out1178604955| ~z$w_buff1_used~0_In1178604955) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1178604955| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1178604955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1178604955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1178604955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1178604955} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1178604955, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1178604955|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1178604955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1178604955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1178604955} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:52:32,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-780159314 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-780159314 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-780159314 ~z$r_buff0_thd4~0_In-780159314)) (and (= ~z$r_buff0_thd4~0_Out-780159314 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-780159314, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-780159314} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-780159314, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-780159314, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-780159314|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:52:32,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-286021796 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-286021796 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-286021796 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-286021796 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out-286021796| ~z$r_buff1_thd4~0_In-286021796)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork1_#t~ite31_Out-286021796| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-286021796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-286021796, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-286021796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-286021796} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-286021796, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-286021796, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-286021796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-286021796, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-286021796|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:32,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#t~ite31_62| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_62|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_61|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:32,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite22_31| |v_P2Thread1of1ForFork0_#t~ite22_30|) (= |v_P2Thread1of1ForFork0_#t~ite23_33| |v_P2Thread1of1ForFork0_#t~ite23_32|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0)) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_46|)) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_30|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_32|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_46|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_31|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:52:32,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:52:32,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:52:32,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1823770630 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1823770630 256)))) (or (and (= ~z~0_In1823770630 |ULTIMATE.start_main_#t~ite36_Out1823770630|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In1823770630 |ULTIMATE.start_main_#t~ite36_Out1823770630|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1823770630, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1823770630, ~z$w_buff1~0=~z$w_buff1~0_In1823770630, ~z~0=~z~0_In1823770630} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1823770630, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1823770630, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1823770630|, ~z$w_buff1~0=~z$w_buff1~0_In1823770630, ~z~0=~z~0_In1823770630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:52:32,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 02:52:32,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1025051734 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1025051734 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1025051734 |ULTIMATE.start_main_#t~ite38_Out-1025051734|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1025051734|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1025051734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025051734} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1025051734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025051734, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1025051734|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:52:32,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2109125614 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2109125614 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-2109125614 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-2109125614 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-2109125614| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-2109125614| ~z$w_buff1_used~0_In-2109125614) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2109125614, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2109125614, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2109125614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2109125614} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2109125614, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2109125614|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2109125614, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2109125614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2109125614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:52:32,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-830315897 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-830315897 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-830315897| ~z$r_buff0_thd0~0_In-830315897)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-830315897| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-830315897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-830315897} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-830315897, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-830315897|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-830315897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:52:32,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1838594371 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1838594371 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1838594371 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1838594371 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1838594371|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1838594371 |ULTIMATE.start_main_#t~ite41_Out-1838594371|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1838594371, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838594371, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1838594371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1838594371} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1838594371|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1838594371, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838594371, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1838594371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1838594371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:52:32,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:52:32,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:52:32 BasicIcfg [2019-12-27 02:52:32,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:52:32,987 INFO L168 Benchmark]: Toolchain (without parser) took 18948.08 ms. Allocated memory was 138.9 MB in the beginning and 960.0 MB in the end (delta: 821.0 MB). Free memory was 101.8 MB in the beginning and 402.1 MB in the end (delta: -300.3 MB). Peak memory consumption was 520.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,988 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.85 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 155.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,990 INFO L168 Benchmark]: Boogie Preprocessor took 40.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,991 INFO L168 Benchmark]: RCFGBuilder took 765.17 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 103.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,992 INFO L168 Benchmark]: TraceAbstraction took 17239.18 ms. Allocated memory was 203.4 MB in the beginning and 960.0 MB in the end (delta: 756.5 MB). Free memory was 103.9 MB in the beginning and 402.1 MB in the end (delta: -298.2 MB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:32,996 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.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.85 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 155.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.17 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 103.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17239.18 ms. Allocated memory was 203.4 MB in the beginning and 960.0 MB in the end (delta: 756.5 MB). Free memory was 103.9 MB in the beginning and 402.1 MB in the end (delta: -298.2 MB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L835] FCALL, FORK 0 pthread_create(&t1382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L837] FCALL, FORK 0 pthread_create(&t1383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L839] FCALL, FORK 0 pthread_create(&t1384, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, weak$$choice2=1, x=2, y=1, 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] [L773] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, weak$$choice2=1, x=2, y=1, 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] [L810] 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) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L773] 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) [L774] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 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)) [L775] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, 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=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 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)) [L776] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, 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))=0, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 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)) [L777] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 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)) [L779] 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)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, weak$$choice2=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1385 SDtfs, 2125 SDslu, 2185 SDs, 0 SdLazy, 502 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24606occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2074 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 55817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...