/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:50:24,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:50:24,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:50:24,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:50:24,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:50:24,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:50:24,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:50:24,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:50:24,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:50:24,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:50:24,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:50:24,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:50:24,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:50:24,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:50:24,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:50:24,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:50:24,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:50:24,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:50:24,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:50:24,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:50:24,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:50:24,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:50:24,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:50:24,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:50:24,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:50:24,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:50:24,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:50:24,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:50:24,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:50:24,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:50:24,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:50:24,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:50:24,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:50:24,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:50:24,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:50:24,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:50:24,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:50:24,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:50:24,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:50:24,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:50:24,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:50:24,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:50:24,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:50:24,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:50:24,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:50:24,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:50:24,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:50:24,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:50:24,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:50:24,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:50:24,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:50:24,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:50:24,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:50:24,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:50:24,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:50:24,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:50:24,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:50:24,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:50:24,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:50:24,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:50:24,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:50:24,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:50:24,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:50:24,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:50:24,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:50:24,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:50:24,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:50:24,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:50:24,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:50:24,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:50:24,875 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:50:24,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-27 01:50:24,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d38d9d8/473bbecb2abe4d64a4d4844e625534be/FLAG789650421 [2019-12-27 01:50:25,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:50:25,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-27 01:50:25,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d38d9d8/473bbecb2abe4d64a4d4844e625534be/FLAG789650421 [2019-12-27 01:50:25,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d38d9d8/473bbecb2abe4d64a4d4844e625534be [2019-12-27 01:50:25,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:50:25,787 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:50:25,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:25,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:50:25,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:50:25,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:25" (1/1) ... [2019-12-27 01:50:25,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:25, skipping insertion in model container [2019-12-27 01:50:25,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:25" (1/1) ... [2019-12-27 01:50:25,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:50:25,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:50:26,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:26,566 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:50:26,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:26,715 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:50:26,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26 WrapperNode [2019-12-27 01:50:26,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:26,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:26,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:50:26,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:50:26,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:26,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:50:26,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:50:26,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:50:26,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... [2019-12-27 01:50:26,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:50:26,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:50:26,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:50:26,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:50:26,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:50:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:50:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:50:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:50:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:50:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:50:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:50:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:50:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:50:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:50:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:50:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:50:26,923 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:50:27,816 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:50:27,816 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:50:27,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:27 BoogieIcfgContainer [2019-12-27 01:50:27,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:50:27,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:50:27,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:50:27,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:50:27,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:50:25" (1/3) ... [2019-12-27 01:50:27,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bad03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:27, skipping insertion in model container [2019-12-27 01:50:27,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:26" (2/3) ... [2019-12-27 01:50:27,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bad03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:27, skipping insertion in model container [2019-12-27 01:50:27,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:27" (3/3) ... [2019-12-27 01:50:27,828 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc.i [2019-12-27 01:50:27,839 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:50:27,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:50:27,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:50:27,849 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:50:27,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:27,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:28,029 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:50:28,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:50:28,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:50:28,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:50:28,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:50:28,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:50:28,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:50:28,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:50:28,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:50:28,072 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-27 01:50:28,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 01:50:28,193 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 01:50:28,193 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:28,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 01:50:28,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 01:50:28,317 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 01:50:28,317 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:28,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 01:50:28,357 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-27 01:50:28,359 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:50:34,053 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 01:50:34,166 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 01:50:34,221 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-12-27 01:50:34,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 01:50:34,225 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-27 01:50:35,881 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-27 01:50:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-27 01:50:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 01:50:35,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:35,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 01:50:35,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-12-27 01:50:35,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:35,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107388765] [2019-12-27 01:50:35,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:36,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107388765] [2019-12-27 01:50:36,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:36,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:50:36,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291282234] [2019-12-27 01:50:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:36,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:36,196 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-27 01:50:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:36,900 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-27 01:50:36,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:36,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 01:50:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:37,120 INFO L225 Difference]: With dead ends: 27436 [2019-12-27 01:50:37,120 INFO L226 Difference]: Without dead ends: 26890 [2019-12-27 01:50:37,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-27 01:50:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-27 01:50:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-27 01:50:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-27 01:50:39,494 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-27 01:50:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:39,495 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-27 01:50:39,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-27 01:50:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:50:39,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:39,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:39,499 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-12-27 01:50:39,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:39,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57081056] [2019-12-27 01:50:39,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:39,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57081056] [2019-12-27 01:50:39,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:39,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:39,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653496629] [2019-12-27 01:50:39,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:39,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:39,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:39,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:39,597 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-27 01:50:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:40,283 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-27 01:50:40,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:50:40,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:50:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:40,486 INFO L225 Difference]: With dead ends: 43282 [2019-12-27 01:50:40,486 INFO L226 Difference]: Without dead ends: 43275 [2019-12-27 01:50:40,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-27 01:50:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-27 01:50:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-27 01:50:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-27 01:50:43,468 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-27 01:50:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:43,468 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-27 01:50:43,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-27 01:50:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:50:43,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:43,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:43,478 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-12-27 01:50:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414066136] [2019-12-27 01:50:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:43,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414066136] [2019-12-27 01:50:43,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:43,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:43,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44763342] [2019-12-27 01:50:43,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:43,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:43,621 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-27 01:50:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:44,376 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-27 01:50:44,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:50:44,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:50:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:44,519 INFO L225 Difference]: With dead ends: 53078 [2019-12-27 01:50:44,519 INFO L226 Difference]: Without dead ends: 53078 [2019-12-27 01:50:44,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-27 01:50:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-27 01:50:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-27 01:50:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-27 01:50:46,652 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-27 01:50:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:46,652 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-27 01:50:46,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-27 01:50:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 01:50:46,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:46,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:46,658 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-12-27 01:50:46,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:46,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807705863] [2019-12-27 01:50:46,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:46,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807705863] [2019-12-27 01:50:46,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:46,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:50:46,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202344367] [2019-12-27 01:50:46,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:46,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:46,758 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-27 01:50:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:49,366 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-27 01:50:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:50:49,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 01:50:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:49,487 INFO L225 Difference]: With dead ends: 63010 [2019-12-27 01:50:49,487 INFO L226 Difference]: Without dead ends: 63003 [2019-12-27 01:50:49,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:50:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-27 01:50:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-27 01:50:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-27 01:50:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-27 01:50:50,777 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-27 01:50:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:50,777 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-27 01:50:50,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-27 01:50:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:50:50,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:50,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:50,803 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-12-27 01:50:50,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090943553] [2019-12-27 01:50:50,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:50,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090943553] [2019-12-27 01:50:50,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:50,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:50:50,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169010518] [2019-12-27 01:50:50,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:50,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:50,875 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-27 01:50:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:50,920 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-27 01:50:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:50:50,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:50:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:50,927 INFO L225 Difference]: With dead ends: 5620 [2019-12-27 01:50:50,928 INFO L226 Difference]: Without dead ends: 4725 [2019-12-27 01:50:50,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-27 01:50:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-27 01:50:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-27 01:50:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-27 01:50:51,002 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-27 01:50:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:51,002 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-27 01:50:51,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-27 01:50:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 01:50:51,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:51,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:51,008 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-12-27 01:50:51,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:51,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602488859] [2019-12-27 01:50:51,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602488859] [2019-12-27 01:50:51,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:51,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:50:51,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275068189] [2019-12-27 01:50:51,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:51,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:51,506 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-27 01:50:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:51,552 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-27 01:50:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:50:51,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 01:50:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:51,554 INFO L225 Difference]: With dead ends: 1095 [2019-12-27 01:50:51,554 INFO L226 Difference]: Without dead ends: 991 [2019-12-27 01:50:51,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-27 01:50:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-27 01:50:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-27 01:50:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-27 01:50:51,564 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-27 01:50:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:51,564 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-27 01:50:51,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-27 01:50:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:50:51,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:51,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:51,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-12-27 01:50:51,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:51,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203195526] [2019-12-27 01:50:51,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:51,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203195526] [2019-12-27 01:50:51,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:51,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:50:51,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617409371] [2019-12-27 01:50:51,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:50:51,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:50:51,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:51,709 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-27 01:50:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:52,290 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-27 01:50:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:50:52,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 01:50:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:52,293 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 01:50:52,293 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 01:50:52,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:50:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 01:50:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-27 01:50:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-27 01:50:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-27 01:50:52,305 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-27 01:50:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:52,306 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-27 01:50:52,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:50:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-27 01:50:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:50:52,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:52,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:52,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-12-27 01:50:52,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:52,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319626732] [2019-12-27 01:50:52,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:52,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319626732] [2019-12-27 01:50:52,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:52,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:52,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71980949] [2019-12-27 01:50:52,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:52,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:52,408 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-27 01:50:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:52,421 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-27 01:50:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:52,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 01:50:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:52,423 INFO L225 Difference]: With dead ends: 963 [2019-12-27 01:50:52,423 INFO L226 Difference]: Without dead ends: 963 [2019-12-27 01:50:52,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-27 01:50:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-27 01:50:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-27 01:50:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-27 01:50:52,435 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-27 01:50:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:52,435 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-27 01:50:52,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-27 01:50:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 01:50:52,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:52,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:52,440 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-12-27 01:50:52,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:52,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118397350] [2019-12-27 01:50:52,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:52,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118397350] [2019-12-27 01:50:52,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:52,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:50:52,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365366501] [2019-12-27 01:50:52,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:52,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:52,554 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-27 01:50:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:52,823 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-27 01:50:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:50:52,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 01:50:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:52,825 INFO L225 Difference]: With dead ends: 1101 [2019-12-27 01:50:52,825 INFO L226 Difference]: Without dead ends: 1101 [2019-12-27 01:50:52,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-27 01:50:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-27 01:50:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-27 01:50:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-27 01:50:52,841 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-27 01:50:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-27 01:50:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-27 01:50:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 01:50:52,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:52,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:52,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-12-27 01:50:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:52,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799024994] [2019-12-27 01:50:52,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:53,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799024994] [2019-12-27 01:50:53,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:53,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:50:53,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906243055] [2019-12-27 01:50:53,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:50:53,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:53,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:50:53,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:50:53,056 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 10 states. [2019-12-27 01:50:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:53,804 INFO L93 Difference]: Finished difference Result 1756 states and 3543 transitions. [2019-12-27 01:50:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:50:53,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-27 01:50:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:53,807 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 01:50:53,807 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 01:50:53,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:50:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 01:50:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1356. [2019-12-27 01:50:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 01:50:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 2783 transitions. [2019-12-27 01:50:53,823 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 2783 transitions. Word has length 69 [2019-12-27 01:50:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:53,823 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 2783 transitions. [2019-12-27 01:50:53,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:50:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2783 transitions. [2019-12-27 01:50:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:50:53,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:53,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:53,825 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1241316174, now seen corresponding path program 1 times [2019-12-27 01:50:53,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:53,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797497608] [2019-12-27 01:50:53,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:53,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797497608] [2019-12-27 01:50:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:53,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:53,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582004882] [2019-12-27 01:50:53,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:53,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:53,903 INFO L87 Difference]: Start difference. First operand 1356 states and 2783 transitions. Second operand 3 states. [2019-12-27 01:50:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:53,947 INFO L93 Difference]: Finished difference Result 1355 states and 2781 transitions. [2019-12-27 01:50:53,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:53,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 01:50:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:53,949 INFO L225 Difference]: With dead ends: 1355 [2019-12-27 01:50:53,949 INFO L226 Difference]: Without dead ends: 1355 [2019-12-27 01:50:53,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-27 01:50:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1250. [2019-12-27 01:50:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-12-27 01:50:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2585 transitions. [2019-12-27 01:50:53,968 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2585 transitions. Word has length 70 [2019-12-27 01:50:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:53,968 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 2585 transitions. [2019-12-27 01:50:53,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2585 transitions. [2019-12-27 01:50:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:50:53,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:53,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:53,971 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1779301553, now seen corresponding path program 1 times [2019-12-27 01:50:53,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:53,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733000205] [2019-12-27 01:50:53,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:54,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733000205] [2019-12-27 01:50:54,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:54,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:50:54,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921576261] [2019-12-27 01:50:54,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:50:54,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:54,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:50:54,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:54,116 INFO L87 Difference]: Start difference. First operand 1250 states and 2585 transitions. Second operand 6 states. [2019-12-27 01:50:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:54,356 INFO L93 Difference]: Finished difference Result 1374 states and 2847 transitions. [2019-12-27 01:50:54,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:50:54,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 01:50:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:54,358 INFO L225 Difference]: With dead ends: 1374 [2019-12-27 01:50:54,358 INFO L226 Difference]: Without dead ends: 1374 [2019-12-27 01:50:54,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:50:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-12-27 01:50:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1250. [2019-12-27 01:50:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-12-27 01:50:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2569 transitions. [2019-12-27 01:50:54,369 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2569 transitions. Word has length 70 [2019-12-27 01:50:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:54,369 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 2569 transitions. [2019-12-27 01:50:54,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:50:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2569 transitions. [2019-12-27 01:50:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:50:54,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:54,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:54,371 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1388303069, now seen corresponding path program 2 times [2019-12-27 01:50:54,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:54,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520586019] [2019-12-27 01:50:54,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:54,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520586019] [2019-12-27 01:50:54,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:54,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:50:54,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614148796] [2019-12-27 01:50:54,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:50:54,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:50:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:54,527 INFO L87 Difference]: Start difference. First operand 1250 states and 2569 transitions. Second operand 7 states. [2019-12-27 01:50:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:54,875 INFO L93 Difference]: Finished difference Result 1470 states and 3025 transitions. [2019-12-27 01:50:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:50:54,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 01:50:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:54,877 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 01:50:54,877 INFO L226 Difference]: Without dead ends: 1470 [2019-12-27 01:50:54,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:50:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-12-27 01:50:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1190. [2019-12-27 01:50:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-12-27 01:50:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 2437 transitions. [2019-12-27 01:50:54,892 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 2437 transitions. Word has length 70 [2019-12-27 01:50:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:54,892 INFO L462 AbstractCegarLoop]: Abstraction has 1190 states and 2437 transitions. [2019-12-27 01:50:54,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:50:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 2437 transitions. [2019-12-27 01:50:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:50:54,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:54,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:54,895 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 53631247, now seen corresponding path program 3 times [2019-12-27 01:50:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:54,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721447547] [2019-12-27 01:50:54,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:55,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721447547] [2019-12-27 01:50:55,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:55,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:50:55,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622481322] [2019-12-27 01:50:55,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:50:55,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:50:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:55,025 INFO L87 Difference]: Start difference. First operand 1190 states and 2437 transitions. Second operand 7 states. [2019-12-27 01:50:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:55,482 INFO L93 Difference]: Finished difference Result 1394 states and 2852 transitions. [2019-12-27 01:50:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:50:55,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 01:50:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:55,485 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 01:50:55,485 INFO L226 Difference]: Without dead ends: 1394 [2019-12-27 01:50:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:50:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-12-27 01:50:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1138. [2019-12-27 01:50:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-12-27 01:50:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 2328 transitions. [2019-12-27 01:50:55,497 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 2328 transitions. Word has length 70 [2019-12-27 01:50:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:55,497 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 2328 transitions. [2019-12-27 01:50:55,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:50:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 2328 transitions. [2019-12-27 01:50:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 01:50:55,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:55,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:55,500 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-12-27 01:50:55,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:55,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641577193] [2019-12-27 01:50:55,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:55,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641577193] [2019-12-27 01:50:55,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:55,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:50:55,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846416253] [2019-12-27 01:50:55,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:50:55,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:50:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:50:55,691 INFO L87 Difference]: Start difference. First operand 1138 states and 2328 transitions. Second operand 11 states. [2019-12-27 01:50:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:56,603 INFO L93 Difference]: Finished difference Result 2237 states and 4587 transitions. [2019-12-27 01:50:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:50:56,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-12-27 01:50:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:56,604 INFO L225 Difference]: With dead ends: 2237 [2019-12-27 01:50:56,605 INFO L226 Difference]: Without dead ends: 248 [2019-12-27 01:50:56,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:50:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-27 01:50:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-27 01:50:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-27 01:50:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-12-27 01:50:56,609 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 71 [2019-12-27 01:50:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:56,609 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-12-27 01:50:56,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:50:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-12-27 01:50:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 01:50:56,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:56,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:56,611 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-12-27 01:50:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:56,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270952518] [2019-12-27 01:50:56,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:50:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:50:56,722 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:50:56,722 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:50:56,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t597~0.base_29| 4)) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29|)) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29|) |v_ULTIMATE.start_main_~#t597~0.offset_21| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t597~0.base_29|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= |v_ULTIMATE.start_main_~#t597~0.offset_21| 0) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_~#t597~0.base=|v_ULTIMATE.start_main_~#t597~0.base_29|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t597~0.offset=|v_ULTIMATE.start_main_~#t597~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_29|, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t597~0.base, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t597~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t598~0.base, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t598~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 01:50:56,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t598~0.base_13|) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13|) |v_ULTIMATE.start_main_~#t598~0.offset_11| 1))) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t598~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t598~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t598~0.offset, #length, ULTIMATE.start_main_~#t598~0.base] because there is no mapped edge [2019-12-27 01:50:56,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 0 (mod v_~x$w_buff1_used~0_77 256)) (= 2 v_~x$w_buff0~0_34) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 01:50:56,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-235987969 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-235987969 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out-235987969| |P1Thread1of1ForFork1_#t~ite12_Out-235987969|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-235987969| ~x$w_buff1~0_In-235987969) .cse2) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-235987969| ~x$w_buff0~0_In-235987969) (not .cse0) .cse2))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-235987969, ~x$w_buff1~0=~x$w_buff1~0_In-235987969, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-235987969, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-235987969} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-235987969, ~x$w_buff1~0=~x$w_buff1~0_In-235987969, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-235987969|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-235987969|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-235987969, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-235987969} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 01:50:56,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 01:50:56,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In493224176 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In493224176 |P1Thread1of1ForFork1_#t~ite31_Out493224176|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out493224176| ~x~0_In493224176)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In493224176, ~x$mem_tmp~0=~x$mem_tmp~0_In493224176, ~x~0=~x~0_In493224176} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In493224176, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out493224176|, ~x$mem_tmp~0=~x$mem_tmp~0_In493224176, ~x~0=~x~0_In493224176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 01:50:56,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-486329723 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-486329723 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-486329723| |P0Thread1of1ForFork0_#t~ite3_Out-486329723|))) (or (and (not .cse0) (= ~x$w_buff1~0_In-486329723 |P0Thread1of1ForFork0_#t~ite3_Out-486329723|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~x~0_In-486329723 |P0Thread1of1ForFork0_#t~ite3_Out-486329723|) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-486329723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486329723, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-486329723, ~x~0=~x~0_In-486329723} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-486329723|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-486329723|, ~x$w_buff1~0=~x$w_buff1~0_In-486329723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486329723, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-486329723, ~x~0=~x~0_In-486329723} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 01:50:56,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In428433239 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In428433239 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In428433239 |P0Thread1of1ForFork0_#t~ite5_Out428433239|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out428433239|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In428433239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In428433239} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out428433239|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In428433239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In428433239} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:50:56,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1376333393 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1376333393 256)))) (or (and (= ~x$w_buff0_used~0_In-1376333393 |P1Thread1of1ForFork1_#t~ite34_Out-1376333393|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1376333393|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1376333393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376333393} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1376333393|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1376333393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376333393} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:50:56,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1734150770 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1734150770 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1734150770 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1734150770 256)))) (or (and (= ~x$w_buff1_used~0_In1734150770 |P1Thread1of1ForFork1_#t~ite35_Out1734150770|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1734150770|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1734150770, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734150770, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734150770, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734150770} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1734150770, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1734150770, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1734150770|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734150770, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734150770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:50:56,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1883179051 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1883179051 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1883179051 ~x$r_buff0_thd2~0_Out-1883179051)) (and (= 0 ~x$r_buff0_thd2~0_Out-1883179051) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1883179051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1883179051} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1883179051, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1883179051|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1883179051} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:50:56,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1193237196 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1193237196 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1193237196 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1193237196 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1193237196|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In-1193237196 |P1Thread1of1ForFork1_#t~ite37_Out-1193237196|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193237196, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1193237196, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1193237196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193237196} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193237196, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1193237196, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1193237196, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1193237196|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193237196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:50:56,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:50:56,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-127656274 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-127656274 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-127656274 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-127656274 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-127656274|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-127656274 |P0Thread1of1ForFork0_#t~ite6_Out-127656274|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-127656274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127656274, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-127656274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-127656274} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-127656274|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-127656274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127656274, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-127656274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-127656274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:50:56,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-962958627 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-962958627 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-962958627| 0)) (and (= ~x$r_buff0_thd1~0_In-962958627 |P0Thread1of1ForFork0_#t~ite7_Out-962958627|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-962958627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-962958627} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-962958627, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-962958627|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-962958627} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 01:50:56,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-464138189 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-464138189 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-464138189 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-464138189 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-464138189| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-464138189| ~x$r_buff1_thd1~0_In-464138189)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464138189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-464138189, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-464138189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464138189} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464138189, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-464138189|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-464138189, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-464138189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464138189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:50:56,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 01:50:56,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 01:50:56,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1090545807 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1090545807 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1090545807| ~x~0_In-1090545807)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1090545807| ~x$w_buff1~0_In-1090545807)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1090545807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090545807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1090545807, ~x~0=~x~0_In-1090545807} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1090545807|, ~x$w_buff1~0=~x$w_buff1~0_In-1090545807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090545807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1090545807, ~x~0=~x~0_In-1090545807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:50:56,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 01:50:56,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1944382282 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1944382282 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1944382282|)) (and (= ~x$w_buff0_used~0_In1944382282 |ULTIMATE.start_main_#t~ite42_Out1944382282|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1944382282, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944382282} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1944382282, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1944382282|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944382282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:50:56,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In552532716 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In552532716 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In552532716 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In552532716 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out552532716|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In552532716 |ULTIMATE.start_main_#t~ite43_Out552532716|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In552532716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In552532716, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In552532716, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552532716} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In552532716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In552532716, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out552532716|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In552532716, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552532716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:50:56,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1033298596 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1033298596 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1033298596|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1033298596 |ULTIMATE.start_main_#t~ite44_Out-1033298596|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033298596, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033298596} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033298596, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1033298596|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033298596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:50:56,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-949381079 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-949381079 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-949381079 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-949381079 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-949381079| ~x$r_buff1_thd0~0_In-949381079) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-949381079|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-949381079, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-949381079, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-949381079, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-949381079} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-949381079, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-949381079, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-949381079, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-949381079|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-949381079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:50:56,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2126501183 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out2126501183| ~x$mem_tmp~0_In2126501183) (not .cse0)) (and (= ~x~0_In2126501183 |ULTIMATE.start_main_#t~ite68_Out2126501183|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2126501183, ~x$mem_tmp~0=~x$mem_tmp~0_In2126501183, ~x~0=~x~0_In2126501183} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In2126501183, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out2126501183|, ~x$mem_tmp~0=~x$mem_tmp~0_In2126501183, ~x~0=~x~0_In2126501183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 01:50:56,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:50:56,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:50:56 BasicIcfg [2019-12-27 01:50:56,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:50:56,865 INFO L168 Benchmark]: Toolchain (without parser) took 31078.32 ms. Allocated memory was 144.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 100.3 MB in the beginning and 677.3 MB in the end (delta: -577.0 MB). Peak memory consumption was 709.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,865 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.68 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.62 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 151.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,867 INFO L168 Benchmark]: Boogie Preprocessor took 44.82 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,868 INFO L168 Benchmark]: RCFGBuilder took 981.02 ms. Allocated memory is still 203.9 MB. Free memory was 148.9 MB in the beginning and 92.7 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,869 INFO L168 Benchmark]: TraceAbstraction took 29043.23 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 92.7 MB in the beginning and 677.3 MB in the end (delta: -584.6 MB). Peak memory consumption was 642.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:56,873 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.71 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 927.68 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.62 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 151.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.82 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 981.02 ms. Allocated memory is still 203.9 MB. Free memory was 148.9 MB in the beginning and 92.7 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29043.23 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 92.7 MB in the beginning and 677.3 MB in the end (delta: -584.6 MB). Peak memory consumption was 642.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3088 SDtfs, 3295 SDslu, 6238 SDs, 0 SdLazy, 3783 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 23 SyntacticMatches, 24 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 23740 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 114794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...