/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:48:10,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:48:10,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:48:10,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:48:10,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:48:10,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:48:10,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:48:10,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:48:10,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:48:10,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:48:10,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:48:10,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:48:10,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:48:10,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:48:10,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:48:10,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:48:10,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:48:10,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:48:10,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:48:10,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:48:10,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:48:10,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:48:10,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:48:10,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:48:10,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:48:10,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:48:10,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:48:10,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:48:10,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:48:10,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:48:10,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:48:10,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:48:10,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:48:10,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:48:10,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:48:10,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:48:10,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:48:10,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:48:10,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:48:10,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:48:10,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:48:10,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:48:11,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:48:11,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:48:11,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:48:11,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:48:11,005 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:48:11,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:48:11,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:48:11,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:48:11,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:48:11,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:48:11,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:48:11,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:48:11,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:48:11,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:48:11,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:48:11,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:48:11,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:48:11,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:48:11,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:48:11,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:48:11,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:48:11,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:48:11,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:48:11,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:48:11,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:48:11,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:48:11,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:48:11,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:48:11,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:48:11,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:48:11,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:48:11,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:48:11,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:48:11,312 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:48:11,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-18 18:48:11,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcae8cf9/13fec8d587214422a96c2ffccbde8b1b/FLAGa768586ee [2019-12-18 18:48:11,991 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:48:11,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-18 18:48:12,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcae8cf9/13fec8d587214422a96c2ffccbde8b1b/FLAGa768586ee [2019-12-18 18:48:12,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcae8cf9/13fec8d587214422a96c2ffccbde8b1b [2019-12-18 18:48:12,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:48:12,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:48:12,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:12,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:48:12,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:48:12,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:12" (1/1) ... [2019-12-18 18:48:12,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:12, skipping insertion in model container [2019-12-18 18:48:12,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:12" (1/1) ... [2019-12-18 18:48:12,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:48:12,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:48:12,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:12,858 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:48:12,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:13,083 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:48:13,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13 WrapperNode [2019-12-18 18:48:13,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:13,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:13,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:48:13,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:48:13,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:13,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:48:13,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:48:13,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:48:13,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (1/1) ... [2019-12-18 18:48:13,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:48:13,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:48:13,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:48:13,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:48:13,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.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-18 18:48:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:48:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:48:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:48:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:48:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:48:13,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:48:13,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:48:13,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:48:13,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:48:13,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:48:13,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:48:13,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:48:13,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:48:13,281 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:48:14,094 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:48:14,094 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:48:14,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:14 BoogieIcfgContainer [2019-12-18 18:48:14,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:48:14,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:48:14,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:48:14,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:48:14,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:48:12" (1/3) ... [2019-12-18 18:48:14,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e635047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:14, skipping insertion in model container [2019-12-18 18:48:14,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:13" (2/3) ... [2019-12-18 18:48:14,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e635047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:14, skipping insertion in model container [2019-12-18 18:48:14,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:14" (3/3) ... [2019-12-18 18:48:14,105 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.opt.i [2019-12-18 18:48:14,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:48:14,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:48:14,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:48:14,125 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:48:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,201 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,201 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,221 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:14,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:48:14,260 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:48:14,260 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:48:14,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:48:14,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:48:14,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:48:14,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:48:14,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:48:14,261 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:48:14,279 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 18:48:14,281 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:14,370 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:14,370 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:14,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:14,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:14,472 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:14,473 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:14,484 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:14,506 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 18:48:14,508 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:48:19,402 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-18 18:48:19,517 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-18 18:48:19,653 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:48:19,766 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:48:19,796 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91392 [2019-12-18 18:48:19,796 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 18:48:19,800 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-18 18:48:38,315 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118050 states. [2019-12-18 18:48:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 118050 states. [2019-12-18 18:48:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:48:38,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:38,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:48:38,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:48:38,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash 815309389, now seen corresponding path program 1 times [2019-12-18 18:48:38,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:38,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348459509] [2019-12-18 18:48:38,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:48:38,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348459509] [2019-12-18 18:48:38,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:38,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:48:38,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178353097] [2019-12-18 18:48:38,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:48:38,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:48:38,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:48:38,624 INFO L87 Difference]: Start difference. First operand 118050 states. Second operand 3 states. [2019-12-18 18:48:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:40,404 INFO L93 Difference]: Finished difference Result 117660 states and 502246 transitions. [2019-12-18 18:48:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:48:40,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:48:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:41,104 INFO L225 Difference]: With dead ends: 117660 [2019-12-18 18:48:41,104 INFO L226 Difference]: Without dead ends: 115112 [2019-12-18 18:48:41,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:48:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115112 states. [2019-12-18 18:48:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115112 to 115112. [2019-12-18 18:48:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115112 states. [2019-12-18 18:48:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115112 states to 115112 states and 491858 transitions. [2019-12-18 18:48:51,931 INFO L78 Accepts]: Start accepts. Automaton has 115112 states and 491858 transitions. Word has length 5 [2019-12-18 18:48:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:48:51,932 INFO L462 AbstractCegarLoop]: Abstraction has 115112 states and 491858 transitions. [2019-12-18 18:48:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:48:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states and 491858 transitions. [2019-12-18 18:48:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:48:51,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:51,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:48:51,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:48:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash 162612621, now seen corresponding path program 1 times [2019-12-18 18:48:51,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:51,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747608946] [2019-12-18 18:48:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:48:52,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747608946] [2019-12-18 18:48:52,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:52,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:48:52,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109372989] [2019-12-18 18:48:52,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:48:52,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:48:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:48:52,055 INFO L87 Difference]: Start difference. First operand 115112 states and 491858 transitions. Second operand 4 states. [2019-12-18 18:48:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:58,004 INFO L93 Difference]: Finished difference Result 180042 states and 739573 transitions. [2019-12-18 18:48:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:48:58,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:48:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:58,662 INFO L225 Difference]: With dead ends: 180042 [2019-12-18 18:48:58,662 INFO L226 Difference]: Without dead ends: 179993 [2019-12-18 18:48:58,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179993 states. [2019-12-18 18:49:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179993 to 166069. [2019-12-18 18:49:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166069 states. [2019-12-18 18:49:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166069 states to 166069 states and 689057 transitions. [2019-12-18 18:49:17,194 INFO L78 Accepts]: Start accepts. Automaton has 166069 states and 689057 transitions. Word has length 11 [2019-12-18 18:49:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:17,194 INFO L462 AbstractCegarLoop]: Abstraction has 166069 states and 689057 transitions. [2019-12-18 18:49:17,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 166069 states and 689057 transitions. [2019-12-18 18:49:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:49:17,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:17,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:17,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1907433687, now seen corresponding path program 1 times [2019-12-18 18:49:17,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:17,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413659643] [2019-12-18 18:49:17,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413659643] [2019-12-18 18:49:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646276425] [2019-12-18 18:49:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:17,310 INFO L87 Difference]: Start difference. First operand 166069 states and 689057 transitions. Second operand 4 states. [2019-12-18 18:49:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:20,286 INFO L93 Difference]: Finished difference Result 237299 states and 961992 transitions. [2019-12-18 18:49:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:20,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:49:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:21,037 INFO L225 Difference]: With dead ends: 237299 [2019-12-18 18:49:21,038 INFO L226 Difference]: Without dead ends: 237236 [2019-12-18 18:49:21,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237236 states. [2019-12-18 18:49:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237236 to 202025. [2019-12-18 18:49:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202025 states. [2019-12-18 18:49:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202025 states to 202025 states and 831679 transitions. [2019-12-18 18:49:36,928 INFO L78 Accepts]: Start accepts. Automaton has 202025 states and 831679 transitions. Word has length 13 [2019-12-18 18:49:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:36,929 INFO L462 AbstractCegarLoop]: Abstraction has 202025 states and 831679 transitions. [2019-12-18 18:49:36,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 202025 states and 831679 transitions. [2019-12-18 18:49:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:49:36,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:36,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:36,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1457610254, now seen corresponding path program 1 times [2019-12-18 18:49:36,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:36,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179515637] [2019-12-18 18:49:36,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:37,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179515637] [2019-12-18 18:49:37,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:37,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:37,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294806250] [2019-12-18 18:49:37,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:37,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:37,009 INFO L87 Difference]: Start difference. First operand 202025 states and 831679 transitions. Second operand 3 states. [2019-12-18 18:49:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:37,151 INFO L93 Difference]: Finished difference Result 39500 states and 127344 transitions. [2019-12-18 18:49:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:37,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:49:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:37,227 INFO L225 Difference]: With dead ends: 39500 [2019-12-18 18:49:37,227 INFO L226 Difference]: Without dead ends: 39500 [2019-12-18 18:49:37,228 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-18 18:49:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39500 states. [2019-12-18 18:49:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39500 to 39500. [2019-12-18 18:49:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39500 states. [2019-12-18 18:49:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39500 states to 39500 states and 127344 transitions. [2019-12-18 18:49:43,993 INFO L78 Accepts]: Start accepts. Automaton has 39500 states and 127344 transitions. Word has length 13 [2019-12-18 18:49:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:43,993 INFO L462 AbstractCegarLoop]: Abstraction has 39500 states and 127344 transitions. [2019-12-18 18:49:43,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39500 states and 127344 transitions. [2019-12-18 18:49:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:49:43,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:43,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:43,998 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -440148133, now seen corresponding path program 1 times [2019-12-18 18:49:43,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:43,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220739692] [2019-12-18 18:49:43,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:44,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220739692] [2019-12-18 18:49:44,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:44,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:44,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816502058] [2019-12-18 18:49:44,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:44,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:44,135 INFO L87 Difference]: Start difference. First operand 39500 states and 127344 transitions. Second operand 5 states. [2019-12-18 18:49:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:44,936 INFO L93 Difference]: Finished difference Result 52847 states and 167054 transitions. [2019-12-18 18:49:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:49:44,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:49:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:45,020 INFO L225 Difference]: With dead ends: 52847 [2019-12-18 18:49:45,020 INFO L226 Difference]: Without dead ends: 52834 [2019-12-18 18:49:45,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:49:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52834 states. [2019-12-18 18:49:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52834 to 39960. [2019-12-18 18:49:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39960 states. [2019-12-18 18:49:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39960 states to 39960 states and 128654 transitions. [2019-12-18 18:49:45,807 INFO L78 Accepts]: Start accepts. Automaton has 39960 states and 128654 transitions. Word has length 19 [2019-12-18 18:49:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:45,807 INFO L462 AbstractCegarLoop]: Abstraction has 39960 states and 128654 transitions. [2019-12-18 18:49:45,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39960 states and 128654 transitions. [2019-12-18 18:49:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:49:45,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:45,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:45,822 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash -79667593, now seen corresponding path program 1 times [2019-12-18 18:49:45,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:45,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733561699] [2019-12-18 18:49:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:45,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733561699] [2019-12-18 18:49:45,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:45,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:45,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8720835] [2019-12-18 18:49:45,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:45,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:45,919 INFO L87 Difference]: Start difference. First operand 39960 states and 128654 transitions. Second operand 4 states. [2019-12-18 18:49:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:45,963 INFO L93 Difference]: Finished difference Result 7841 states and 21500 transitions. [2019-12-18 18:49:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:45,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:49:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:45,973 INFO L225 Difference]: With dead ends: 7841 [2019-12-18 18:49:45,973 INFO L226 Difference]: Without dead ends: 7841 [2019-12-18 18:49:45,974 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-18 18:49:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7841 states. [2019-12-18 18:49:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7841 to 7701. [2019-12-18 18:49:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-18 18:49:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 21100 transitions. [2019-12-18 18:49:46,070 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 21100 transitions. Word has length 25 [2019-12-18 18:49:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:46,070 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 21100 transitions. [2019-12-18 18:49:46,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 21100 transitions. [2019-12-18 18:49:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:49:46,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:46,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:46,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -832696622, now seen corresponding path program 1 times [2019-12-18 18:49:46,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:46,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591121470] [2019-12-18 18:49:46,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:46,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591121470] [2019-12-18 18:49:46,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:46,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:46,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976488920] [2019-12-18 18:49:46,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:46,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:46,160 INFO L87 Difference]: Start difference. First operand 7701 states and 21100 transitions. Second operand 5 states. [2019-12-18 18:49:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:46,200 INFO L93 Difference]: Finished difference Result 5712 states and 16440 transitions. [2019-12-18 18:49:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:46,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:49:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:46,209 INFO L225 Difference]: With dead ends: 5712 [2019-12-18 18:49:46,210 INFO L226 Difference]: Without dead ends: 5712 [2019-12-18 18:49:46,210 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-18 18:49:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2019-12-18 18:49:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5299. [2019-12-18 18:49:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 18:49:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 15323 transitions. [2019-12-18 18:49:46,320 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 15323 transitions. Word has length 37 [2019-12-18 18:49:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:46,321 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 15323 transitions. [2019-12-18 18:49:46,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 15323 transitions. [2019-12-18 18:49:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:46,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:46,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:46,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:46,333 INFO L82 PathProgramCache]: Analyzing trace with hash -49475536, now seen corresponding path program 1 times [2019-12-18 18:49:46,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:46,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672410911] [2019-12-18 18:49:46,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:46,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672410911] [2019-12-18 18:49:46,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:46,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:46,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201682766] [2019-12-18 18:49:46,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:46,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:46,409 INFO L87 Difference]: Start difference. First operand 5299 states and 15323 transitions. Second operand 3 states. [2019-12-18 18:49:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:46,592 INFO L93 Difference]: Finished difference Result 5310 states and 15338 transitions. [2019-12-18 18:49:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:46,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:46,600 INFO L225 Difference]: With dead ends: 5310 [2019-12-18 18:49:46,601 INFO L226 Difference]: Without dead ends: 5310 [2019-12-18 18:49:46,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-18 18:49:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5303. [2019-12-18 18:49:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-18 18:49:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-18 18:49:46,668 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 64 [2019-12-18 18:49:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:46,669 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-18 18:49:46,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-18 18:49:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:46,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:46,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:46,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:46,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1883123384, now seen corresponding path program 1 times [2019-12-18 18:49:46,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:46,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127772477] [2019-12-18 18:49:46,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:46,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127772477] [2019-12-18 18:49:46,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:46,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:46,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977607770] [2019-12-18 18:49:46,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:46,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:46,755 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-18 18:49:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:46,808 INFO L93 Difference]: Finished difference Result 5310 states and 15331 transitions. [2019-12-18 18:49:46,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:46,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:46,817 INFO L225 Difference]: With dead ends: 5310 [2019-12-18 18:49:46,817 INFO L226 Difference]: Without dead ends: 5309 [2019-12-18 18:49:46,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-18 18:49:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5304. [2019-12-18 18:49:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-12-18 18:49:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 15325 transitions. [2019-12-18 18:49:46,902 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 15325 transitions. Word has length 64 [2019-12-18 18:49:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:46,902 INFO L462 AbstractCegarLoop]: Abstraction has 5304 states and 15325 transitions. [2019-12-18 18:49:46,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 15325 transitions. [2019-12-18 18:49:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:46,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:46,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:46,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1883571210, now seen corresponding path program 1 times [2019-12-18 18:49:46,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:46,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823378015] [2019-12-18 18:49:46,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:46,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823378015] [2019-12-18 18:49:46,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:46,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:46,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139709407] [2019-12-18 18:49:46,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:46,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:46,994 INFO L87 Difference]: Start difference. First operand 5304 states and 15325 transitions. Second operand 5 states. [2019-12-18 18:49:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:47,330 INFO L93 Difference]: Finished difference Result 8168 states and 23249 transitions. [2019-12-18 18:49:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:49:47,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 18:49:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:47,342 INFO L225 Difference]: With dead ends: 8168 [2019-12-18 18:49:47,342 INFO L226 Difference]: Without dead ends: 8168 [2019-12-18 18:49:47,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8168 states. [2019-12-18 18:49:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8168 to 6046. [2019-12-18 18:49:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6046 states. [2019-12-18 18:49:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 17495 transitions. [2019-12-18 18:49:47,438 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 17495 transitions. Word has length 64 [2019-12-18 18:49:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:47,438 INFO L462 AbstractCegarLoop]: Abstraction has 6046 states and 17495 transitions. [2019-12-18 18:49:47,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 17495 transitions. [2019-12-18 18:49:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:47,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:47,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:47,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1230091042, now seen corresponding path program 2 times [2019-12-18 18:49:47,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:47,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877460425] [2019-12-18 18:49:47,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:47,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877460425] [2019-12-18 18:49:47,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:47,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:47,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664547122] [2019-12-18 18:49:47,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:47,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:47,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:47,577 INFO L87 Difference]: Start difference. First operand 6046 states and 17495 transitions. Second operand 3 states. [2019-12-18 18:49:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:47,609 INFO L93 Difference]: Finished difference Result 5714 states and 16295 transitions. [2019-12-18 18:49:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:47,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:47,619 INFO L225 Difference]: With dead ends: 5714 [2019-12-18 18:49:47,619 INFO L226 Difference]: Without dead ends: 5714 [2019-12-18 18:49:47,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2019-12-18 18:49:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5406. [2019-12-18 18:49:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5406 states. [2019-12-18 18:49:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 15443 transitions. [2019-12-18 18:49:47,721 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 15443 transitions. Word has length 64 [2019-12-18 18:49:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:47,721 INFO L462 AbstractCegarLoop]: Abstraction has 5406 states and 15443 transitions. [2019-12-18 18:49:47,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 15443 transitions. [2019-12-18 18:49:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:47,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:47,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:47,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1128424098, now seen corresponding path program 1 times [2019-12-18 18:49:47,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:47,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848062107] [2019-12-18 18:49:47,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:47,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848062107] [2019-12-18 18:49:47,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:47,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:47,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784245312] [2019-12-18 18:49:47,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:47,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:47,862 INFO L87 Difference]: Start difference. First operand 5406 states and 15443 transitions. Second operand 5 states. [2019-12-18 18:49:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:48,166 INFO L93 Difference]: Finished difference Result 7874 states and 22308 transitions. [2019-12-18 18:49:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:49:48,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:49:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:48,177 INFO L225 Difference]: With dead ends: 7874 [2019-12-18 18:49:48,177 INFO L226 Difference]: Without dead ends: 7874 [2019-12-18 18:49:48,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2019-12-18 18:49:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 6397. [2019-12-18 18:49:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2019-12-18 18:49:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 18301 transitions. [2019-12-18 18:49:48,270 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 18301 transitions. Word has length 65 [2019-12-18 18:49:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:48,270 INFO L462 AbstractCegarLoop]: Abstraction has 6397 states and 18301 transitions. [2019-12-18 18:49:48,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 18301 transitions. [2019-12-18 18:49:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:48,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:48,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:48,279 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1714500708, now seen corresponding path program 2 times [2019-12-18 18:49:48,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:48,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166340463] [2019-12-18 18:49:48,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:48,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166340463] [2019-12-18 18:49:48,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:48,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:48,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806997042] [2019-12-18 18:49:48,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:48,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:48,401 INFO L87 Difference]: Start difference. First operand 6397 states and 18301 transitions. Second operand 3 states. [2019-12-18 18:49:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:48,474 INFO L93 Difference]: Finished difference Result 6397 states and 18300 transitions. [2019-12-18 18:49:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:48,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:49:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:48,488 INFO L225 Difference]: With dead ends: 6397 [2019-12-18 18:49:48,488 INFO L226 Difference]: Without dead ends: 6397 [2019-12-18 18:49:48,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6397 states. [2019-12-18 18:49:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6397 to 3926. [2019-12-18 18:49:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2019-12-18 18:49:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 11422 transitions. [2019-12-18 18:49:48,617 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 11422 transitions. Word has length 65 [2019-12-18 18:49:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:48,617 INFO L462 AbstractCegarLoop]: Abstraction has 3926 states and 11422 transitions. [2019-12-18 18:49:48,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 11422 transitions. [2019-12-18 18:49:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:49:48,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:48,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:48,627 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1444653798, now seen corresponding path program 1 times [2019-12-18 18:49:48,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:48,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391899277] [2019-12-18 18:49:48,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:48,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391899277] [2019-12-18 18:49:48,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:48,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:48,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565219340] [2019-12-18 18:49:48,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:48,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:48,728 INFO L87 Difference]: Start difference. First operand 3926 states and 11422 transitions. Second operand 3 states. [2019-12-18 18:49:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:48,754 INFO L93 Difference]: Finished difference Result 3557 states and 10070 transitions. [2019-12-18 18:49:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:48,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:49:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:48,760 INFO L225 Difference]: With dead ends: 3557 [2019-12-18 18:49:48,761 INFO L226 Difference]: Without dead ends: 3557 [2019-12-18 18:49:48,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2019-12-18 18:49:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3181. [2019-12-18 18:49:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-18 18:49:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 9006 transitions. [2019-12-18 18:49:48,827 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 9006 transitions. Word has length 66 [2019-12-18 18:49:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:48,827 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 9006 transitions. [2019-12-18 18:49:48,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 9006 transitions. [2019-12-18 18:49:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:48,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:48,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:48,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:48,834 INFO L82 PathProgramCache]: Analyzing trace with hash -864116617, now seen corresponding path program 1 times [2019-12-18 18:49:48,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:48,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152296267] [2019-12-18 18:49:48,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:49,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152296267] [2019-12-18 18:49:49,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:49,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:49:49,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97751501] [2019-12-18 18:49:49,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:49:49,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:49:49,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:49:49,152 INFO L87 Difference]: Start difference. First operand 3181 states and 9006 transitions. Second operand 13 states. [2019-12-18 18:49:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:50,407 INFO L93 Difference]: Finished difference Result 12488 states and 35520 transitions. [2019-12-18 18:49:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:49:50,407 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 18:49:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:50,414 INFO L225 Difference]: With dead ends: 12488 [2019-12-18 18:49:50,415 INFO L226 Difference]: Without dead ends: 4610 [2019-12-18 18:49:50,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:49:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2019-12-18 18:49:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 2605. [2019-12-18 18:49:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-18 18:49:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 7305 transitions. [2019-12-18 18:49:50,488 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 7305 transitions. Word has length 67 [2019-12-18 18:49:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:50,488 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 7305 transitions. [2019-12-18 18:49:50,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:49:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 7305 transitions. [2019-12-18 18:49:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:50,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:50,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:50,494 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash -492073483, now seen corresponding path program 2 times [2019-12-18 18:49:50,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:50,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947208683] [2019-12-18 18:49:50,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:49:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:49:50,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:49:50,654 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:49:50,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x$r_buff1_thd3~0_146) (= 0 |v_ULTIMATE.start_main_~#t2284~0.offset_18|) (= v_~z~0_13 0) (= v_~main$tmp_guard0~0_18 0) (= v_~y~0_84 0) (= v_~x$flush_delayed~0_40 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2284~0.base_24| 4)) (= v_~main$tmp_guard1~0_48 0) (= v_~__unbuffered_cnt~0_158 0) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2284~0.base_24|) (= 0 v_~x$w_buff1_used~0_339) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0_used~0_698) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_178) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24|) |v_ULTIMATE.start_main_~#t2284~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~x$r_buff1_thd2~0_152) (= v_~x$r_buff0_thd1~0_141 0) (= v_~x$mem_tmp~0_20 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24| 1)) (= 0 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p2_EBX~0_42 0) (= v_~x$r_buff1_thd0~0_256 0) (= 0 v_~x$w_buff1~0_143) (= 0 |v_#NULL.base_3|) (= 0 v_~x$w_buff0~0_158) (= (select .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24|) 0) (= v_~x$r_buff0_thd0~0_367 0) (= 0 v_~weak$$choice2~0_95) (= 0 v_~x$r_buff0_thd2~0_210) (= 0 v_~x$r_buff0_thd3~0_129) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_16|, ~x$w_buff0~0=v_~x$w_buff0~0_158, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_38|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_40, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_26|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_62|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_71|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ULTIMATE.start_main_~#t2284~0.offset=|v_ULTIMATE.start_main_~#t2284~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_367, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_26|, ~x$w_buff1~0=v_~x$w_buff1~0_143, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_339, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_147|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, ~x~0=v_~x~0_178, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_16|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_24|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_28|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_31|, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_254|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~y~0=v_~y~0_84, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_~#t2284~0.base=|v_ULTIMATE.start_main_~#t2284~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_22|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_256, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698, ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_147|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_95, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_15|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2286~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2284~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2285~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2284~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2286~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:49:50,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L807-1-->L809: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11|) |v_ULTIMATE.start_main_~#t2285~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2285~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2285~0.base_11| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2285~0.offset_9|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2285~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2285~0.offset] because there is no mapped edge [2019-12-18 18:49:50,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2286~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11|) |v_ULTIMATE.start_main_~#t2286~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2286~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2286~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2286~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2286~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2286~0.offset] because there is no mapped edge [2019-12-18 18:49:50,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L4-->L764: Formula: (and (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In330134956)) (= ~x$r_buff0_thd2~0_In330134956 ~x$r_buff1_thd2~0_Out330134956) (= ~x$r_buff1_thd1~0_Out330134956 ~x$r_buff0_thd1~0_In330134956) (= 1 ~y~0_Out330134956) (= ~x$r_buff1_thd3~0_Out330134956 ~x$r_buff0_thd3~0_In330134956) (= ~x$r_buff1_thd0~0_Out330134956 ~x$r_buff0_thd0~0_In330134956) (= 1 ~x$r_buff0_thd2~0_Out330134956)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In330134956, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In330134956, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In330134956, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In330134956, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In330134956} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In330134956, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In330134956, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In330134956, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out330134956, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out330134956, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out330134956, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In330134956, ~y~0=~y~0_Out330134956, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out330134956, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out330134956} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:49:50,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1588116572 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1588116572 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1588116572| ~x$w_buff1~0_In1588116572) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In1588116572 |P2Thread1of1ForFork2_#t~ite15_Out1588116572|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1588116572, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1588116572, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1588116572, ~x~0=~x~0_In1588116572} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1588116572|, ~x$w_buff1~0=~x$w_buff1~0_In1588116572, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1588116572, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1588116572, ~x~0=~x~0_In1588116572} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:49:50,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= v_~x~0_27 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 18:49:50,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1795266837 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1795266837 256) 0))) (or (and (= ~x$w_buff0_used~0_In1795266837 |P2Thread1of1ForFork2_#t~ite17_Out1795266837|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1795266837| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1795266837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1795266837} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1795266837, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1795266837|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1795266837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:49:50,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1320710752 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1320710752 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1320710752 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1320710752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1320710752|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1320710752 |P2Thread1of1ForFork2_#t~ite18_Out1320710752|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1320710752, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1320710752, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1320710752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1320710752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1320710752, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1320710752, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1320710752, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1320710752|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1320710752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:49:50,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-1730845126 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1730845126 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1730845126| ~x~0_In-1730845126) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1730845126 |P0Thread1of1ForFork0_#t~ite3_Out-1730845126|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1730845126, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1730845126, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1730845126, ~x~0=~x~0_In-1730845126} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1730845126|, ~x$w_buff1~0=~x$w_buff1~0_In-1730845126, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1730845126, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1730845126, ~x~0=~x~0_In-1730845126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 18:49:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_31 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 18:49:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1080639060 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1080639060 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1080639060|)) (and (= ~x$w_buff0_used~0_In1080639060 |P0Thread1of1ForFork0_#t~ite5_Out1080639060|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1080639060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080639060} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1080639060|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1080639060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080639060} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:49:50,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1343024867 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1343024867 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1343024867 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1343024867 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1343024867 |P0Thread1of1ForFork0_#t~ite6_Out1343024867|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1343024867|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1343024867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1343024867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1343024867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1343024867} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1343024867|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1343024867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1343024867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1343024867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1343024867} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:49:50,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1307798499 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1307798499 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1307798499| 0)) (and (= ~x$r_buff0_thd1~0_In1307798499 |P0Thread1of1ForFork0_#t~ite7_Out1307798499|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1307798499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1307798499} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1307798499, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1307798499|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1307798499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:49:50,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In41879017 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In41879017 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In41879017 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In41879017 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out41879017| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out41879017| ~x$r_buff1_thd1~0_In41879017) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In41879017, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41879017, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In41879017, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41879017} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In41879017, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out41879017|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41879017, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In41879017, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41879017} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:49:50,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_101 |v_P0Thread1of1ForFork0_#t~ite8_62|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_62|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_61|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_101} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:49:50,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-304021225 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-304021225 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-304021225 |P1Thread1of1ForFork1_#t~ite11_Out-304021225|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-304021225| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-304021225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-304021225} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-304021225|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-304021225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-304021225} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:49:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1687304964 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1687304964 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1687304964 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1687304964 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1687304964|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1687304964 |P1Thread1of1ForFork1_#t~ite12_Out-1687304964|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687304964, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1687304964, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1687304964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687304964} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687304964, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1687304964, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1687304964|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1687304964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687304964} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:49:50,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1993149483 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1993149483 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-1993149483 ~x$r_buff0_thd2~0_Out-1993149483) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-1993149483) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1993149483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1993149483} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1993149483|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1993149483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1993149483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:49:50,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1882559099 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1882559099 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1882559099 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1882559099 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1882559099|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-1882559099 |P1Thread1of1ForFork1_#t~ite14_Out-1882559099|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882559099, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1882559099, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1882559099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882559099} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882559099, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1882559099, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1882559099, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1882559099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882559099} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:49:50,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_54 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:49:50,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In892987971 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In892987971 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out892987971| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out892987971| ~x$r_buff0_thd3~0_In892987971)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In892987971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892987971} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In892987971, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out892987971|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892987971} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:49:50,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In669620005 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In669620005 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In669620005 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In669620005 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In669620005 |P2Thread1of1ForFork2_#t~ite20_Out669620005|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out669620005|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In669620005, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In669620005, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In669620005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In669620005} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out669620005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In669620005, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In669620005, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In669620005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In669620005} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:49:50,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~x$r_buff1_thd3~0_81 |v_P2Thread1of1ForFork2_#t~ite20_50|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_49|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_81, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:49:50,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:49:50,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out1885660771| |ULTIMATE.start_main_#t~ite24_Out1885660771|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1885660771 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1885660771 256)))) (or (and .cse0 (= ~x$w_buff1~0_In1885660771 |ULTIMATE.start_main_#t~ite24_Out1885660771|) (not .cse1) (not .cse2)) (and (= ~x~0_In1885660771 |ULTIMATE.start_main_#t~ite24_Out1885660771|) .cse0 (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1885660771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885660771, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885660771, ~x~0=~x~0_In1885660771} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1885660771, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1885660771|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1885660771|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885660771, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885660771, ~x~0=~x~0_In1885660771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:49:50,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-993801892 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-993801892 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-993801892| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-993801892 |ULTIMATE.start_main_#t~ite26_Out-993801892|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-993801892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993801892} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-993801892, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-993801892|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-993801892} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:49:50,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-468271861 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-468271861 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-468271861 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-468271861 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-468271861 |ULTIMATE.start_main_#t~ite27_Out-468271861|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out-468271861| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-468271861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-468271861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-468271861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-468271861} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-468271861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-468271861, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-468271861|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-468271861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-468271861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:49:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1439804443 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1439804443 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1439804443| ~x$r_buff0_thd0~0_In-1439804443)) (and (= |ULTIMATE.start_main_#t~ite28_Out-1439804443| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1439804443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439804443} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1439804443, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1439804443|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439804443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:49:50,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1981590920 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1981590920 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1981590920 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1981590920 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-1981590920| ~x$r_buff1_thd0~0_In-1981590920) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1981590920| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1981590920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1981590920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1981590920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1981590920} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1981590920, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1981590920|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1981590920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1981590920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1981590920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:49:50,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L832-->L832-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff0_used~0_In-253210468 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite44_Out-253210468| |ULTIMATE.start_main_#t~ite45_Out-253210468|)) (.cse1 (= (mod ~weak$$choice2~0_In-253210468 256) 0)) (.cse5 (= 0 (mod ~x$r_buff1_thd0~0_In-253210468 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-253210468 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-253210468 256)))) (or (and (or (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5)) (= ~x$w_buff1_used~0_In-253210468 |ULTIMATE.start_main_#t~ite44_Out-253210468|)) (and (= ~x$w_buff1_used~0_In-253210468 |ULTIMATE.start_main_#t~ite45_Out-253210468|) (= |ULTIMATE.start_main_#t~ite44_Out-253210468| |ULTIMATE.start_main_#t~ite44_In-253210468|) (not .cse1))) (= |ULTIMATE.start_main_#t~ite43_In-253210468| |ULTIMATE.start_main_#t~ite43_Out-253210468|)) (let ((.cse6 (not .cse2))) (and (= |ULTIMATE.start_main_#t~ite43_Out-253210468| |ULTIMATE.start_main_#t~ite44_Out-253210468|) (not .cse4) (= |ULTIMATE.start_main_#t~ite43_Out-253210468| 0) .cse0 .cse1 (or .cse6 (not .cse5)) (or (not .cse3) .cse6))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-253210468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-253210468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-253210468, ~weak$$choice2~0=~weak$$choice2~0_In-253210468, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-253210468|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253210468, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-253210468|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-253210468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-253210468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-253210468, ~weak$$choice2~0=~weak$$choice2~0_In-253210468, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-253210468|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-253210468|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-253210468|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-253210468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:49:50,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-8-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_91 256) 0)) (= v_~x$w_buff1_used~0_335 |v_ULTIMATE.start_main_#t~ite45_32|) (= v_~x$r_buff0_thd0~0_362 v_~x$r_buff0_thd0~0_361)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_335, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_27|, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_30|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:49:50,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In417839241 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite51_Out417839241| |ULTIMATE.start_main_#t~ite50_Out417839241|) (= ~x$r_buff1_thd0~0_In417839241 |ULTIMATE.start_main_#t~ite50_Out417839241|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In417839241 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In417839241 256) 0)) (= (mod ~x$w_buff0_used~0_In417839241 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In417839241 256)) .cse1)))) (and (not .cse0) (= ~x$r_buff1_thd0~0_In417839241 |ULTIMATE.start_main_#t~ite51_Out417839241|) (= |ULTIMATE.start_main_#t~ite50_In417839241| |ULTIMATE.start_main_#t~ite50_Out417839241|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In417839241|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In417839241, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417839241, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In417839241, ~weak$$choice2~0=~weak$$choice2~0_In417839241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417839241} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out417839241|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In417839241, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out417839241|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417839241, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In417839241, ~weak$$choice2~0=~weak$$choice2~0_In417839241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417839241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 18:49:50,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L836-->L839-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_148) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$flush_delayed~0_22 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:49:50,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:49:50,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:49:50 BasicIcfg [2019-12-18 18:49:50,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:49:50,815 INFO L168 Benchmark]: Toolchain (without parser) took 98556.63 ms. Allocated memory was 145.2 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 99.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,817 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.37 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,821 INFO L168 Benchmark]: Boogie Preprocessor took 46.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,822 INFO L168 Benchmark]: RCFGBuilder took 892.09 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,823 INFO L168 Benchmark]: TraceAbstraction took 96715.89 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 18:49:50,828 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.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.37 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.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 46.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 892.09 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96715.89 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 175 ProgramPointsBefore, 94 ProgramPointsAfterwards, 212 TransitionsBefore, 103 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 32 ChoiceCompositions, 5784 VarBasedMoverChecksPositive, 205 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 91392 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2174 SDtfs, 1970 SDslu, 3656 SDs, 0 SdLazy, 2148 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202025occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 71333 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 709 NumberOfCodeBlocks, 709 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 127791 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...