/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:59:41,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:59:41,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:59:41,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:59:41,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:59:41,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:59:41,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:59:41,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:59:41,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:59:41,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:59:41,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:59:41,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:59:41,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:59:41,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:59:41,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:59:41,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:59:41,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:59:41,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:59:41,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:59:41,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:59:41,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:59:41,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:59:41,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:59:41,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:59:41,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:59:41,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:59:41,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:59:41,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:59:41,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:59:41,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:59:41,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:59:41,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:59:41,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:59:41,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:59:41,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:59:41,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:59:41,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:59:41,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:59:41,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:59:41,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:59:41,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:59:41,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:59:41,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:59:41,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:59:41,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:59:41,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:59:41,807 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:59:41,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:59:41,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:59:41,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:59:41,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:59:41,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:59:41,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:59:41,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:59:41,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:59:41,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:59:41,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:59:41,809 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:59:41,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:59:41,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:59:41,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:59:41,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:59:41,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:59:41,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:59:41,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:59:41,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:59:41,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:59:41,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:59:41,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:59:41,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:59:41,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:59:41,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:59:42,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:59:42,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:59:42,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:59:42,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:59:42,123 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:59:42,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2019-12-26 22:59:42,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c883e3dd0/19798fa7d2064b0c8cfe1538b9937e6f/FLAG353143b43 [2019-12-26 22:59:42,756 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:59:42,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2019-12-26 22:59:42,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c883e3dd0/19798fa7d2064b0c8cfe1538b9937e6f/FLAG353143b43 [2019-12-26 22:59:43,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c883e3dd0/19798fa7d2064b0c8cfe1538b9937e6f [2019-12-26 22:59:43,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:59:43,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:59:43,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:59:43,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:59:43,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:59:43,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb2686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43, skipping insertion in model container [2019-12-26 22:59:43,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:59:43,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:59:43,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:59:43,594 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:59:43,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:59:43,751 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:59:43,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43 WrapperNode [2019-12-26 22:59:43,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:59:43,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:59:43,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:59:43,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:59:43,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:59:43,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:59:43,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:59:43,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:59:43,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... [2019-12-26 22:59:43,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:59:43,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:59:43,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:59:43,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:59:43,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:59:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:59:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:59:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:59:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:59:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:59:43,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:59:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:59:43,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:59:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:59:43,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:59:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:59:43,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:59:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:59:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:59:43,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:59:43,938 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:59:44,651 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:59:44,652 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:59:44,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:59:44 BoogieIcfgContainer [2019-12-26 22:59:44,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:59:44,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:59:44,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:59:44,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:59:44,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:59:43" (1/3) ... [2019-12-26 22:59:44,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e4b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:59:44, skipping insertion in model container [2019-12-26 22:59:44,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:43" (2/3) ... [2019-12-26 22:59:44,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e4b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:59:44, skipping insertion in model container [2019-12-26 22:59:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:59:44" (3/3) ... [2019-12-26 22:59:44,662 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_tso.opt.i [2019-12-26 22:59:44,673 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:59:44,673 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:59:44,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:59:44,682 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:59:44,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,783 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,788 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,792 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,795 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:44,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:59:44,829 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:59:44,829 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:59:44,829 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:59:44,829 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:59:44,829 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:59:44,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:59:44,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:59:44,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:59:44,845 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-26 22:59:44,847 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-26 22:59:44,950 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-26 22:59:44,950 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:59:44,964 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:59:44,985 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-26 22:59:45,055 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-26 22:59:45,056 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:59:45,064 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:59:45,086 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-26 22:59:45,087 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:59:50,274 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 22:59:50,377 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 22:59:50,685 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 22:59:50,827 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 22:59:50,844 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48182 [2019-12-26 22:59:50,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-26 22:59:50,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 86 transitions [2019-12-26 22:59:52,726 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25454 states. [2019-12-26 22:59:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states. [2019-12-26 22:59:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:59:52,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:52,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:52,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1973922445, now seen corresponding path program 1 times [2019-12-26 22:59:52,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:52,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662671095] [2019-12-26 22:59:52,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:53,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662671095] [2019-12-26 22:59:53,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:53,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:59:53,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719875988] [2019-12-26 22:59:53,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:53,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:53,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:53,065 INFO L87 Difference]: Start difference. First operand 25454 states. Second operand 3 states. [2019-12-26 22:59:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:54,154 INFO L93 Difference]: Finished difference Result 24966 states and 109408 transitions. [2019-12-26 22:59:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:54,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:59:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:54,450 INFO L225 Difference]: With dead ends: 24966 [2019-12-26 22:59:54,451 INFO L226 Difference]: Without dead ends: 23406 [2019-12-26 22:59:54,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23406 states. [2019-12-26 22:59:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23406 to 23406. [2019-12-26 22:59:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23406 states. [2019-12-26 22:59:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 102424 transitions. [2019-12-26 22:59:55,698 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 102424 transitions. Word has length 9 [2019-12-26 22:59:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:55,700 INFO L462 AbstractCegarLoop]: Abstraction has 23406 states and 102424 transitions. [2019-12-26 22:59:55,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 102424 transitions. [2019-12-26 22:59:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:59:55,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:55,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:55,714 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 918860120, now seen corresponding path program 1 times [2019-12-26 22:59:55,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:55,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365405953] [2019-12-26 22:59:55,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:55,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365405953] [2019-12-26 22:59:55,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:55,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:55,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329680646] [2019-12-26 22:59:55,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:55,842 INFO L87 Difference]: Start difference. First operand 23406 states and 102424 transitions. Second operand 3 states. [2019-12-26 22:59:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:56,983 INFO L93 Difference]: Finished difference Result 18741 states and 76288 transitions. [2019-12-26 22:59:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:56,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:59:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:57,119 INFO L225 Difference]: With dead ends: 18741 [2019-12-26 22:59:57,119 INFO L226 Difference]: Without dead ends: 18741 [2019-12-26 22:59:57,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-26 22:59:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 18741. [2019-12-26 22:59:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18741 states. [2019-12-26 22:59:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18741 states to 18741 states and 76288 transitions. [2019-12-26 22:59:57,873 INFO L78 Accepts]: Start accepts. Automaton has 18741 states and 76288 transitions. Word has length 15 [2019-12-26 22:59:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:57,874 INFO L462 AbstractCegarLoop]: Abstraction has 18741 states and 76288 transitions. [2019-12-26 22:59:57,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 18741 states and 76288 transitions. [2019-12-26 22:59:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:59:57,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:57,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:57,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash -186823823, now seen corresponding path program 1 times [2019-12-26 22:59:57,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:57,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360369237] [2019-12-26 22:59:57,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:57,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360369237] [2019-12-26 22:59:57,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:57,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:57,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410315328] [2019-12-26 22:59:57,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:57,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:57,937 INFO L87 Difference]: Start difference. First operand 18741 states and 76288 transitions. Second operand 4 states. [2019-12-26 22:59:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,011 INFO L93 Difference]: Finished difference Result 8735 states and 30238 transitions. [2019-12-26 22:59:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:59:58,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:59:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,036 INFO L225 Difference]: With dead ends: 8735 [2019-12-26 22:59:58,036 INFO L226 Difference]: Without dead ends: 8735 [2019-12-26 22:59:58,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-12-26 22:59:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 8735. [2019-12-26 22:59:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8735 states. [2019-12-26 22:59:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 30238 transitions. [2019-12-26 22:59:58,261 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 30238 transitions. Word has length 16 [2019-12-26 22:59:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,261 INFO L462 AbstractCegarLoop]: Abstraction has 8735 states and 30238 transitions. [2019-12-26 22:59:58,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 30238 transitions. [2019-12-26 22:59:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:59:58,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1930084165, now seen corresponding path program 1 times [2019-12-26 22:59:58,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981415917] [2019-12-26 22:59:58,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981415917] [2019-12-26 22:59:58,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:59:58,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708804868] [2019-12-26 22:59:58,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:59:58,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:59:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:58,367 INFO L87 Difference]: Start difference. First operand 8735 states and 30238 transitions. Second operand 5 states. [2019-12-26 22:59:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,422 INFO L93 Difference]: Finished difference Result 2694 states and 8482 transitions. [2019-12-26 22:59:58,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:58,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:59:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,431 INFO L225 Difference]: With dead ends: 2694 [2019-12-26 22:59:58,432 INFO L226 Difference]: Without dead ends: 2694 [2019-12-26 22:59:58,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-12-26 22:59:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694. [2019-12-26 22:59:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2019-12-26 22:59:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 8482 transitions. [2019-12-26 22:59:58,487 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 8482 transitions. Word has length 17 [2019-12-26 22:59:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,487 INFO L462 AbstractCegarLoop]: Abstraction has 2694 states and 8482 transitions. [2019-12-26 22:59:58,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:59:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 8482 transitions. [2019-12-26 22:59:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:59:58,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,490 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1944850996, now seen corresponding path program 1 times [2019-12-26 22:59:58,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121632388] [2019-12-26 22:59:58,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121632388] [2019-12-26 22:59:58,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:58,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258503324] [2019-12-26 22:59:58,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:58,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:58,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:58,550 INFO L87 Difference]: Start difference. First operand 2694 states and 8482 transitions. Second operand 3 states. [2019-12-26 22:59:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,620 INFO L93 Difference]: Finished difference Result 3870 states and 11760 transitions. [2019-12-26 22:59:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 22:59:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,632 INFO L225 Difference]: With dead ends: 3870 [2019-12-26 22:59:58,632 INFO L226 Difference]: Without dead ends: 3870 [2019-12-26 22:59:58,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-12-26 22:59:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3162. [2019-12-26 22:59:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-12-26 22:59:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 9820 transitions. [2019-12-26 22:59:58,734 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 9820 transitions. Word has length 18 [2019-12-26 22:59:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,735 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 9820 transitions. [2019-12-26 22:59:58,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 9820 transitions. [2019-12-26 22:59:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:59:58,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,738 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1944972733, now seen corresponding path program 1 times [2019-12-26 22:59:58,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309565144] [2019-12-26 22:59:58,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309565144] [2019-12-26 22:59:58,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:58,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948597675] [2019-12-26 22:59:58,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:58,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:58,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:58,833 INFO L87 Difference]: Start difference. First operand 3162 states and 9820 transitions. Second operand 4 states. [2019-12-26 22:59:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,007 INFO L93 Difference]: Finished difference Result 4044 states and 12266 transitions. [2019-12-26 22:59:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:59,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:59:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,021 INFO L225 Difference]: With dead ends: 4044 [2019-12-26 22:59:59,021 INFO L226 Difference]: Without dead ends: 4044 [2019-12-26 22:59:59,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2019-12-26 22:59:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 3838. [2019-12-26 22:59:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3838 states. [2019-12-26 22:59:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 11816 transitions. [2019-12-26 22:59:59,189 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 11816 transitions. Word has length 18 [2019-12-26 22:59:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,190 INFO L462 AbstractCegarLoop]: Abstraction has 3838 states and 11816 transitions. [2019-12-26 22:59:59,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 11816 transitions. [2019-12-26 22:59:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:59:59,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -760266034, now seen corresponding path program 1 times [2019-12-26 22:59:59,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012553023] [2019-12-26 22:59:59,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012553023] [2019-12-26 22:59:59,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:59,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119371428] [2019-12-26 22:59:59,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:59,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:59,279 INFO L87 Difference]: Start difference. First operand 3838 states and 11816 transitions. Second operand 4 states. [2019-12-26 22:59:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,456 INFO L93 Difference]: Finished difference Result 4824 states and 14628 transitions. [2019-12-26 22:59:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:59,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:59:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,465 INFO L225 Difference]: With dead ends: 4824 [2019-12-26 22:59:59,466 INFO L226 Difference]: Without dead ends: 4824 [2019-12-26 22:59:59,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-26 22:59:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4055. [2019-12-26 22:59:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4055 states. [2019-12-26 22:59:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 12506 transitions. [2019-12-26 22:59:59,550 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 12506 transitions. Word has length 18 [2019-12-26 22:59:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,550 INFO L462 AbstractCegarLoop]: Abstraction has 4055 states and 12506 transitions. [2019-12-26 22:59:59,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 12506 transitions. [2019-12-26 22:59:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:59:59,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,561 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 882681234, now seen corresponding path program 1 times [2019-12-26 22:59:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643978434] [2019-12-26 22:59:59,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643978434] [2019-12-26 22:59:59,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:59:59,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352470456] [2019-12-26 22:59:59,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:59:59,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:59:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:59:59,632 INFO L87 Difference]: Start difference. First operand 4055 states and 12506 transitions. Second operand 6 states. [2019-12-26 22:59:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,711 INFO L93 Difference]: Finished difference Result 3144 states and 10159 transitions. [2019-12-26 22:59:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:59:59,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:59:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,719 INFO L225 Difference]: With dead ends: 3144 [2019-12-26 22:59:59,720 INFO L226 Difference]: Without dead ends: 3144 [2019-12-26 22:59:59,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:59:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-12-26 22:59:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2944. [2019-12-26 22:59:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-26 22:59:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9559 transitions. [2019-12-26 22:59:59,803 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9559 transitions. Word has length 32 [2019-12-26 22:59:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,804 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 9559 transitions. [2019-12-26 22:59:59,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:59:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9559 transitions. [2019-12-26 22:59:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:59:59,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,817 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-26 22:59:59,818 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1547273410, now seen corresponding path program 1 times [2019-12-26 22:59:59,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517059168] [2019-12-26 22:59:59,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517059168] [2019-12-26 22:59:59,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:59,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796330694] [2019-12-26 22:59:59,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:59,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:59,944 INFO L87 Difference]: Start difference. First operand 2944 states and 9559 transitions. Second operand 4 states. [2019-12-26 22:59:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,976 INFO L93 Difference]: Finished difference Result 4140 states and 12859 transitions. [2019-12-26 22:59:59,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:59:59,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 22:59:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,983 INFO L225 Difference]: With dead ends: 4140 [2019-12-26 22:59:59,983 INFO L226 Difference]: Without dead ends: 2658 [2019-12-26 22:59:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-26 23:00:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658. [2019-12-26 23:00:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-12-26 23:00:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 8505 transitions. [2019-12-26 23:00:00,035 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 8505 transitions. Word has length 47 [2019-12-26 23:00:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,035 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 8505 transitions. [2019-12-26 23:00:00,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 8505 transitions. [2019-12-26 23:00:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 23:00:00,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,043 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-26 23:00:00,044 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1022183476, now seen corresponding path program 2 times [2019-12-26 23:00:00,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567828733] [2019-12-26 23:00:00,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:00,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567828733] [2019-12-26 23:00:00,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:00,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774817004] [2019-12-26 23:00:00,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:00,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,105 INFO L87 Difference]: Start difference. First operand 2658 states and 8505 transitions. Second operand 3 states. [2019-12-26 23:00:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,124 INFO L93 Difference]: Finished difference Result 3268 states and 9882 transitions. [2019-12-26 23:00:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:00,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-26 23:00:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,129 INFO L225 Difference]: With dead ends: 3268 [2019-12-26 23:00:00,129 INFO L226 Difference]: Without dead ends: 1930 [2019-12-26 23:00:00,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-12-26 23:00:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2019-12-26 23:00:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2019-12-26 23:00:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5542 transitions. [2019-12-26 23:00:00,165 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5542 transitions. Word has length 47 [2019-12-26 23:00:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,165 INFO L462 AbstractCegarLoop]: Abstraction has 1930 states and 5542 transitions. [2019-12-26 23:00:00,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5542 transitions. [2019-12-26 23:00:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 23:00:00,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,170 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-26 23:00:00,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash -210383636, now seen corresponding path program 3 times [2019-12-26 23:00:00,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338724447] [2019-12-26 23:00:00,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:00,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338724447] [2019-12-26 23:00:00,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:00,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262449960] [2019-12-26 23:00:00,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:00,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,233 INFO L87 Difference]: Start difference. First operand 1930 states and 5542 transitions. Second operand 3 states. [2019-12-26 23:00:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,248 INFO L93 Difference]: Finished difference Result 2372 states and 6561 transitions. [2019-12-26 23:00:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:00,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-26 23:00:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,250 INFO L225 Difference]: With dead ends: 2372 [2019-12-26 23:00:00,250 INFO L226 Difference]: Without dead ends: 490 [2019-12-26 23:00:00,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-26 23:00:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-12-26 23:00:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-26 23:00:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1104 transitions. [2019-12-26 23:00:00,258 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1104 transitions. Word has length 47 [2019-12-26 23:00:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,258 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1104 transitions. [2019-12-26 23:00:00,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1104 transitions. [2019-12-26 23:00:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 23:00:00,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,260 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-26 23:00:00,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -493161086, now seen corresponding path program 4 times [2019-12-26 23:00:00,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761279382] [2019-12-26 23:00:00,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:00,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761279382] [2019-12-26 23:00:00,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:00,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502150029] [2019-12-26 23:00:00,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:00:00,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:00:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:00,350 INFO L87 Difference]: Start difference. First operand 490 states and 1104 transitions. Second operand 7 states. [2019-12-26 23:00:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,541 INFO L93 Difference]: Finished difference Result 890 states and 1958 transitions. [2019-12-26 23:00:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:00:00,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-26 23:00:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,543 INFO L225 Difference]: With dead ends: 890 [2019-12-26 23:00:00,543 INFO L226 Difference]: Without dead ends: 604 [2019-12-26 23:00:00,543 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-26 23:00:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-26 23:00:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 546. [2019-12-26 23:00:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-26 23:00:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1193 transitions. [2019-12-26 23:00:00,551 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1193 transitions. Word has length 47 [2019-12-26 23:00:00,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,551 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1193 transitions. [2019-12-26 23:00:00,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:00:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1193 transitions. [2019-12-26 23:00:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 23:00:00,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,553 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-26 23:00:00,553 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1709037106, now seen corresponding path program 5 times [2019-12-26 23:00:00,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310699402] [2019-12-26 23:00:00,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:00,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310699402] [2019-12-26 23:00:00,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:00,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968227184] [2019-12-26 23:00:00,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:00,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,685 INFO L87 Difference]: Start difference. First operand 546 states and 1193 transitions. Second operand 3 states. [2019-12-26 23:00:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,773 INFO L93 Difference]: Finished difference Result 546 states and 1191 transitions. [2019-12-26 23:00:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:00,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-26 23:00:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,774 INFO L225 Difference]: With dead ends: 546 [2019-12-26 23:00:00,774 INFO L226 Difference]: Without dead ends: 546 [2019-12-26 23:00:00,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-26 23:00:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-12-26 23:00:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-26 23:00:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1191 transitions. [2019-12-26 23:00:00,782 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1191 transitions. Word has length 47 [2019-12-26 23:00:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,783 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1191 transitions. [2019-12-26 23:00:00,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1191 transitions. [2019-12-26 23:00:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 23:00:00,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:00,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash 81842901, now seen corresponding path program 1 times [2019-12-26 23:00:00,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521478108] [2019-12-26 23:00:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:00,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:00,909 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:00,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= (select .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44|) 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1437~0.base_44|) |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1437~0.base_44|) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (= |v_#valid_89| (store .cse0 |v_ULTIMATE.start_main_~#t1437~0.base_44| 1)) (= 0 v_~z$r_buff1_thd4~0_125) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1437~0.offset_29| 0) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1437~0.base_44| 4)) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_29|, ~a~0=v_~a~0_45, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ULTIMATE.start_main_~#t1437~0.base=|v_ULTIMATE.start_main_~#t1437~0.base_44|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ~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_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ULTIMATE.start_main_~#t1437~0.offset=|v_ULTIMATE.start_main_~#t1437~0.offset_29|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_36|, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1440~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1438~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1437~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1437~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1438~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1439~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1439~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:00:00,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1438~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t1438~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1438~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1438~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1438~0.base_12|) |v_ULTIMATE.start_main_~#t1438~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1438~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1438~0.offset=|v_ULTIMATE.start_main_~#t1438~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1438~0.base=|v_ULTIMATE.start_main_~#t1438~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1438~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1438~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:00:00,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1439~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1439~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1439~0.base_11| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11| 1) |v_#valid_37|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1439~0.base_11|) |v_ULTIMATE.start_main_~#t1439~0.offset_10| 2)) |v_#memory_int_15|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1439~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1439~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1439~0.offset=|v_ULTIMATE.start_main_~#t1439~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1439~0.base=|v_ULTIMATE.start_main_~#t1439~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1439~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1439~0.base] because there is no mapped edge [2019-12-26 23:00:00,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1440~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1440~0.base_12| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1440~0.base_12| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1440~0.base_12|) |v_ULTIMATE.start_main_~#t1440~0.offset_10| 3)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1440~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1440~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1440~0.base=|v_ULTIMATE.start_main_~#t1440~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1440~0.offset=|v_ULTIMATE.start_main_~#t1440~0.offset_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1440~0.base, ULTIMATE.start_main_~#t1440~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:00:00,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork1_~arg.base_15 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= 0 (mod v_~z$w_buff1_used~0_70 256)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| 1) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_17) (= v_P3Thread1of1ForFork1_~arg.offset_15 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_15, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 23:00:00,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_24 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_24) (= v_~a~0_34 1) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_24, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_24} 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-26 23:00:00,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_15) (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~y~0_33 1) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-26 23:00:00,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1276042046 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1276042046 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out1276042046| ~z$w_buff0_used~0_In1276042046) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out1276042046| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1276042046, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1276042046} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1276042046, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1276042046|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1276042046} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 23:00:00,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1435266712 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1435266712 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1435266712 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1435266712 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1435266712 |P3Thread1of1ForFork1_#t~ite29_Out1435266712|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1435266712|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1435266712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1435266712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1435266712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1435266712} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1435266712, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1435266712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1435266712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1435266712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1435266712} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-26 23:00:00,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1341664949 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1341664949 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1341664949) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1341664949 ~z$r_buff0_thd4~0_Out-1341664949)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341664949, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1341664949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341664949, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1341664949, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1341664949|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:00:00,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1634322896 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1634322896 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1634322896 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1634322896 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out-1634322896|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd4~0_In-1634322896 |P3Thread1of1ForFork1_#t~ite31_Out-1634322896|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1634322896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634322896, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1634322896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1634322896} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1634322896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634322896, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1634322896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1634322896, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-1634322896|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 23:00:00,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-247582414 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-247582414| |P2Thread1of1ForFork0_#t~ite12_Out-247582414|) (= |P2Thread1of1ForFork0_#t~ite11_Out-247582414| ~z$w_buff1~0_In-247582414) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-247582414 256)))) (or (= (mod ~z$w_buff0_used~0_In-247582414 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-247582414 256))) (and (= (mod ~z$r_buff1_thd3~0_In-247582414 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out-247582414| ~z$w_buff1~0_In-247582414) (= |P2Thread1of1ForFork0_#t~ite11_In-247582414| |P2Thread1of1ForFork0_#t~ite11_Out-247582414|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-247582414, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-247582414|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-247582414, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-247582414, ~z$w_buff1~0=~z$w_buff1~0_In-247582414, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-247582414, ~weak$$choice2~0=~weak$$choice2~0_In-247582414} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-247582414|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247582414, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-247582414|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-247582414, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-247582414, ~z$w_buff1~0=~z$w_buff1~0_In-247582414, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-247582414, ~weak$$choice2~0=~weak$$choice2~0_In-247582414} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 23:00:00,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_46|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_46|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_45|} 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-26 23:00:00,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-26 23:00:00,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:00:00,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:00:00,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1996227121 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1996227121 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite36_Out1996227121| |ULTIMATE.start_main_#t~ite37_Out1996227121|))) (or (and (= ~z$w_buff1~0_In1996227121 |ULTIMATE.start_main_#t~ite36_Out1996227121|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~z~0_In1996227121 |ULTIMATE.start_main_#t~ite36_Out1996227121|) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1996227121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1996227121, ~z$w_buff1~0=~z$w_buff1~0_In1996227121, ~z~0=~z~0_In1996227121} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1996227121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1996227121, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1996227121|, ~z$w_buff1~0=~z$w_buff1~0_In1996227121, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1996227121|, ~z~0=~z~0_In1996227121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 23:00:00,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2091257984 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2091257984 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-2091257984|)) (and (= ~z$w_buff0_used~0_In-2091257984 |ULTIMATE.start_main_#t~ite38_Out-2091257984|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2091257984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091257984} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2091257984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091257984, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2091257984|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 23:00:00,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1884629798 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1884629798 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1884629798 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1884629798 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1884629798|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1884629798 |ULTIMATE.start_main_#t~ite39_Out-1884629798|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1884629798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1884629798, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1884629798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1884629798} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1884629798, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1884629798|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1884629798, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1884629798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1884629798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 23:00:00,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1599044083 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1599044083 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1599044083 |ULTIMATE.start_main_#t~ite40_Out-1599044083|)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-1599044083|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1599044083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1599044083} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1599044083, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1599044083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1599044083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:00:00,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-286031076 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-286031076 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-286031076 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-286031076 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-286031076| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-286031076 |ULTIMATE.start_main_#t~ite41_Out-286031076|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-286031076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-286031076, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-286031076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-286031076} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-286031076|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-286031076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-286031076, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-286031076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-286031076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:00:00,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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-26 23:00:01,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:01 BasicIcfg [2019-12-26 23:00:01,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:01,043 INFO L168 Benchmark]: Toolchain (without parser) took 18022.95 ms. Allocated memory was 146.3 MB in the beginning and 926.9 MB in the end (delta: 780.7 MB). Free memory was 102.5 MB in the beginning and 654.0 MB in the end (delta: -551.5 MB). Peak memory consumption was 229.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,044 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.57 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.14 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,050 INFO L168 Benchmark]: Boogie Preprocessor took 45.55 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,051 INFO L168 Benchmark]: RCFGBuilder took 781.28 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 107.5 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,052 INFO L168 Benchmark]: TraceAbstraction took 16386.77 ms. Allocated memory was 203.9 MB in the beginning and 926.9 MB in the end (delta: 723.0 MB). Free memory was 106.9 MB in the beginning and 654.0 MB in the end (delta: -547.1 MB). Peak memory consumption was 175.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:01,059 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.38 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.57 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.14 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.55 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.28 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 107.5 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16386.77 ms. Allocated memory was 203.9 MB in the beginning and 926.9 MB in the end (delta: 723.0 MB). Free memory was 106.9 MB in the beginning and 654.0 MB in the end (delta: -547.1 MB). Peak memory consumption was 175.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 167 ProgramPointsBefore, 78 ProgramPointsAfterwards, 189 TransitionsBefore, 86 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 19 ChoiceCompositions, 5650 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 185 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 48182 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L833] FCALL, FORK 0 pthread_create(&t1438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] FCALL, FORK 0 pthread_create(&t1439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] FCALL, FORK 0 pthread_create(&t1440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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=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] [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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=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] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 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) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 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 [L771] 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) [L772] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 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)) [L773] 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)) [L774] 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_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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 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)) [L775] 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_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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 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)) [L777] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 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)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1418 SDtfs, 1467 SDslu, 1969 SDs, 0 SdLazy, 498 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25454occurred 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: 2.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1941 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 33649 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...