/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/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:40,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:40,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:40,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:40,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:40,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:40,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:40,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:40,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:40,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:40,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:40,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:40,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:40,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:40,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:40,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:40,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:40,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:40,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:40,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:40,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:40,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:40,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:40,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:40,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:40,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:40,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:40,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:40,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:40,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:40,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:40,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:40,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:40,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:40,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:40,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:40,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:40,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:40,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:40,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:40,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:40,679 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-18 13:31:40,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:40,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:40,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:40,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:40,711 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:40,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:40,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:40,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:40,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:40,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:40,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:40,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:40,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:40,716 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:40,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:40,716 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:40,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:40,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:40,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:40,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:40,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:40,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:40,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:40,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:40,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:40,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:40,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:40,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:40,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:40,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:41,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:41,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:41,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:41,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:41,024 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:41,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 13:31:41,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0601c8a2/f43c437a62a6488bb2ec61595b44b639/FLAG8c1040b50 [2019-12-18 13:31:41,660 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:41,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 13:31:41,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0601c8a2/f43c437a62a6488bb2ec61595b44b639/FLAG8c1040b50 [2019-12-18 13:31:41,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0601c8a2/f43c437a62a6488bb2ec61595b44b639 [2019-12-18 13:31:41,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:41,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:41,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:41,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:41,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:41,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:41" (1/1) ... [2019-12-18 13:31:41,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e51f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:41, skipping insertion in model container [2019-12-18 13:31:41,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:41" (1/1) ... [2019-12-18 13:31:41,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:41,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:42,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:42,577 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:42,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:42,722 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:42,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42 WrapperNode [2019-12-18 13:31:42,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:42,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:42,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:42,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:42,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:42,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:42,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:42,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:42,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (1/1) ... [2019-12-18 13:31:42,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:42,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:42,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:42,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:42,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (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-18 13:31:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:42,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:42,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:42,916 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:31:43,669 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:43,669 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:43,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:43 BoogieIcfgContainer [2019-12-18 13:31:43,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:43,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:43,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:43,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:43,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:41" (1/3) ... [2019-12-18 13:31:43,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c00593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:43, skipping insertion in model container [2019-12-18 13:31:43,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:42" (2/3) ... [2019-12-18 13:31:43,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c00593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:43, skipping insertion in model container [2019-12-18 13:31:43,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:43" (3/3) ... [2019-12-18 13:31:43,688 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2019-12-18 13:31:43,698 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:43,698 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:43,706 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:43,707 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:43,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,784 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,791 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,792 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,792 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:43,813 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:43,833 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:43,833 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:43,833 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:43,834 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:43,834 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:43,834 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:43,834 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:43,834 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:43,851 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 13:31:43,853 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:43,934 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:43,935 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:43,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 13:31:43,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:44,015 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:44,016 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:44,023 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 13:31:44,041 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 13:31:44,043 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:48,963 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:31:49,087 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:31:49,107 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 13:31:49,107 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 13:31:49,111 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 13:31:49,876 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 13:31:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 13:31:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:31:49,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:49,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:49,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 13:31:49,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:49,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342158269] [2019-12-18 13:31:49,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:50,136 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-18 13:31:50,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342158269] [2019-12-18 13:31:50,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:50,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:50,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493361544] [2019-12-18 13:31:50,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:50,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:50,164 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 13:31:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:50,519 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 13:31:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:50,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:31:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:50,656 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 13:31:50,656 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 13:31:50,658 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-18 13:31:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 13:31:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 13:31:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 13:31:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 13:31:51,403 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 13:31:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:51,405 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 13:31:51,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 13:31:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:31:51,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:51,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:51,410 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 13:31:51,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:51,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724738904] [2019-12-18 13:31:51,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:51,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724738904] [2019-12-18 13:31:51,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931802182] [2019-12-18 13:31:51,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:51,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:51,529 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 13:31:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:52,792 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 13:31:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:52,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:31:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:52,873 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 13:31:52,873 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 13:31:52,874 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-18 13:31:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 13:31:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 13:31:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 13:31:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 13:31:53,610 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 13:31:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:53,611 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 13:31:53,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 13:31:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:31:53,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:53,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:53,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:53,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 13:31:53,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:53,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87632499] [2019-12-18 13:31:53,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:53,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87632499] [2019-12-18 13:31:53,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:53,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:53,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519688559] [2019-12-18 13:31:53,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:53,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:53,722 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 13:31:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:54,143 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 13:31:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:54,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:31:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:54,270 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 13:31:54,271 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 13:31:54,271 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-18 13:31:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 13:31:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 13:31:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 13:31:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 13:31:56,159 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 13:31:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:56,162 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 13:31:56,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 13:31:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:31:56,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:56,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:56,179 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 13:31:56,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:56,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121615104] [2019-12-18 13:31:56,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:56,374 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-18 13:31:56,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121615104] [2019-12-18 13:31:56,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:56,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:56,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77925031] [2019-12-18 13:31:56,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:56,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:56,380 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-18 13:31:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:57,204 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-18 13:31:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:57,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 13:31:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:57,283 INFO L225 Difference]: With dead ends: 30132 [2019-12-18 13:31:57,284 INFO L226 Difference]: Without dead ends: 30118 [2019-12-18 13:31:57,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-18 13:31:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-18 13:31:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-18 13:31:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-18 13:31:58,329 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-18 13:31:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-18 13:31:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-18 13:31:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:31:58,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:58,367 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] [2019-12-18 13:31:58,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-18 13:31:58,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:58,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400707468] [2019-12-18 13:31:58,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:58,515 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-18 13:31:58,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400707468] [2019-12-18 13:31:58,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:58,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:58,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737698973] [2019-12-18 13:31:58,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:58,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:58,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:58,518 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 6 states. [2019-12-18 13:31:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:59,022 INFO L93 Difference]: Finished difference Result 32606 states and 115328 transitions. [2019-12-18 13:31:59,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:59,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:31:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:59,108 INFO L225 Difference]: With dead ends: 32606 [2019-12-18 13:31:59,109 INFO L226 Difference]: Without dead ends: 32574 [2019-12-18 13:31:59,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32574 states. [2019-12-18 13:32:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32574 to 28036. [2019-12-18 13:32:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28036 states. [2019-12-18 13:32:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28036 states to 28036 states and 100001 transitions. [2019-12-18 13:32:00,369 INFO L78 Accepts]: Start accepts. Automaton has 28036 states and 100001 transitions. Word has length 27 [2019-12-18 13:32:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:00,370 INFO L462 AbstractCegarLoop]: Abstraction has 28036 states and 100001 transitions. [2019-12-18 13:32:00,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28036 states and 100001 transitions. [2019-12-18 13:32:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:00,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:00,409 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] [2019-12-18 13:32:00,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1188296037, now seen corresponding path program 1 times [2019-12-18 13:32:00,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:00,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082314629] [2019-12-18 13:32:00,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:00,476 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-18 13:32:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082314629] [2019-12-18 13:32:00,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:00,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:00,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339189085] [2019-12-18 13:32:00,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:00,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:00,478 INFO L87 Difference]: Start difference. First operand 28036 states and 100001 transitions. Second operand 3 states. [2019-12-18 13:32:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:00,681 INFO L93 Difference]: Finished difference Result 35568 states and 127677 transitions. [2019-12-18 13:32:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:00,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 13:32:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:02,059 INFO L225 Difference]: With dead ends: 35568 [2019-12-18 13:32:02,059 INFO L226 Difference]: Without dead ends: 35568 [2019-12-18 13:32:02,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35568 states. [2019-12-18 13:32:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35568 to 31188. [2019-12-18 13:32:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-18 13:32:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112337 transitions. [2019-12-18 13:32:02,972 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112337 transitions. Word has length 33 [2019-12-18 13:32:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:02,972 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112337 transitions. [2019-12-18 13:32:02,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112337 transitions. [2019-12-18 13:32:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:03,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:03,010 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] [2019-12-18 13:32:03,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1536973783, now seen corresponding path program 1 times [2019-12-18 13:32:03,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:03,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978912740] [2019-12-18 13:32:03,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:03,068 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-18 13:32:03,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978912740] [2019-12-18 13:32:03,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:03,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:03,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570909899] [2019-12-18 13:32:03,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:03,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:03,070 INFO L87 Difference]: Start difference. First operand 31188 states and 112337 transitions. Second operand 3 states. [2019-12-18 13:32:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:03,250 INFO L93 Difference]: Finished difference Result 31188 states and 112001 transitions. [2019-12-18 13:32:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:03,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 13:32:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:03,308 INFO L225 Difference]: With dead ends: 31188 [2019-12-18 13:32:03,309 INFO L226 Difference]: Without dead ends: 31188 [2019-12-18 13:32:03,309 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-18 13:32:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31188 states. [2019-12-18 13:32:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31188 to 31188. [2019-12-18 13:32:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-18 13:32:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112001 transitions. [2019-12-18 13:32:04,256 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112001 transitions. Word has length 33 [2019-12-18 13:32:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:04,256 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112001 transitions. [2019-12-18 13:32:04,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112001 transitions. [2019-12-18 13:32:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:04,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:04,285 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] [2019-12-18 13:32:04,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1315717310, now seen corresponding path program 1 times [2019-12-18 13:32:04,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:04,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703986819] [2019-12-18 13:32:04,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:04,434 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-18 13:32:04,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703986819] [2019-12-18 13:32:04,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:04,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:04,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070677072] [2019-12-18 13:32:04,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:04,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:04,437 INFO L87 Difference]: Start difference. First operand 31188 states and 112001 transitions. Second operand 7 states. [2019-12-18 13:32:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:05,399 INFO L93 Difference]: Finished difference Result 41802 states and 147366 transitions. [2019-12-18 13:32:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:32:05,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:32:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:05,474 INFO L225 Difference]: With dead ends: 41802 [2019-12-18 13:32:05,474 INFO L226 Difference]: Without dead ends: 41750 [2019-12-18 13:32:05,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:32:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41750 states. [2019-12-18 13:32:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41750 to 27846. [2019-12-18 13:32:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27846 states. [2019-12-18 13:32:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27846 states to 27846 states and 100646 transitions. [2019-12-18 13:32:06,343 INFO L78 Accepts]: Start accepts. Automaton has 27846 states and 100646 transitions. Word has length 33 [2019-12-18 13:32:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:06,344 INFO L462 AbstractCegarLoop]: Abstraction has 27846 states and 100646 transitions. [2019-12-18 13:32:06,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27846 states and 100646 transitions. [2019-12-18 13:32:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:06,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:06,367 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] [2019-12-18 13:32:06,367 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2103492564, now seen corresponding path program 1 times [2019-12-18 13:32:06,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:06,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679445628] [2019-12-18 13:32:06,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:06,440 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-18 13:32:06,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679445628] [2019-12-18 13:32:06,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90408238] [2019-12-18 13:32:06,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:06,442 INFO L87 Difference]: Start difference. First operand 27846 states and 100646 transitions. Second operand 4 states. [2019-12-18 13:32:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:06,513 INFO L93 Difference]: Finished difference Result 16488 states and 51363 transitions. [2019-12-18 13:32:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:06,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 13:32:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:06,535 INFO L225 Difference]: With dead ends: 16488 [2019-12-18 13:32:06,535 INFO L226 Difference]: Without dead ends: 15958 [2019-12-18 13:32:06,536 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-18 13:32:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-18 13:32:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15958. [2019-12-18 13:32:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-18 13:32:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-18 13:32:06,785 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 33 [2019-12-18 13:32:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:06,785 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-18 13:32:06,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-18 13:32:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:06,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:06,794 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] [2019-12-18 13:32:06,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-18 13:32:06,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:06,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885342523] [2019-12-18 13:32:06,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:06,861 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-18 13:32:06,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885342523] [2019-12-18 13:32:06,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:06,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909398954] [2019-12-18 13:32:06,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:06,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:06,863 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 5 states. [2019-12-18 13:32:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:06,908 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-18 13:32:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:06,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 13:32:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:06,912 INFO L225 Difference]: With dead ends: 2712 [2019-12-18 13:32:06,912 INFO L226 Difference]: Without dead ends: 2403 [2019-12-18 13:32:06,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-18 13:32:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-18 13:32:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-18 13:32:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-18 13:32:06,943 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-18 13:32:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:06,945 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-18 13:32:06,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-18 13:32:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 13:32:06,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:06,949 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] [2019-12-18 13:32:06,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-18 13:32:06,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:06,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809563999] [2019-12-18 13:32:06,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:07,040 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-18 13:32:07,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809563999] [2019-12-18 13:32:07,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:07,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:07,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235112100] [2019-12-18 13:32:07,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:07,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:07,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:07,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:07,042 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 6 states. [2019-12-18 13:32:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:07,100 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-18 13:32:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:07,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 13:32:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:07,101 INFO L225 Difference]: With dead ends: 708 [2019-12-18 13:32:07,101 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 13:32:07,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 13:32:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-18 13:32:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 13:32:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-18 13:32:07,108 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-18 13:32:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:07,108 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-18 13:32:07,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-18 13:32:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:32:07,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:07,110 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] [2019-12-18 13:32:07,110 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:07,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-18 13:32:07,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:07,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659644300] [2019-12-18 13:32:07,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:07,214 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-18 13:32:07,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659644300] [2019-12-18 13:32:07,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:07,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:07,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865102741] [2019-12-18 13:32:07,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:07,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:07,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:07,217 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-18 13:32:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:07,424 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-18 13:32:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:07,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 13:32:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:07,426 INFO L225 Difference]: With dead ends: 877 [2019-12-18 13:32:07,426 INFO L226 Difference]: Without dead ends: 877 [2019-12-18 13:32:07,426 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-18 13:32:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-18 13:32:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-18 13:32:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 13:32:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-18 13:32:07,435 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-18 13:32:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:07,436 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-18 13:32:07,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-18 13:32:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:32:07,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:07,437 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] [2019-12-18 13:32:07,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-18 13:32:07,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:07,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897866647] [2019-12-18 13:32:07,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:07,506 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-18 13:32:07,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897866647] [2019-12-18 13:32:07,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:07,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:07,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531375448] [2019-12-18 13:32:07,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:07,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:07,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:07,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:07,508 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-18 13:32:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:07,522 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-18 13:32:07,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:07,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:32:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:07,524 INFO L225 Difference]: With dead ends: 642 [2019-12-18 13:32:07,524 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 13:32:07,524 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-18 13:32:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 13:32:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-18 13:32:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 13:32:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-18 13:32:07,532 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-18 13:32:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:07,533 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-18 13:32:07,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-18 13:32:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:07,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:07,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:07,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 13:32:07,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:07,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115384354] [2019-12-18 13:32:07,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:07,814 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-18 13:32:07,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115384354] [2019-12-18 13:32:07,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:07,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:32:07,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495569823] [2019-12-18 13:32:07,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:32:07,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:32:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:07,816 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 12 states. [2019-12-18 13:32:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:08,558 INFO L93 Difference]: Finished difference Result 1230 states and 2440 transitions. [2019-12-18 13:32:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:32:08,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:32:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:08,561 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 13:32:08,561 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 13:32:08,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:32:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 13:32:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-18 13:32:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-18 13:32:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-18 13:32:08,568 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-18 13:32:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:08,568 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-18 13:32:08,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:32:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-18 13:32:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:08,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:08,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:08,569 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 13:32:08,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:08,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413218018] [2019-12-18 13:32:08,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:08,829 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-18 13:32:08,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413218018] [2019-12-18 13:32:08,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:08,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:32:08,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335322053] [2019-12-18 13:32:08,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:32:08,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:32:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:08,831 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 12 states. [2019-12-18 13:32:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:09,239 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-18 13:32:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:32:09,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:32:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:09,241 INFO L225 Difference]: With dead ends: 852 [2019-12-18 13:32:09,241 INFO L226 Difference]: Without dead ends: 822 [2019-12-18 13:32:09,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:32:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-18 13:32:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-18 13:32:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 13:32:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-18 13:32:09,255 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-18 13:32:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:09,257 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-18 13:32:09,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:32:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-18 13:32:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:09,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:09,259 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] [2019-12-18 13:32:09,259 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-18 13:32:09,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:09,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127794553] [2019-12-18 13:32:09,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:09,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:32:09,409 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:32:09,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1120~0.base_27|) (= v_~y$w_buff1_used~0_304 0) (= 0 |v_ULTIMATE.start_main_~#t1120~0.offset_21|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27|) |v_ULTIMATE.start_main_~#t1120~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= v_~a~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27|) 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1120~0.base_27| 4) |v_#length_19|) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= (store .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27| 1) |v_#valid_54|) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_~#t1120~0.offset=|v_ULTIMATE.start_main_~#t1120~0.offset_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_16|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_~#t1120~0.base=|v_ULTIMATE.start_main_~#t1120~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1121~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1120~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1122~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1120~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:32:09,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9|) |v_ULTIMATE.start_main_~#t1121~0.offset_8| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t1121~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1121~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1121~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1121~0.base_9| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_~#t1121~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:32:09,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1122~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t1122~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10|) |v_ULTIMATE.start_main_~#t1122~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1122~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1122~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:32:09,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff1_thd0~0_Out-1793579564 ~y$r_buff0_thd0~0_In-1793579564) (= ~__unbuffered_p2_EAX~0_Out-1793579564 ~z~0_Out-1793579564) (= ~__unbuffered_p2_EBX~0_Out-1793579564 ~a~0_In-1793579564) (= ~y$r_buff1_thd1~0_Out-1793579564 ~y$r_buff0_thd1~0_In-1793579564) (= ~y$r_buff1_thd2~0_Out-1793579564 ~y$r_buff0_thd2~0_In-1793579564) (= 1 ~z~0_Out-1793579564) (= ~y$r_buff0_thd3~0_In-1793579564 ~y$r_buff1_thd3~0_Out-1793579564) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1793579564)) (= 1 ~y$r_buff0_thd3~0_Out-1793579564)) InVars {~a~0=~a~0_In-1793579564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1793579564, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1793579564, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1793579564, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1793579564, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1793579564} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1793579564, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1793579564, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1793579564, ~a~0=~a~0_In-1793579564, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1793579564, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1793579564, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1793579564, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1793579564, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1793579564, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1793579564, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1793579564, ~z~0=~z~0_Out-1793579564, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1793579564} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:32:09,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 13:32:09,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1171600396| |P1Thread1of1ForFork0_#t~ite3_Out-1171600396|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1171600396 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1171600396 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite3_Out-1171600396| ~y$w_buff1~0_In-1171600396) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out-1171600396| ~y~0_In-1171600396)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1171600396, ~y$w_buff1~0=~y$w_buff1~0_In-1171600396, ~y~0=~y~0_In-1171600396, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1171600396} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1171600396, ~y$w_buff1~0=~y$w_buff1~0_In-1171600396, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1171600396|, ~y~0=~y~0_In-1171600396, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1171600396|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1171600396} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:32:09,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In978017342 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In978017342 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out978017342| ~y$w_buff0_used~0_In978017342) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out978017342|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In978017342, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In978017342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In978017342, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out978017342|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In978017342} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:32:09,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1389951572 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1389951572 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1389951572 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1389951572 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out1389951572|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1389951572 |P2Thread1of1ForFork1_#t~ite12_Out1389951572|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1389951572, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1389951572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1389951572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1389951572} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1389951572, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1389951572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1389951572, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1389951572|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1389951572} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:32:09,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In318207958 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In318207958 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In318207958 ~y$r_buff0_thd3~0_Out318207958) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out318207958) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In318207958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In318207958} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out318207958|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In318207958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out318207958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:32:09,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-750994355 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-750994355 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-750994355 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-750994355 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out-750994355| ~y$r_buff1_thd3~0_In-750994355) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-750994355| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-750994355, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750994355, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-750994355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750994355} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-750994355|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-750994355, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-750994355, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-750994355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-750994355} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:32:09,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:32:09,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In452546172 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In452546172 256)))) (or (and (= ~y$w_buff0_used~0_In452546172 |P1Thread1of1ForFork0_#t~ite5_Out452546172|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out452546172|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In452546172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452546172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In452546172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452546172, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out452546172|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:32:09,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In770340560 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In770340560 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In770340560 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In770340560 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out770340560|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In770340560 |P1Thread1of1ForFork0_#t~ite6_Out770340560|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In770340560, ~y$w_buff0_used~0=~y$w_buff0_used~0_In770340560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In770340560, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770340560} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In770340560, ~y$w_buff0_used~0=~y$w_buff0_used~0_In770340560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In770340560, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out770340560|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770340560} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:32:09,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1782811540 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1782811540 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite7_Out1782811540| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out1782811540| ~y$r_buff0_thd2~0_In1782811540) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782811540, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1782811540} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782811540, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1782811540, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1782811540|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:32:09,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In890514759 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In890514759 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In890514759 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In890514759 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite8_Out890514759| 0)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out890514759| ~y$r_buff1_thd2~0_In890514759) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In890514759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In890514759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In890514759, ~y$w_buff1_used~0=~y$w_buff1_used~0_In890514759} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In890514759, ~y$w_buff0_used~0=~y$w_buff0_used~0_In890514759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In890514759, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out890514759|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In890514759} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:32:09,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:32:09,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:32:09,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1675426543 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1675426543 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite19_Out-1675426543| |ULTIMATE.start_main_#t~ite18_Out-1675426543|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite18_Out-1675426543| ~y$w_buff1~0_In-1675426543) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In-1675426543 |ULTIMATE.start_main_#t~ite18_Out-1675426543|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1675426543, ~y~0=~y~0_In-1675426543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675426543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675426543} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1675426543, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1675426543|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1675426543|, ~y~0=~y~0_In-1675426543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675426543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675426543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:32:09,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In611068950 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In611068950 256) 0))) (or (and (= ~y$w_buff0_used~0_In611068950 |ULTIMATE.start_main_#t~ite20_Out611068950|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out611068950|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In611068950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In611068950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In611068950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In611068950, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out611068950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:32:09,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In997643862 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In997643862 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In997643862 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In997643862 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out997643862| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out997643862| ~y$w_buff1_used~0_In997643862)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In997643862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In997643862, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In997643862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In997643862} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In997643862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In997643862, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out997643862|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In997643862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In997643862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:32:09,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In538064299 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In538064299 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out538064299| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out538064299| ~y$r_buff0_thd0~0_In538064299)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In538064299, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538064299} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In538064299, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538064299, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out538064299|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:32:09,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1832642904 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1832642904 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1832642904 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1832642904 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1832642904 |ULTIMATE.start_main_#t~ite23_Out-1832642904|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1832642904|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832642904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1832642904, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1832642904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1832642904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832642904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1832642904, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1832642904, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1832642904|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1832642904} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:32:09,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1124763581 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_In1124763581| |ULTIMATE.start_main_#t~ite29_Out1124763581|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out1124763581| ~y$w_buff0~0_In1124763581)) (and (= |ULTIMATE.start_main_#t~ite30_Out1124763581| |ULTIMATE.start_main_#t~ite29_Out1124763581|) (= ~y$w_buff0~0_In1124763581 |ULTIMATE.start_main_#t~ite29_Out1124763581|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1124763581 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1124763581 256)) (and (= (mod ~y$w_buff1_used~0_In1124763581 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In1124763581 256)) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1124763581, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1124763581|, ~y$w_buff0~0=~y$w_buff0~0_In1124763581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1124763581, ~weak$$choice2~0=~weak$$choice2~0_In1124763581, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1124763581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1124763581} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1124763581|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1124763581, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1124763581|, ~y$w_buff0~0=~y$w_buff0~0_In1124763581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1124763581, ~weak$$choice2~0=~weak$$choice2~0_In1124763581, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1124763581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1124763581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:32:09,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-208066122 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-208066122 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-208066122 256))) (= 0 (mod ~y$w_buff0_used~0_In-208066122 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-208066122 256))))) (= ~y$w_buff0_used~0_In-208066122 |ULTIMATE.start_main_#t~ite35_Out-208066122|) .cse1 (= |ULTIMATE.start_main_#t~ite36_Out-208066122| |ULTIMATE.start_main_#t~ite35_Out-208066122|)) (and (= |ULTIMATE.start_main_#t~ite35_In-208066122| |ULTIMATE.start_main_#t~ite35_Out-208066122|) (= |ULTIMATE.start_main_#t~ite36_Out-208066122| ~y$w_buff0_used~0_In-208066122) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-208066122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208066122, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-208066122|, ~weak$$choice2~0=~weak$$choice2~0_In-208066122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-208066122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-208066122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-208066122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208066122, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-208066122|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-208066122|, ~weak$$choice2~0=~weak$$choice2~0_In-208066122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-208066122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-208066122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:32:09,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1164684912 256) 0))) (or (and .cse0 (= ~y$w_buff1_used~0_In1164684912 |ULTIMATE.start_main_#t~ite38_Out1164684912|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1164684912 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1164684912 256) 0)) (= (mod ~y$w_buff0_used~0_In1164684912 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1164684912 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out1164684912| |ULTIMATE.start_main_#t~ite38_Out1164684912|)) (and (= |ULTIMATE.start_main_#t~ite38_In1164684912| |ULTIMATE.start_main_#t~ite38_Out1164684912|) (= |ULTIMATE.start_main_#t~ite39_Out1164684912| ~y$w_buff1_used~0_In1164684912) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1164684912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1164684912, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1164684912|, ~weak$$choice2~0=~weak$$choice2~0_In1164684912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1164684912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1164684912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1164684912, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1164684912|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1164684912, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1164684912|, ~weak$$choice2~0=~weak$$choice2~0_In1164684912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1164684912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1164684912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:32:09,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:32:09,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In502354414 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In502354414 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In502354414 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In502354414 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In502354414 256))))) (= ~y$r_buff1_thd0~0_In502354414 |ULTIMATE.start_main_#t~ite44_Out502354414|) (= |ULTIMATE.start_main_#t~ite45_Out502354414| |ULTIMATE.start_main_#t~ite44_Out502354414|) .cse1) (and (= |ULTIMATE.start_main_#t~ite44_In502354414| |ULTIMATE.start_main_#t~ite44_Out502354414|) (not .cse1) (= ~y$r_buff1_thd0~0_In502354414 |ULTIMATE.start_main_#t~ite45_Out502354414|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In502354414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In502354414, ~weak$$choice2~0=~weak$$choice2~0_In502354414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In502354414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In502354414, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In502354414|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In502354414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In502354414, ~weak$$choice2~0=~weak$$choice2~0_In502354414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In502354414, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out502354414|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out502354414|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In502354414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:32:09,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:32:09,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:32:09,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:32:09 BasicIcfg [2019-12-18 13:32:09,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:32:09,525 INFO L168 Benchmark]: Toolchain (without parser) took 27643.04 ms. Allocated memory was 146.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 102.2 MB in the beginning and 850.7 MB in the end (delta: -748.5 MB). Peak memory consumption was 523.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,526 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.87 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 158.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.15 ms. Allocated memory is still 205.0 MB. Free memory was 158.7 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,533 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,534 INFO L168 Benchmark]: RCFGBuilder took 834.44 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 105.9 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,534 INFO L168 Benchmark]: TraceAbstraction took 25843.28 ms. Allocated memory was 205.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.9 MB in the beginning and 850.7 MB in the end (delta: -744.8 MB). Peak memory consumption was 469.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:09,542 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.87 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 158.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.15 ms. Allocated memory is still 205.0 MB. Free memory was 158.7 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.44 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 105.9 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25843.28 ms. Allocated memory was 205.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.9 MB in the beginning and 850.7 MB in the end (delta: -744.8 MB). Peak memory consumption was 469.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1804 SDtfs, 2095 SDslu, 4029 SDs, 0 SdLazy, 2316 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31188occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 36013 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 74933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...