/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:17:16,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:17:16,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:17:16,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:17:16,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:17:16,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:17:16,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:17:16,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:17:16,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:17:16,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:17:16,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:17:16,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:17:16,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:17:16,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:17:16,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:17:16,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:17:16,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:17:16,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:17:16,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:17:16,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:17:16,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:17:16,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:17:16,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:17:16,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:17:16,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:17:16,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:17:16,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:17:16,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:17:16,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:17:16,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:17:16,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:17:16,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:17:16,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:17:16,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:17:16,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:17:16,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:17:16,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:17:16,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:17:16,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:17:16,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:17:16,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:17:16,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:17:16,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:17:16,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:17:16,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:17:16,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:17:16,645 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:17:16,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:17:16,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:17:16,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:17:16,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:17:16,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:17:16,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:17:16,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:17:16,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:17:16,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:17:16,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:17:16,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:17:16,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:17:16,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:17:16,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:17:16,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:17:16,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:17:16,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:17:16,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:17:16,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:17:16,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:17:16,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:17:16,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:17:16,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:17:16,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:17:16,971 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:17:16,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-26 22:17:17,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610a9f50/be721353bb6d42d9bdf1551c62324626/FLAG3dc204235 [2019-12-26 22:17:17,628 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:17:17,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-26 22:17:17,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610a9f50/be721353bb6d42d9bdf1551c62324626/FLAG3dc204235 [2019-12-26 22:17:17,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610a9f50/be721353bb6d42d9bdf1551c62324626 [2019-12-26 22:17:17,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:17:17,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:17:17,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:17:17,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:17:17,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:17:17,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:17:17" (1/1) ... [2019-12-26 22:17:17,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:17, skipping insertion in model container [2019-12-26 22:17:17,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:17:17" (1/1) ... [2019-12-26 22:17:17,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:17:17,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:17:18,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:17:18,450 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:17:18,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:17:18,652 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:17:18,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18 WrapperNode [2019-12-26 22:17:18,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:17:18,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:17:18,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:17:18,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:17:18,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:17:18,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:17:18,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:17:18,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:17:18,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... [2019-12-26 22:17:18,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:17:18,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:17:18,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:17:18,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:17:18,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:17:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:17:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:17:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:17:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:17:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:17:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:17:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:17:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:17:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:17:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:17:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:17:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:17:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:17:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:17:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:17:18,865 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:17:19,723 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:17:19,724 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:17:19,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:17:19 BoogieIcfgContainer [2019-12-26 22:17:19,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:17:19,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:17:19,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:17:19,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:17:19,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:17:17" (1/3) ... [2019-12-26 22:17:19,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28313c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:17:19, skipping insertion in model container [2019-12-26 22:17:19,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:17:18" (2/3) ... [2019-12-26 22:17:19,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28313c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:17:19, skipping insertion in model container [2019-12-26 22:17:19,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:17:19" (3/3) ... [2019-12-26 22:17:19,733 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2019-12-26 22:17:19,743 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:17:19,743 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:17:19,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:17:19,751 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:17:19,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,802 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,817 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,823 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,823 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,827 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,827 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,827 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,828 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,828 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,873 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:17:19,892 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:17:19,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:17:19,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:17:19,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:17:19,917 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:17:19,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:17:19,917 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:17:19,917 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:17:19,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:17:19,941 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-26 22:17:19,948 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-26 22:17:20,095 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-26 22:17:20,096 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:17:20,117 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-26 22:17:20,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-26 22:17:20,229 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-26 22:17:20,229 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:17:20,244 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-26 22:17:20,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-26 22:17:20,284 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:17:27,105 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 22:17:27,254 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 22:17:27,404 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-26 22:17:27,405 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-26 22:17:27,409 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-26 22:17:39,628 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-26 22:17:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-26 22:17:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:17:39,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:17:39,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:17:39,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:17:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:17:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-26 22:17:39,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:17:39,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635581243] [2019-12-26 22:17:39,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:17:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:17:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:17:40,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635581243] [2019-12-26 22:17:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:17:40,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:17:40,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473784214] [2019-12-26 22:17:40,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:17:40,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:17:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:17:40,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:17:40,030 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-26 22:17:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:17:43,474 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-26 22:17:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:17:43,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:17:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:17:44,225 INFO L225 Difference]: With dead ends: 105018 [2019-12-26 22:17:44,225 INFO L226 Difference]: Without dead ends: 102886 [2019-12-26 22:17:44,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:17:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-26 22:17:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-26 22:17:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-26 22:17:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-26 22:17:52,048 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-26 22:17:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:17:52,049 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-26 22:17:52,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:17:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-26 22:17:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:17:52,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:17:52,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:17:52,057 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:17:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:17:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-26 22:17:52,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:17:52,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679632877] [2019-12-26 22:17:52,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:17:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:17:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:17:52,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679632877] [2019-12-26 22:17:52,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:17:52,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:17:52,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094753310] [2019-12-26 22:17:52,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:17:52,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:17:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:17:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:17:52,186 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-26 22:17:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:17:57,002 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-26 22:17:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:17:57,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:17:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:17:58,402 INFO L225 Difference]: With dead ends: 165574 [2019-12-26 22:17:58,403 INFO L226 Difference]: Without dead ends: 165546 [2019-12-26 22:17:58,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-26 22:18:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-26 22:18:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-26 22:18:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-26 22:18:05,492 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-26 22:18:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:05,493 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-26 22:18:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-26 22:18:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:18:05,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:05,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:05,496 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-26 22:18:05,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:05,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907792887] [2019-12-26 22:18:05,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:05,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-26 22:18:05,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907792887] [2019-12-26 22:18:05,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:05,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:05,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993203073] [2019-12-26 22:18:05,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:05,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:05,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:05,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:05,555 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-26 22:18:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:11,429 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-26 22:18:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:11,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:18:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:11,758 INFO L225 Difference]: With dead ends: 124009 [2019-12-26 22:18:11,758 INFO L226 Difference]: Without dead ends: 124009 [2019-12-26 22:18:11,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-26 22:18:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-26 22:18:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-26 22:18:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-26 22:18:16,564 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-26 22:18:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:16,564 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-26 22:18:16,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-26 22:18:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:18:16,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:16,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:16,568 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-26 22:18:16,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:16,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240883100] [2019-12-26 22:18:16,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:16,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240883100] [2019-12-26 22:18:16,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:16,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:16,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610396634] [2019-12-26 22:18:16,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:16,647 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-26 22:18:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:16,862 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-26 22:18:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:18:16,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:18:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:16,951 INFO L225 Difference]: With dead ends: 48600 [2019-12-26 22:18:16,951 INFO L226 Difference]: Without dead ends: 48600 [2019-12-26 22:18:16,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-26 22:18:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-26 22:18:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-26 22:18:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-26 22:18:22,060 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-26 22:18:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:22,060 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-26 22:18:22,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-26 22:18:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:18:22,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:22,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:22,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-26 22:18:22,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:22,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351260343] [2019-12-26 22:18:22,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:22,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351260343] [2019-12-26 22:18:22,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:22,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:18:22,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862297578] [2019-12-26 22:18:22,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:22,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:22,108 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 5 states. [2019-12-26 22:18:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:22,166 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-26 22:18:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:18:22,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:18:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:22,177 INFO L225 Difference]: With dead ends: 6591 [2019-12-26 22:18:22,177 INFO L226 Difference]: Without dead ends: 6591 [2019-12-26 22:18:22,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-26 22:18:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-26 22:18:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-26 22:18:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-26 22:18:22,312 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-26 22:18:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:22,312 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-26 22:18:22,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-26 22:18:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:18:22,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:22,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:22,320 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-26 22:18:22,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:22,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078231247] [2019-12-26 22:18:22,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:22,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078231247] [2019-12-26 22:18:22,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:22,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:18:22,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305180143] [2019-12-26 22:18:22,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:18:22,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:18:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:22,395 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-26 22:18:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:22,458 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-26 22:18:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:18:22,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:18:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:22,466 INFO L225 Difference]: With dead ends: 3660 [2019-12-26 22:18:22,466 INFO L226 Difference]: Without dead ends: 3660 [2019-12-26 22:18:22,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-26 22:18:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-26 22:18:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-26 22:18:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-26 22:18:22,533 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-26 22:18:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:22,533 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-26 22:18:22,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:18:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-26 22:18:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:22,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:22,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:22,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-26 22:18:22,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:22,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288586868] [2019-12-26 22:18:22,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:22,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288586868] [2019-12-26 22:18:22,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:22,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:18:22,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810645534] [2019-12-26 22:18:22,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:18:22,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:18:22,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:22,695 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 6 states. [2019-12-26 22:18:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:23,256 INFO L93 Difference]: Finished difference Result 5233 states and 16394 transitions. [2019-12-26 22:18:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:18:23,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-26 22:18:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:23,266 INFO L225 Difference]: With dead ends: 5233 [2019-12-26 22:18:23,266 INFO L226 Difference]: Without dead ends: 5233 [2019-12-26 22:18:23,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-26 22:18:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-26 22:18:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 3820. [2019-12-26 22:18:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-26 22:18:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 12120 transitions. [2019-12-26 22:18:23,361 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 12120 transitions. Word has length 74 [2019-12-26 22:18:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:23,362 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 12120 transitions. [2019-12-26 22:18:23,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:18:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 12120 transitions. [2019-12-26 22:18:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:23,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:23,373 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, 1, 1, 1] [2019-12-26 22:18:23,373 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-26 22:18:23,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:23,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301806823] [2019-12-26 22:18:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:23,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301806823] [2019-12-26 22:18:23,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:23,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:18:23,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673385244] [2019-12-26 22:18:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:23,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:23,501 INFO L87 Difference]: Start difference. First operand 3820 states and 12120 transitions. Second operand 5 states. [2019-12-26 22:18:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:23,740 INFO L93 Difference]: Finished difference Result 4381 states and 13710 transitions. [2019-12-26 22:18:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:18:23,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-26 22:18:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:23,750 INFO L225 Difference]: With dead ends: 4381 [2019-12-26 22:18:23,750 INFO L226 Difference]: Without dead ends: 4381 [2019-12-26 22:18:23,751 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-26 22:18:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2019-12-26 22:18:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4060. [2019-12-26 22:18:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-26 22:18:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 12832 transitions. [2019-12-26 22:18:23,803 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 12832 transitions. Word has length 74 [2019-12-26 22:18:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 12832 transitions. [2019-12-26 22:18:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 12832 transitions. [2019-12-26 22:18:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:23,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:23,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:23,818 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-26 22:18:23,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556831516] [2019-12-26 22:18:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:23,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556831516] [2019-12-26 22:18:23,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:23,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:18:23,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563774891] [2019-12-26 22:18:23,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:18:23,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:18:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:18:23,965 INFO L87 Difference]: Start difference. First operand 4060 states and 12832 transitions. Second operand 4 states. [2019-12-26 22:18:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:24,014 INFO L93 Difference]: Finished difference Result 5999 states and 17978 transitions. [2019-12-26 22:18:24,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:18:24,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-26 22:18:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:24,019 INFO L225 Difference]: With dead ends: 5999 [2019-12-26 22:18:24,019 INFO L226 Difference]: Without dead ends: 2166 [2019-12-26 22:18:24,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-12-26 22:18:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2019-12-26 22:18:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-12-26 22:18:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 5745 transitions. [2019-12-26 22:18:24,046 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 5745 transitions. Word has length 74 [2019-12-26 22:18:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:24,046 INFO L462 AbstractCegarLoop]: Abstraction has 2166 states and 5745 transitions. [2019-12-26 22:18:24,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:18:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 5745 transitions. [2019-12-26 22:18:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:24,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:24,051 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, 1, 1, 1] [2019-12-26 22:18:24,052 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash 880340194, now seen corresponding path program 4 times [2019-12-26 22:18:24,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:24,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074970793] [2019-12-26 22:18:24,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:24,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074970793] [2019-12-26 22:18:24,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:24,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:18:24,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880713765] [2019-12-26 22:18:24,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:18:24,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:18:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:24,177 INFO L87 Difference]: Start difference. First operand 2166 states and 5745 transitions. Second operand 6 states. [2019-12-26 22:18:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:25,272 INFO L93 Difference]: Finished difference Result 2722 states and 7100 transitions. [2019-12-26 22:18:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:18:25,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-26 22:18:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:25,279 INFO L225 Difference]: With dead ends: 2722 [2019-12-26 22:18:25,279 INFO L226 Difference]: Without dead ends: 2722 [2019-12-26 22:18:25,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:18:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2019-12-26 22:18:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2348. [2019-12-26 22:18:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-12-26 22:18:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 6216 transitions. [2019-12-26 22:18:25,321 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 6216 transitions. Word has length 74 [2019-12-26 22:18:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:25,322 INFO L462 AbstractCegarLoop]: Abstraction has 2348 states and 6216 transitions. [2019-12-26 22:18:25,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:18:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 6216 transitions. [2019-12-26 22:18:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:25,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:25,328 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, 1, 1, 1] [2019-12-26 22:18:25,328 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1386364252, now seen corresponding path program 5 times [2019-12-26 22:18:25,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:25,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096490907] [2019-12-26 22:18:25,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:25,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096490907] [2019-12-26 22:18:25,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:25,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:18:25,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046637974] [2019-12-26 22:18:25,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:18:25,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:18:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:25,509 INFO L87 Difference]: Start difference. First operand 2348 states and 6216 transitions. Second operand 7 states. [2019-12-26 22:18:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:26,220 INFO L93 Difference]: Finished difference Result 4432 states and 11559 transitions. [2019-12-26 22:18:26,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:18:26,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-26 22:18:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:26,228 INFO L225 Difference]: With dead ends: 4432 [2019-12-26 22:18:26,228 INFO L226 Difference]: Without dead ends: 4432 [2019-12-26 22:18:26,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:18:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2019-12-26 22:18:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 2432. [2019-12-26 22:18:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2019-12-26 22:18:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 6462 transitions. [2019-12-26 22:18:26,267 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 6462 transitions. Word has length 74 [2019-12-26 22:18:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:26,267 INFO L462 AbstractCegarLoop]: Abstraction has 2432 states and 6462 transitions. [2019-12-26 22:18:26,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:18:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 6462 transitions. [2019-12-26 22:18:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:26,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:26,271 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, 1, 1, 1] [2019-12-26 22:18:26,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash -187135442, now seen corresponding path program 6 times [2019-12-26 22:18:26,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:26,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725084570] [2019-12-26 22:18:26,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:26,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725084570] [2019-12-26 22:18:26,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:26,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:18:26,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043321662] [2019-12-26 22:18:26,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:18:26,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:18:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:18:26,397 INFO L87 Difference]: Start difference. First operand 2432 states and 6462 transitions. Second operand 7 states. [2019-12-26 22:18:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:27,056 INFO L93 Difference]: Finished difference Result 4284 states and 11203 transitions. [2019-12-26 22:18:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:18:27,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-26 22:18:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:27,063 INFO L225 Difference]: With dead ends: 4284 [2019-12-26 22:18:27,063 INFO L226 Difference]: Without dead ends: 4284 [2019-12-26 22:18:27,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:18:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2019-12-26 22:18:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 2420. [2019-12-26 22:18:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-12-26 22:18:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 6432 transitions. [2019-12-26 22:18:27,101 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 6432 transitions. Word has length 74 [2019-12-26 22:18:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:27,101 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 6432 transitions. [2019-12-26 22:18:27,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:18:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 6432 transitions. [2019-12-26 22:18:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:18:27,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:27,105 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, 1, 1, 1] [2019-12-26 22:18:27,105 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash -375596894, now seen corresponding path program 7 times [2019-12-26 22:18:27,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:27,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238196070] [2019-12-26 22:18:27,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:27,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238196070] [2019-12-26 22:18:27,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:27,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:18:27,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866246092] [2019-12-26 22:18:27,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:18:27,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:18:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:27,203 INFO L87 Difference]: Start difference. First operand 2420 states and 6432 transitions. Second operand 6 states. [2019-12-26 22:18:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:27,680 INFO L93 Difference]: Finished difference Result 3340 states and 8685 transitions. [2019-12-26 22:18:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:18:27,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-26 22:18:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:27,686 INFO L225 Difference]: With dead ends: 3340 [2019-12-26 22:18:27,686 INFO L226 Difference]: Without dead ends: 3340 [2019-12-26 22:18:27,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:18:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2019-12-26 22:18:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2432. [2019-12-26 22:18:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2019-12-26 22:18:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 6460 transitions. [2019-12-26 22:18:27,716 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 6460 transitions. Word has length 74 [2019-12-26 22:18:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:27,716 INFO L462 AbstractCegarLoop]: Abstraction has 2432 states and 6460 transitions. [2019-12-26 22:18:27,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:18:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 6460 transitions. [2019-12-26 22:18:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-26 22:18:27,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:27,720 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, 1, 1, 1, 1] [2019-12-26 22:18:27,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -529269389, now seen corresponding path program 1 times [2019-12-26 22:18:27,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:27,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989006008] [2019-12-26 22:18:27,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:27,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989006008] [2019-12-26 22:18:27,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:27,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:18:27,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184823231] [2019-12-26 22:18:27,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:18:27,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:18:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:18:27,951 INFO L87 Difference]: Start difference. First operand 2432 states and 6460 transitions. Second operand 10 states. [2019-12-26 22:18:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:29,308 INFO L93 Difference]: Finished difference Result 5365 states and 13821 transitions. [2019-12-26 22:18:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:18:29,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-12-26 22:18:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:29,316 INFO L225 Difference]: With dead ends: 5365 [2019-12-26 22:18:29,317 INFO L226 Difference]: Without dead ends: 5365 [2019-12-26 22:18:29,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:18:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-12-26 22:18:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 3360. [2019-12-26 22:18:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3360 states. [2019-12-26 22:18:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 8910 transitions. [2019-12-26 22:18:29,369 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 8910 transitions. Word has length 75 [2019-12-26 22:18:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:29,369 INFO L462 AbstractCegarLoop]: Abstraction has 3360 states and 8910 transitions. [2019-12-26 22:18:29,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:18:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 8910 transitions. [2019-12-26 22:18:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-26 22:18:29,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:29,373 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, 1, 1, 1, 1] [2019-12-26 22:18:29,374 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:29,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash -224866385, now seen corresponding path program 1 times [2019-12-26 22:18:29,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:29,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640398465] [2019-12-26 22:18:29,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:29,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640398465] [2019-12-26 22:18:29,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:29,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:29,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296220242] [2019-12-26 22:18:29,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:29,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:29,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:29,448 INFO L87 Difference]: Start difference. First operand 3360 states and 8910 transitions. Second operand 3 states. [2019-12-26 22:18:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:29,492 INFO L93 Difference]: Finished difference Result 3359 states and 8908 transitions. [2019-12-26 22:18:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:29,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-26 22:18:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:29,497 INFO L225 Difference]: With dead ends: 3359 [2019-12-26 22:18:29,497 INFO L226 Difference]: Without dead ends: 3359 [2019-12-26 22:18:29,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2019-12-26 22:18:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2688. [2019-12-26 22:18:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2019-12-26 22:18:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 7201 transitions. [2019-12-26 22:18:29,538 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 7201 transitions. Word has length 75 [2019-12-26 22:18:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:29,538 INFO L462 AbstractCegarLoop]: Abstraction has 2688 states and 7201 transitions. [2019-12-26 22:18:29,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 7201 transitions. [2019-12-26 22:18:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-26 22:18:29,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:29,542 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, 1, 1, 1, 1, 1] [2019-12-26 22:18:29,542 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash -62455944, now seen corresponding path program 1 times [2019-12-26 22:18:29,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:29,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727981359] [2019-12-26 22:18:29,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:29,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727981359] [2019-12-26 22:18:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:29,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:18:29,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608187387] [2019-12-26 22:18:29,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:18:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:18:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:18:29,702 INFO L87 Difference]: Start difference. First operand 2688 states and 7201 transitions. Second operand 10 states. [2019-12-26 22:18:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:30,319 INFO L93 Difference]: Finished difference Result 6519 states and 16869 transitions. [2019-12-26 22:18:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:18:30,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-12-26 22:18:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:30,324 INFO L225 Difference]: With dead ends: 6519 [2019-12-26 22:18:30,324 INFO L226 Difference]: Without dead ends: 4718 [2019-12-26 22:18:30,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:18:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2019-12-26 22:18:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 2952. [2019-12-26 22:18:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-26 22:18:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7915 transitions. [2019-12-26 22:18:30,364 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7915 transitions. Word has length 76 [2019-12-26 22:18:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:30,365 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7915 transitions. [2019-12-26 22:18:30,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:18:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7915 transitions. [2019-12-26 22:18:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-26 22:18:30,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:30,369 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, 1, 1, 1, 1, 1] [2019-12-26 22:18:30,369 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1892265144, now seen corresponding path program 2 times [2019-12-26 22:18:30,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:30,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848844663] [2019-12-26 22:18:30,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:30,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848844663] [2019-12-26 22:18:30,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:30,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:18:30,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174434634] [2019-12-26 22:18:30,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:18:30,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:18:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:18:30,505 INFO L87 Difference]: Start difference. First operand 2952 states and 7915 transitions. Second operand 8 states. [2019-12-26 22:18:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:30,878 INFO L93 Difference]: Finished difference Result 5010 states and 13232 transitions. [2019-12-26 22:18:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:18:30,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-12-26 22:18:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:30,887 INFO L225 Difference]: With dead ends: 5010 [2019-12-26 22:18:30,887 INFO L226 Difference]: Without dead ends: 3619 [2019-12-26 22:18:30,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:18:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2019-12-26 22:18:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 2968. [2019-12-26 22:18:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-26 22:18:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 7963 transitions. [2019-12-26 22:18:30,959 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 7963 transitions. Word has length 76 [2019-12-26 22:18:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:30,959 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 7963 transitions. [2019-12-26 22:18:30,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:18:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 7963 transitions. [2019-12-26 22:18:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-26 22:18:30,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:30,966 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, 1, 1, 1, 1, 1] [2019-12-26 22:18:30,966 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1820910213, now seen corresponding path program 1 times [2019-12-26 22:18:30,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:30,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275845256] [2019-12-26 22:18:30,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:31,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275845256] [2019-12-26 22:18:31,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:31,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:18:31,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636326290] [2019-12-26 22:18:31,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:18:31,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:18:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:31,068 INFO L87 Difference]: Start difference. First operand 2968 states and 7963 transitions. Second operand 3 states. [2019-12-26 22:18:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:31,095 INFO L93 Difference]: Finished difference Result 2712 states and 7095 transitions. [2019-12-26 22:18:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:18:31,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-26 22:18:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:31,100 INFO L225 Difference]: With dead ends: 2712 [2019-12-26 22:18:31,101 INFO L226 Difference]: Without dead ends: 2712 [2019-12-26 22:18:31,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:18:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2019-12-26 22:18:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2658. [2019-12-26 22:18:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-12-26 22:18:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 6966 transitions. [2019-12-26 22:18:31,163 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 6966 transitions. Word has length 76 [2019-12-26 22:18:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:31,163 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 6966 transitions. [2019-12-26 22:18:31,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:18:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 6966 transitions. [2019-12-26 22:18:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-26 22:18:31,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:31,171 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, 1, 1, 1, 1, 1] [2019-12-26 22:18:31,171 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 571599224, now seen corresponding path program 3 times [2019-12-26 22:18:31,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:31,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282648482] [2019-12-26 22:18:31,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:31,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282648482] [2019-12-26 22:18:31,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:31,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:18:31,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685272884] [2019-12-26 22:18:31,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:18:31,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:31,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:18:31,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:31,391 INFO L87 Difference]: Start difference. First operand 2658 states and 6966 transitions. Second operand 6 states. [2019-12-26 22:18:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:31,552 INFO L93 Difference]: Finished difference Result 4101 states and 10062 transitions. [2019-12-26 22:18:31,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:18:31,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-26 22:18:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:31,556 INFO L225 Difference]: With dead ends: 4101 [2019-12-26 22:18:31,556 INFO L226 Difference]: Without dead ends: 1741 [2019-12-26 22:18:31,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:18:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2019-12-26 22:18:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1523. [2019-12-26 22:18:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-26 22:18:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3360 transitions. [2019-12-26 22:18:31,579 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3360 transitions. Word has length 76 [2019-12-26 22:18:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:31,579 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3360 transitions. [2019-12-26 22:18:31,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:18:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3360 transitions. [2019-12-26 22:18:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-26 22:18:31,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:31,583 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, 1, 1, 1, 1, 1] [2019-12-26 22:18:31,583 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 535333404, now seen corresponding path program 4 times [2019-12-26 22:18:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:31,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382632211] [2019-12-26 22:18:31,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:31,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382632211] [2019-12-26 22:18:31,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:31,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:18:31,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052467655] [2019-12-26 22:18:31,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:18:31,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:18:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:18:31,750 INFO L87 Difference]: Start difference. First operand 1523 states and 3360 transitions. Second operand 10 states. [2019-12-26 22:18:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:32,400 INFO L93 Difference]: Finished difference Result 2947 states and 6514 transitions. [2019-12-26 22:18:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:18:32,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-12-26 22:18:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:32,404 INFO L225 Difference]: With dead ends: 2947 [2019-12-26 22:18:32,404 INFO L226 Difference]: Without dead ends: 2116 [2019-12-26 22:18:32,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:18:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-26 22:18:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1465. [2019-12-26 22:18:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-12-26 22:18:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 3212 transitions. [2019-12-26 22:18:32,420 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 3212 transitions. Word has length 76 [2019-12-26 22:18:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:32,420 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 3212 transitions. [2019-12-26 22:18:32,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:18:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 3212 transitions. [2019-12-26 22:18:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-26 22:18:32,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:32,422 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, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:32,422 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1640706464, now seen corresponding path program 1 times [2019-12-26 22:18:32,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:32,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23903894] [2019-12-26 22:18:32,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:32,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23903894] [2019-12-26 22:18:32,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:32,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:18:32,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471260872] [2019-12-26 22:18:32,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:18:32,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:18:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:18:32,548 INFO L87 Difference]: Start difference. First operand 1465 states and 3212 transitions. Second operand 5 states. [2019-12-26 22:18:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:32,630 INFO L93 Difference]: Finished difference Result 1759 states and 3806 transitions. [2019-12-26 22:18:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:18:32,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-26 22:18:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:32,631 INFO L225 Difference]: With dead ends: 1759 [2019-12-26 22:18:32,631 INFO L226 Difference]: Without dead ends: 280 [2019-12-26 22:18:32,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:18:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-26 22:18:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2019-12-26 22:18:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-26 22:18:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 422 transitions. [2019-12-26 22:18:32,636 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 422 transitions. Word has length 77 [2019-12-26 22:18:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:32,637 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 422 transitions. [2019-12-26 22:18:32,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:18:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 422 transitions. [2019-12-26 22:18:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-26 22:18:32,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:32,638 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, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:32,638 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 2 times [2019-12-26 22:18:32,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:32,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396643159] [2019-12-26 22:18:32,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:33,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396643159] [2019-12-26 22:18:33,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:33,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 22:18:33,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803969039] [2019-12-26 22:18:33,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 22:18:33,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 22:18:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:18:33,216 INFO L87 Difference]: Start difference. First operand 248 states and 422 transitions. Second operand 20 states. [2019-12-26 22:18:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:35,114 INFO L93 Difference]: Finished difference Result 640 states and 1125 transitions. [2019-12-26 22:18:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 22:18:35,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-12-26 22:18:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:35,116 INFO L225 Difference]: With dead ends: 640 [2019-12-26 22:18:35,116 INFO L226 Difference]: Without dead ends: 609 [2019-12-26 22:18:35,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 22:18:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-26 22:18:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 373. [2019-12-26 22:18:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-12-26 22:18:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 639 transitions. [2019-12-26 22:18:35,125 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 639 transitions. Word has length 77 [2019-12-26 22:18:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:35,126 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 639 transitions. [2019-12-26 22:18:35,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 22:18:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 639 transitions. [2019-12-26 22:18:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-26 22:18:35,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:35,127 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, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:35,128 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash 90839542, now seen corresponding path program 3 times [2019-12-26 22:18:35,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:35,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117263599] [2019-12-26 22:18:35,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:35,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117263599] [2019-12-26 22:18:35,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:35,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:18:35,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475256884] [2019-12-26 22:18:35,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:18:35,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:18:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:18:35,465 INFO L87 Difference]: Start difference. First operand 373 states and 639 transitions. Second operand 13 states. [2019-12-26 22:18:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:36,150 INFO L93 Difference]: Finished difference Result 691 states and 1199 transitions. [2019-12-26 22:18:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:18:36,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-12-26 22:18:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:36,152 INFO L225 Difference]: With dead ends: 691 [2019-12-26 22:18:36,152 INFO L226 Difference]: Without dead ends: 660 [2019-12-26 22:18:36,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:18:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-26 22:18:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 437. [2019-12-26 22:18:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-26 22:18:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 767 transitions. [2019-12-26 22:18:36,159 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 767 transitions. Word has length 77 [2019-12-26 22:18:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:36,159 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 767 transitions. [2019-12-26 22:18:36,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:18:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 767 transitions. [2019-12-26 22:18:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-26 22:18:36,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:36,160 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, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:36,160 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1785649146, now seen corresponding path program 4 times [2019-12-26 22:18:36,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:36,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871637929] [2019-12-26 22:18:36,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:18:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:18:36,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871637929] [2019-12-26 22:18:36,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:18:36,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:18:36,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929930205] [2019-12-26 22:18:36,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:18:36,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:18:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:18:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:18:36,472 INFO L87 Difference]: Start difference. First operand 437 states and 767 transitions. Second operand 15 states. [2019-12-26 22:18:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:18:37,448 INFO L93 Difference]: Finished difference Result 725 states and 1262 transitions. [2019-12-26 22:18:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:18:37,449 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-12-26 22:18:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:18:37,450 INFO L225 Difference]: With dead ends: 725 [2019-12-26 22:18:37,450 INFO L226 Difference]: Without dead ends: 694 [2019-12-26 22:18:37,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:18:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-26 22:18:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 435. [2019-12-26 22:18:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-26 22:18:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 763 transitions. [2019-12-26 22:18:37,457 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 763 transitions. Word has length 77 [2019-12-26 22:18:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:18:37,458 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 763 transitions. [2019-12-26 22:18:37,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:18:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 763 transitions. [2019-12-26 22:18:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-26 22:18:37,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:18:37,459 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, 1, 1, 1, 1, 1, 1] [2019-12-26 22:18:37,460 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:18:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:18:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 5 times [2019-12-26 22:18:37,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:18:37,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012347018] [2019-12-26 22:18:37,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:18:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:18:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:18:37,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:18:37,650 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:18:37,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24|) 0) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t825~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24|) |v_ULTIMATE.start_main_~#t825~0.offset_19| 0)) |v_#memory_int_27|) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t825~0.base_24| 4)) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= v_~z$r_buff1_thd2~0_205 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24| 1)) (= v_~z$r_buff1_thd0~0_494 0) (= |v_ULTIMATE.start_main_~#t825~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t825~0.offset=|v_ULTIMATE.start_main_~#t825~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_16|, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_18|, ULTIMATE.start_main_~#t825~0.base=|v_ULTIMATE.start_main_~#t825~0.base_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_23|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t825~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite68, 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, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t828~0.base, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t827~0.offset, ULTIMATE.start_main_~#t825~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t828~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t826~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-26 22:18:37,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t826~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t826~0.base_10| 4) |v_#length_17|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t826~0.base_10| 0)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10|) |v_ULTIMATE.start_main_~#t826~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t826~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_9|, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_~#t826~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 22:18:37,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12|) |v_ULTIMATE.start_main_~#t827~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t827~0.base_12|) (= |v_ULTIMATE.start_main_~#t827~0.offset_10| 0) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t827~0.base_12|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t827~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t827~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-26 22:18:37,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13|) |v_ULTIMATE.start_main_~#t828~0.offset_11| 3)) |v_#memory_int_21|) (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t828~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t828~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t828~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t828~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_11|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t828~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t828~0.base, #length] because there is no mapped edge [2019-12-26 22:18:37,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-26 22:18:37,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2078858006 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2078858006 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite11_Out2078858006| |P3Thread1of1ForFork3_#t~ite12_Out2078858006|))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork3_#t~ite11_Out2078858006| ~z$w_buff1~0_In2078858006)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out2078858006| ~z$w_buff0~0_In2078858006) (not .cse1) (not .cse0) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In2078858006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2078858006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2078858006, ~z$w_buff1~0=~z$w_buff1~0_In2078858006} OutVars{~z$w_buff0~0=~z$w_buff0~0_In2078858006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2078858006, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out2078858006|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2078858006, ~z$w_buff1~0=~z$w_buff1~0_In2078858006, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out2078858006|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:18:37,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 22:18:37,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-163068850 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite31_Out-163068850| ~z$mem_tmp~0_In-163068850)) (and .cse0 (= ~z~0_In-163068850 |P3Thread1of1ForFork3_#t~ite31_Out-163068850|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-163068850, ~z$flush_delayed~0=~z$flush_delayed~0_In-163068850, ~z~0=~z~0_In-163068850} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-163068850, ~z$flush_delayed~0=~z$flush_delayed~0_In-163068850, ~z~0=~z~0_In-163068850, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out-163068850|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 22:18:37,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:18:37,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:18:37,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1686375150 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1686375150 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite4_Out-1686375150| |P2Thread1of1ForFork2_#t~ite3_Out-1686375150|))) (or (and (= ~z~0_In-1686375150 |P2Thread1of1ForFork2_#t~ite3_Out-1686375150|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff1~0_In-1686375150 |P2Thread1of1ForFork2_#t~ite3_Out-1686375150|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1686375150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1686375150, ~z$w_buff1~0=~z$w_buff1~0_In-1686375150, ~z~0=~z~0_In-1686375150} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out-1686375150|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1686375150|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1686375150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1686375150, ~z$w_buff1~0=~z$w_buff1~0_In-1686375150, ~z~0=~z~0_In-1686375150} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:18:37,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-551922565 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-551922565 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-551922565|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-551922565 |P2Thread1of1ForFork2_#t~ite5_Out-551922565|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-551922565, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-551922565} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-551922565|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-551922565, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-551922565} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:18:37,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1121132787 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1121132787 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1121132787 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1121132787 256)))) (or (and (= ~z$w_buff1_used~0_In-1121132787 |P2Thread1of1ForFork2_#t~ite6_Out-1121132787|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1121132787|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1121132787, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1121132787, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1121132787, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1121132787} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1121132787|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1121132787, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1121132787, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1121132787, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1121132787} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:18:37,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-897854193 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-897854193 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-897854193| ~z$r_buff0_thd3~0_In-897854193)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-897854193|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-897854193, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-897854193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-897854193, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-897854193, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-897854193|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:18:37,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-664820701 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-664820701 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-664820701 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-664820701 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-664820701| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out-664820701| ~z$r_buff1_thd3~0_In-664820701) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-664820701, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-664820701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664820701, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-664820701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-664820701, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-664820701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664820701, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-664820701, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-664820701|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:18:37,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:18:37,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1400476160 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1400476160 256)))) (or (and (= ~z$w_buff0_used~0_In1400476160 |P3Thread1of1ForFork3_#t~ite34_Out1400476160|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork3_#t~ite34_Out1400476160|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1400476160, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1400476160} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1400476160, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1400476160, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out1400476160|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-26 22:18:37,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1172620507 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1172620507 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1172620507 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1172620507 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite35_Out-1172620507|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1172620507 |P3Thread1of1ForFork3_#t~ite35_Out-1172620507|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1172620507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1172620507, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1172620507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1172620507} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1172620507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1172620507, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1172620507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1172620507, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out-1172620507|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-26 22:18:37,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-523630980 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-523630980 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-523630980 0)) (and (= ~z$r_buff0_thd4~0_Out-523630980 ~z$r_buff0_thd4~0_In-523630980) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-523630980, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-523630980} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-523630980, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out-523630980|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-523630980} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 22:18:37,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-2062705578 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2062705578 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2062705578 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2062705578 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite37_Out-2062705578| 0)) (and (= |P3Thread1of1ForFork3_#t~ite37_Out-2062705578| ~z$r_buff1_thd4~0_In-2062705578) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2062705578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2062705578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2062705578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2062705578} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2062705578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2062705578, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out-2062705578|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2062705578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2062705578} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-26 22:18:37,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:18:37,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:18:37,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In457246935 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In457246935 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out457246935| ~z$w_buff1~0_In457246935) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out457246935| ~z~0_In457246935) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In457246935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In457246935, ~z$w_buff1~0=~z$w_buff1~0_In457246935, ~z~0=~z~0_In457246935} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In457246935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In457246935, ~z$w_buff1~0=~z$w_buff1~0_In457246935, ~z~0=~z~0_In457246935, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out457246935|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:18:37,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:18:37,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1544234801 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1544234801 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1544234801| ~z$w_buff0_used~0_In-1544234801)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1544234801| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544234801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544234801} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1544234801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544234801, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1544234801|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:18:37,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1580639000 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1580639000 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1580639000 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1580639000 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1580639000 |ULTIMATE.start_main_#t~ite45_Out-1580639000|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1580639000|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1580639000, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1580639000, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1580639000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1580639000} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1580639000, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1580639000, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1580639000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1580639000, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1580639000|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:18:37,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In333565380 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In333565380 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out333565380| 0)) (and (= ~z$r_buff0_thd0~0_In333565380 |ULTIMATE.start_main_#t~ite46_Out333565380|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In333565380, ~z$w_buff0_used~0=~z$w_buff0_used~0_In333565380} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In333565380, ~z$w_buff0_used~0=~z$w_buff0_used~0_In333565380, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out333565380|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 22:18:37,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In370480424 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In370480424 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In370480424 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In370480424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out370480424| 0)) (and (= ~z$r_buff1_thd0~0_In370480424 |ULTIMATE.start_main_#t~ite47_Out370480424|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In370480424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In370480424, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In370480424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In370480424} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In370480424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In370480424, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In370480424, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out370480424|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In370480424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:18:37,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1134892096 256) 0))) (or (and (= ~z~0_In-1134892096 |ULTIMATE.start_main_#t~ite70_Out-1134892096|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-1134892096 |ULTIMATE.start_main_#t~ite70_Out-1134892096|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1134892096, ~z$flush_delayed~0=~z$flush_delayed~0_In-1134892096, ~z~0=~z~0_In-1134892096} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1134892096, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1134892096|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1134892096, ~z~0=~z~0_In-1134892096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-26 22:18:37,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:18:37,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:18:37 BasicIcfg [2019-12-26 22:18:37,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:18:37,863 INFO L168 Benchmark]: Toolchain (without parser) took 80003.24 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,863 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.80 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 154.3 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.42 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,868 INFO L168 Benchmark]: Boogie Preprocessor took 43.01 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 147.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,868 INFO L168 Benchmark]: RCFGBuilder took 942.92 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 147.5 MB in the beginning and 202.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,875 INFO L168 Benchmark]: TraceAbstraction took 78134.36 ms. Allocated memory was 234.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 202.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 22:18:37,877 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.89 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.80 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 154.3 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.42 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.01 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 147.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 942.92 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 147.5 MB in the beginning and 202.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78134.36 ms. Allocated memory was 234.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 202.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.4s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 77.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4991 SDtfs, 5480 SDslu, 16659 SDs, 0 SdLazy, 8066 SolverSat, 333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 86 SyntacticMatches, 21 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 19094 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1534 NumberOfCodeBlocks, 1534 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1433 ConstructedInterpolants, 0 QuantifiedInterpolants, 447888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...