/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:48:11,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:48:11,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:48:11,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:48:11,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:48:11,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:48:11,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:48:11,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:48:11,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:48:11,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:48:11,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:48:11,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:48:11,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:48:11,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:48:11,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:48:11,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:48:11,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:48:11,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:48:11,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:48:11,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:48:11,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:48:11,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:48:11,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:48:11,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:48:11,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:48:11,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:48:11,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:48:11,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:48:11,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:48:11,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:48:11,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:48:11,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:48:11,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:48:11,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:48:11,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:48:11,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:48:11,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:48:11,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:48:11,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:48:11,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:48:11,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:48:11,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:48:11,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:48:11,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:48:11,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:48:11,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:48:11,908 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:48:11,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:48:11,909 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:48:11,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:48:11,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:48:11,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:48:11,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:48:11,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:48:11,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:48:11,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:48:11,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:48:11,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:48:11,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:48:11,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:48:11,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:48:11,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:48:11,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:48:11,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:48:11,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:48:11,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:48:11,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:48:11,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:48:11,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:48:11,913 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:48:11,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:48:11,913 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:48:11,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:48:12,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:48:12,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:48:12,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:48:12,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:48:12,201 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:48:12,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-27 18:48:12,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1051649/bc1a04a1aaad4286a5b0e6dff0e016c0/FLAGf53701d71 [2019-12-27 18:48:12,795 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:48:12,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-27 18:48:12,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1051649/bc1a04a1aaad4286a5b0e6dff0e016c0/FLAGf53701d71 [2019-12-27 18:48:13,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1051649/bc1a04a1aaad4286a5b0e6dff0e016c0 [2019-12-27 18:48:13,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:48:13,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:48:13,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:48:13,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:48:13,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:48:13,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:13,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13, skipping insertion in model container [2019-12-27 18:48:13,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:13,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:48:13,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:48:13,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:48:13,755 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:48:13,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:48:13,934 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:48:13,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13 WrapperNode [2019-12-27 18:48:13,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:48:13,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:48:13,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:48:13,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:48:13,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:13,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:48:14,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:48:14,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:48:14,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:48:14,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... [2019-12-27 18:48:14,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:48:14,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:48:14,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:48:14,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:48:14,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:48:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:48:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:48:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:48:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:48:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:48:14,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:48:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:48:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:48:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:48:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:48:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:48:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:48:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:48:14,123 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:48:14,900 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:48:14,900 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:48:14,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:14 BoogieIcfgContainer [2019-12-27 18:48:14,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:48:14,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:48:14,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:48:14,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:48:14,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:48:13" (1/3) ... [2019-12-27 18:48:14,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a78bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:14, skipping insertion in model container [2019-12-27 18:48:14,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:13" (2/3) ... [2019-12-27 18:48:14,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a78bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:14, skipping insertion in model container [2019-12-27 18:48:14,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:14" (3/3) ... [2019-12-27 18:48:14,910 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2019-12-27 18:48:14,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:48:14,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:48:14,925 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:48:14,926 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:48:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,987 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,987 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:15,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:15,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:15,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:48:15,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:48:15,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:48:15,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:48:15,056 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:48:15,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:48:15,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:48:15,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:48:15,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:48:15,093 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 18:48:15,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:48:15,185 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:48:15,185 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:48:15,198 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:48:15,218 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:48:15,266 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:48:15,266 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:48:15,272 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:48:15,287 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 18:48:15,289 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:48:20,054 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:48:20,186 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:48:20,210 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-27 18:48:20,211 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 18:48:20,213 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-27 18:48:21,172 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-27 18:48:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-27 18:48:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 18:48:21,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:21,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:21,181 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-27 18:48:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-27 18:48:21,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:21,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575351739] [2019-12-27 18:48:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:21,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575351739] [2019-12-27 18:48:21,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:21,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:48:21,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001725025] [2019-12-27 18:48:21,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:21,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:21,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 18:48:21,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:21,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:21,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:21,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:21,583 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-27 18:48:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:21,974 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-27 18:48:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:21,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 18:48:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:22,172 INFO L225 Difference]: With dead ends: 15638 [2019-12-27 18:48:22,172 INFO L226 Difference]: Without dead ends: 15326 [2019-12-27 18:48:22,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-27 18:48:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-27 18:48:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-27 18:48:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-27 18:48:22,979 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-27 18:48:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:22,980 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-27 18:48:22,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-27 18:48:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:22,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:22,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:22,992 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-27 18:48:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-27 18:48:22,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:22,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453344555] [2019-12-27 18:48:22,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:23,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453344555] [2019-12-27 18:48:23,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:23,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:23,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843792202] [2019-12-27 18:48:23,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:23,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:23,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 18:48:23,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:23,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:23,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:48:23,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:23,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:48:23,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:23,221 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-27 18:48:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:24,841 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-27 18:48:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:48:24,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:48:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:24,948 INFO L225 Difference]: With dead ends: 24490 [2019-12-27 18:48:24,949 INFO L226 Difference]: Without dead ends: 24476 [2019-12-27 18:48:24,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-27 18:48:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-27 18:48:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-27 18:48:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-27 18:48:25,921 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-27 18:48:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:25,921 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-27 18:48:25,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:48:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-27 18:48:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:25,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:25,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:25,925 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-27 18:48:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-27 18:48:25,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:25,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570403072] [2019-12-27 18:48:25,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:26,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570403072] [2019-12-27 18:48:26,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:26,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:26,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755905890] [2019-12-27 18:48:26,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:26,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:26,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:48:26,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:26,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:26,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:26,017 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-27 18:48:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:26,086 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-27 18:48:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:26,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:48:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:26,128 INFO L225 Difference]: With dead ends: 12702 [2019-12-27 18:48:26,129 INFO L226 Difference]: Without dead ends: 12702 [2019-12-27 18:48:26,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-27 18:48:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-27 18:48:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-27 18:48:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-27 18:48:27,480 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-27 18:48:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:27,481 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-27 18:48:27,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-27 18:48:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:48:27,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:27,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:27,483 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-27 18:48:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-27 18:48:27,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:27,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072444650] [2019-12-27 18:48:27,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:27,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072444650] [2019-12-27 18:48:27,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:27,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:27,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014408001] [2019-12-27 18:48:27,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:27,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:27,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 18:48:27,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:27,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:27,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:48:27,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:48:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:27,540 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-27 18:48:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:27,561 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-27 18:48:27,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:48:27,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 18:48:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:27,566 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 18:48:27,567 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 18:48:27,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 18:48:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 18:48:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 18:48:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-27 18:48:27,600 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-27 18:48:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:27,601 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-27 18:48:27,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:48:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-27 18:48:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:48:27,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:27,603 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] [2019-12-27 18:48:27,603 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-27 18:48:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-27 18:48:27,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:27,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190528663] [2019-12-27 18:48:27,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:27,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190528663] [2019-12-27 18:48:27,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:27,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:27,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787860304] [2019-12-27 18:48:27,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:27,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:27,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 82 transitions. [2019-12-27 18:48:27,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:27,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:27,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:48:27,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:48:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:27,699 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-27 18:48:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:27,723 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-27 18:48:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:48:27,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 18:48:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:27,726 INFO L225 Difference]: With dead ends: 630 [2019-12-27 18:48:27,726 INFO L226 Difference]: Without dead ends: 630 [2019-12-27 18:48:27,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-27 18:48:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-27 18:48:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 18:48:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-27 18:48:27,736 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-27 18:48:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:27,738 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-27 18:48:27,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:48:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-27 18:48:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:48:27,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:27,744 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] [2019-12-27 18:48:27,744 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-27 18:48:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-27 18:48:27,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:27,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489235930] [2019-12-27 18:48:27,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:27,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489235930] [2019-12-27 18:48:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:27,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:27,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500395704] [2019-12-27 18:48:27,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:27,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:27,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 112 transitions. [2019-12-27 18:48:27,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:27,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:27,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:27,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:27,909 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-27 18:48:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:27,956 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-27 18:48:27,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:27,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:48:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:27,958 INFO L225 Difference]: With dead ends: 584 [2019-12-27 18:48:27,958 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 18:48:27,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 18:48:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-27 18:48:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 18:48:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-27 18:48:27,968 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-27 18:48:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:27,968 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-27 18:48:27,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-27 18:48:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:48:27,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:27,970 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] [2019-12-27 18:48:27,971 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-27 18:48:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-27 18:48:27,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:27,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074914913] [2019-12-27 18:48:27,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:28,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074914913] [2019-12-27 18:48:28,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:28,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:28,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1104390311] [2019-12-27 18:48:28,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:28,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:28,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 112 transitions. [2019-12-27 18:48:28,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:28,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:48:28,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:48:28,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:48:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:28,163 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 5 states. [2019-12-27 18:48:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:28,353 INFO L93 Difference]: Finished difference Result 768 states and 1742 transitions. [2019-12-27 18:48:28,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:48:28,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 18:48:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:28,356 INFO L225 Difference]: With dead ends: 768 [2019-12-27 18:48:28,356 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 18:48:28,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:28,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 18:48:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 580. [2019-12-27 18:48:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 18:48:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1326 transitions. [2019-12-27 18:48:28,368 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1326 transitions. Word has length 55 [2019-12-27 18:48:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:28,369 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1326 transitions. [2019-12-27 18:48:28,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:48:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1326 transitions. [2019-12-27 18:48:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:48:28,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:28,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:28,371 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-27 18:48:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1916501781, now seen corresponding path program 1 times [2019-12-27 18:48:28,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:28,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124172838] [2019-12-27 18:48:28,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:28,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124172838] [2019-12-27 18:48:28,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:28,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:48:28,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270161263] [2019-12-27 18:48:28,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:28,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:28,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 132 transitions. [2019-12-27 18:48:28,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:28,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:48:28,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:48:28,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:48:28,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:28,605 INFO L87 Difference]: Start difference. First operand 580 states and 1326 transitions. Second operand 5 states. [2019-12-27 18:48:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:28,820 INFO L93 Difference]: Finished difference Result 851 states and 1949 transitions. [2019-12-27 18:48:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:48:28,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 18:48:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:28,824 INFO L225 Difference]: With dead ends: 851 [2019-12-27 18:48:28,824 INFO L226 Difference]: Without dead ends: 851 [2019-12-27 18:48:28,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:48:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-27 18:48:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2019-12-27 18:48:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-27 18:48:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1530 transitions. [2019-12-27 18:48:28,837 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1530 transitions. Word has length 56 [2019-12-27 18:48:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:28,838 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1530 transitions. [2019-12-27 18:48:28,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:48:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1530 transitions. [2019-12-27 18:48:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:48:28,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:28,840 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-27 18:48:28,840 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-27 18:48:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 510672277, now seen corresponding path program 2 times [2019-12-27 18:48:28,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626789182] [2019-12-27 18:48:28,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:28,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626789182] [2019-12-27 18:48:28,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:28,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:48:28,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921511110] [2019-12-27 18:48:28,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:29,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:29,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 97 transitions. [2019-12-27 18:48:29,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:29,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:29,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:48:29,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:29,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:48:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:48:29,038 INFO L87 Difference]: Start difference. First operand 664 states and 1530 transitions. Second operand 6 states. [2019-12-27 18:48:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:29,109 INFO L93 Difference]: Finished difference Result 1010 states and 2162 transitions. [2019-12-27 18:48:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:48:29,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 18:48:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:29,112 INFO L225 Difference]: With dead ends: 1010 [2019-12-27 18:48:29,112 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 18:48:29,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 18:48:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 602. [2019-12-27 18:48:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 18:48:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1351 transitions. [2019-12-27 18:48:29,122 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1351 transitions. Word has length 56 [2019-12-27 18:48:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:29,122 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1351 transitions. [2019-12-27 18:48:29,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:48:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1351 transitions. [2019-12-27 18:48:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:48:29,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:29,124 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-27 18:48:29,125 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-27 18:48:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 773779733, now seen corresponding path program 3 times [2019-12-27 18:48:29,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64421142] [2019-12-27 18:48:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:29,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64421142] [2019-12-27 18:48:29,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:29,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:48:29,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632202685] [2019-12-27 18:48:29,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:29,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:29,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 168 transitions. [2019-12-27 18:48:29,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:29,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:29,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:48:29,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:48:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:29,318 INFO L87 Difference]: Start difference. First operand 602 states and 1351 transitions. Second operand 7 states. [2019-12-27 18:48:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:29,448 INFO L93 Difference]: Finished difference Result 955 states and 2063 transitions. [2019-12-27 18:48:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:48:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 18:48:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:29,451 INFO L225 Difference]: With dead ends: 955 [2019-12-27 18:48:29,451 INFO L226 Difference]: Without dead ends: 324 [2019-12-27 18:48:29,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:48:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-27 18:48:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 294. [2019-12-27 18:48:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-27 18:48:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 520 transitions. [2019-12-27 18:48:29,457 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 520 transitions. Word has length 56 [2019-12-27 18:48:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:29,457 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 520 transitions. [2019-12-27 18:48:29,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:48:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 520 transitions. [2019-12-27 18:48:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:48:29,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:29,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:29,459 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-27 18:48:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash 125210929, now seen corresponding path program 4 times [2019-12-27 18:48:29,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:29,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938417121] [2019-12-27 18:48:29,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:29,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938417121] [2019-12-27 18:48:29,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:29,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:48:29,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790880525] [2019-12-27 18:48:29,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:29,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:29,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 118 transitions. [2019-12-27 18:48:29,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:29,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:48:29,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:48:29,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:48:29,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:48:29,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:48:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:48:29,812 INFO L87 Difference]: Start difference. First operand 294 states and 520 transitions. Second operand 10 states. [2019-12-27 18:48:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:30,392 INFO L93 Difference]: Finished difference Result 565 states and 998 transitions. [2019-12-27 18:48:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:48:30,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-27 18:48:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:30,395 INFO L225 Difference]: With dead ends: 565 [2019-12-27 18:48:30,395 INFO L226 Difference]: Without dead ends: 565 [2019-12-27 18:48:30,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:48:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-12-27 18:48:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 336. [2019-12-27 18:48:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 18:48:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 597 transitions. [2019-12-27 18:48:30,402 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 597 transitions. Word has length 56 [2019-12-27 18:48:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:30,403 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 597 transitions. [2019-12-27 18:48:30,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:48:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 597 transitions. [2019-12-27 18:48:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:48:30,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:30,404 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-27 18:48:30,404 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-27 18:48:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 791586909, now seen corresponding path program 5 times [2019-12-27 18:48:30,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:30,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379944872] [2019-12-27 18:48:30,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:30,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379944872] [2019-12-27 18:48:30,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:30,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:30,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147168273] [2019-12-27 18:48:30,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:30,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:30,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 122 transitions. [2019-12-27 18:48:30,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:30,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:30,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:30,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:30,527 INFO L87 Difference]: Start difference. First operand 336 states and 597 transitions. Second operand 3 states. [2019-12-27 18:48:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:30,564 INFO L93 Difference]: Finished difference Result 336 states and 596 transitions. [2019-12-27 18:48:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:30,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 18:48:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:30,566 INFO L225 Difference]: With dead ends: 336 [2019-12-27 18:48:30,566 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 18:48:30,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 18:48:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 209. [2019-12-27 18:48:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 18:48:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 18:48:30,570 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 56 [2019-12-27 18:48:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:30,571 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 18:48:30,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 18:48:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 18:48:30,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:30,572 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-27 18:48:30,572 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-27 18:48:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 1 times [2019-12-27 18:48:30,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:30,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806426467] [2019-12-27 18:48:30,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:30,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806426467] [2019-12-27 18:48:30,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:30,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:48:30,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080696829] [2019-12-27 18:48:30,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:30,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:30,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 118 transitions. [2019-12-27 18:48:30,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:30,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:48:30,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:48:30,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:48:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:48:30,961 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 15 states. [2019-12-27 18:48:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:32,771 INFO L93 Difference]: Finished difference Result 542 states and 911 transitions. [2019-12-27 18:48:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:48:32,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 18:48:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:32,773 INFO L225 Difference]: With dead ends: 542 [2019-12-27 18:48:32,773 INFO L226 Difference]: Without dead ends: 507 [2019-12-27 18:48:32,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=1484, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 18:48:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-27 18:48:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 309. [2019-12-27 18:48:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 18:48:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-27 18:48:32,787 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 57 [2019-12-27 18:48:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:32,787 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-27 18:48:32,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:48:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-27 18:48:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 18:48:32,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:32,789 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-27 18:48:32,789 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-27 18:48:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 2 times [2019-12-27 18:48:32,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:32,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081316193] [2019-12-27 18:48:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:33,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081316193] [2019-12-27 18:48:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:33,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:48:33,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618787434] [2019-12-27 18:48:33,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:33,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:33,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 122 transitions. [2019-12-27 18:48:33,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:33,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:48:33,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:48:33,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:48:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:48:33,396 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 16 states. [2019-12-27 18:48:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:34,282 INFO L93 Difference]: Finished difference Result 497 states and 833 transitions. [2019-12-27 18:48:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 18:48:34,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-12-27 18:48:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:34,283 INFO L225 Difference]: With dead ends: 497 [2019-12-27 18:48:34,284 INFO L226 Difference]: Without dead ends: 462 [2019-12-27 18:48:34,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:48:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-27 18:48:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 319. [2019-12-27 18:48:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 18:48:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 554 transitions. [2019-12-27 18:48:34,291 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 554 transitions. Word has length 57 [2019-12-27 18:48:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:34,291 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 554 transitions. [2019-12-27 18:48:34,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:48:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 554 transitions. [2019-12-27 18:48:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 18:48:34,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:34,292 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-27 18:48:34,293 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-27 18:48:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash 21415560, now seen corresponding path program 3 times [2019-12-27 18:48:34,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:34,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146363198] [2019-12-27 18:48:34,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:34,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146363198] [2019-12-27 18:48:34,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:34,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 18:48:34,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973157486] [2019-12-27 18:48:34,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:34,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:34,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 148 transitions. [2019-12-27 18:48:34,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:48:35,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:48:35,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:48:35,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:35,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:48:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:48:35,216 INFO L87 Difference]: Start difference. First operand 319 states and 554 transitions. Second operand 22 states. [2019-12-27 18:48:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:37,173 INFO L93 Difference]: Finished difference Result 890 states and 1479 transitions. [2019-12-27 18:48:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:48:37,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-27 18:48:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:37,176 INFO L225 Difference]: With dead ends: 890 [2019-12-27 18:48:37,176 INFO L226 Difference]: Without dead ends: 855 [2019-12-27 18:48:37,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 18:48:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-27 18:48:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 337. [2019-12-27 18:48:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-27 18:48:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 588 transitions. [2019-12-27 18:48:37,185 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 588 transitions. Word has length 57 [2019-12-27 18:48:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:37,185 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 588 transitions. [2019-12-27 18:48:37,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:48:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 588 transitions. [2019-12-27 18:48:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 18:48:37,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:37,187 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-27 18:48:37,187 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-27 18:48:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 4 times [2019-12-27 18:48:37,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:37,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004019310] [2019-12-27 18:48:37,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:48:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:48:37,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:48:37,303 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:48:37,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22|) 0) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22| 1) |v_#valid_53|) (= 0 v_~y$w_buff0~0_215) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22|) |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2528~0.base_22| 4)) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2528~0.base_22|) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_26 0) (= |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_18|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_~#t2528~0.base=|v_ULTIMATE.start_main_~#t2528~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_15|, ULTIMATE.start_main_~#t2528~0.offset=|v_ULTIMATE.start_main_~#t2528~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #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, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, 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_#t~ite29, ULTIMATE.start_main_~#t2530~0.base, 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, ULTIMATE.start_main_~#t2529~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, 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, ULTIMATE.start_main_~#t2529~0.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2528~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2530~0.offset, ULTIMATE.start_main_~#t2528~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:48:37,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t2529~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2529~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2529~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11|) |v_ULTIMATE.start_main_~#t2529~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2529~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_11|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2529~0.base, ULTIMATE.start_main_~#t2529~0.offset] because there is no mapped edge [2019-12-27 18:48:37,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10|) |v_ULTIMATE.start_main_~#t2530~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2530~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2530~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2530~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2530~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2530~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2530~0.offset] because there is no mapped edge [2019-12-27 18:48:37,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:48:37,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 18:48:37,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In885848897 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In885848897 256) 0))) (or (and (= ~y$w_buff0_used~0_In885848897 |P2Thread1of1ForFork0_#t~ite11_Out885848897|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out885848897|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In885848897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In885848897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In885848897, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out885848897|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In885848897} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 18:48:37,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-350496613 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-350496613 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-350496613| |P1Thread1of1ForFork2_#t~ite3_Out-350496613|))) (or (and (= ~y~0_In-350496613 |P1Thread1of1ForFork2_#t~ite3_Out-350496613|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In-350496613 |P1Thread1of1ForFork2_#t~ite3_Out-350496613|) (not .cse1) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-350496613, ~y$w_buff1~0=~y$w_buff1~0_In-350496613, ~y~0=~y~0_In-350496613, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-350496613} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-350496613, ~y$w_buff1~0=~y$w_buff1~0_In-350496613, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-350496613|, ~y~0=~y~0_In-350496613, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-350496613|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-350496613} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 18:48:37,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-388687592 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-388687592 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-388687592 |P1Thread1of1ForFork2_#t~ite5_Out-388687592|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-388687592| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-388687592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-388687592} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-388687592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-388687592, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-388687592|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 18:48:37,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In11034734 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In11034734 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In11034734 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In11034734 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out11034734| ~y$w_buff1_used~0_In11034734)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite12_Out11034734| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In11034734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11034734, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11034734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11034734} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In11034734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11034734, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out11034734|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In11034734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11034734} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 18:48:37,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In1152824348 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1152824348 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1152824348 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1152824348 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out1152824348| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out1152824348| ~y$w_buff1_used~0_In1152824348)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1152824348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1152824348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1152824348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1152824348} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1152824348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1152824348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1152824348, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1152824348|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1152824348} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 18:48:37,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In440807005 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In440807005 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In440807005 |P1Thread1of1ForFork2_#t~ite7_Out440807005|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out440807005|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In440807005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In440807005} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In440807005, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In440807005, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out440807005|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 18:48:37,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1029192942 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1029192942 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1029192942 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1029192942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-1029192942|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1029192942 |P1Thread1of1ForFork2_#t~ite8_Out-1029192942|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1029192942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1029192942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1029192942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1029192942} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1029192942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1029192942, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1029192942|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1029192942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1029192942} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 18:48:37,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 18:48:37,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In30117382 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In30117382 256)))) (or (and (= ~y$r_buff0_thd3~0_In30117382 ~y$r_buff0_thd3~0_Out30117382) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out30117382) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In30117382, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In30117382} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In30117382, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out30117382, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out30117382|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 18:48:37,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In891305107 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In891305107 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In891305107 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In891305107 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out891305107| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite14_Out891305107| ~y$r_buff1_thd3~0_In891305107)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In891305107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In891305107, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In891305107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In891305107} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out891305107|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In891305107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In891305107, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In891305107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In891305107} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 18:48:37,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 18:48:37,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:48:37,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In499647380 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In499647380 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite19_Out499647380| |ULTIMATE.start_main_#t~ite18_Out499647380|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite18_Out499647380| ~y$w_buff1~0_In499647380) (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out499647380| ~y~0_In499647380) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In499647380, ~y~0=~y~0_In499647380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In499647380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499647380} OutVars{~y$w_buff1~0=~y$w_buff1~0_In499647380, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out499647380|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out499647380|, ~y~0=~y~0_In499647380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In499647380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499647380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:48:37,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-506449939 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-506449939 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-506449939| ~y$w_buff0_used~0_In-506449939) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-506449939|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-506449939, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-506449939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-506449939, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-506449939, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-506449939|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:48:37,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1948208429 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1948208429 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1948208429 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1948208429 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1948208429| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out-1948208429| ~y$w_buff1_used~0_In-1948208429)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1948208429, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1948208429, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1948208429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1948208429} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1948208429, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1948208429, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1948208429|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1948208429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1948208429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:48:37,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1976437688 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1976437688 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1976437688|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1976437688 |ULTIMATE.start_main_#t~ite22_Out-1976437688|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1976437688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1976437688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1976437688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1976437688, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1976437688|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:48:37,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In971137232 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In971137232 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In971137232 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In971137232 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out971137232|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In971137232 |ULTIMATE.start_main_#t~ite23_Out971137232|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In971137232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In971137232, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In971137232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In971137232} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In971137232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In971137232, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In971137232, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out971137232|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In971137232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 18:48:37,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1802592082 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1802592082| |ULTIMATE.start_main_#t~ite38_Out1802592082|) (= |ULTIMATE.start_main_#t~ite39_Out1802592082| ~y$w_buff1_used~0_In1802592082)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1802592082| ~y$w_buff1_used~0_In1802592082) (= |ULTIMATE.start_main_#t~ite38_Out1802592082| |ULTIMATE.start_main_#t~ite39_Out1802592082|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1802592082 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1802592082 256) 0)) (= (mod ~y$w_buff0_used~0_In1802592082 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1802592082 256)))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1802592082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1802592082, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1802592082|, ~weak$$choice2~0=~weak$$choice2~0_In1802592082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1802592082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802592082} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1802592082, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1802592082|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1802592082, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1802592082|, ~weak$$choice2~0=~weak$$choice2~0_In1802592082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1802592082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802592082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 18:48:37,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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-27 18:48:37,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} 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-27 18:48:37,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:48:37,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:48:37 BasicIcfg [2019-12-27 18:48:37,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:48:37,403 INFO L168 Benchmark]: Toolchain (without parser) took 24275.62 ms. Allocated memory was 145.8 MB in the beginning and 955.3 MB in the end (delta: 809.5 MB). Free memory was 101.6 MB in the beginning and 662.2 MB in the end (delta: -560.6 MB). Peak memory consumption was 248.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,404 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.67 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.28 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,406 INFO L168 Benchmark]: Boogie Preprocessor took 38.35 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,406 INFO L168 Benchmark]: RCFGBuilder took 849.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 105.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,407 INFO L168 Benchmark]: TraceAbstraction took 22498.60 ms. Allocated memory was 202.9 MB in the beginning and 955.3 MB in the end (delta: 752.4 MB). Free memory was 104.6 MB in the beginning and 662.2 MB in the end (delta: -557.6 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:48:37,411 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.67 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.28 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.35 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.88 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 105.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22498.60 ms. Allocated memory was 202.9 MB in the beginning and 955.3 MB in the end (delta: 752.4 MB). Free memory was 104.6 MB in the beginning and 662.2 MB in the end (delta: -557.6 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L804] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L806] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L779] 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, 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=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=2] [L779] 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) [L750] 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, 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=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=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 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) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 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 [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L812] 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) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 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 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L823] 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, 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=2] [L823] 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) [L824] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L824] 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)) [L825] 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, 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=2] [L825] 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)) [L826] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L826] 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)) [L827] 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)) [L829] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L829] 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)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1513 SDtfs, 1782 SDslu, 4774 SDs, 0 SdLazy, 4009 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 37 SyntacticMatches, 28 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3992 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 146363 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...