/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/rfi001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:06:56,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:06:56,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:06:56,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:06:56,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:06:56,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:06:56,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:06:56,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:06:56,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:06:56,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:06:56,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:06:56,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:06:56,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:06:56,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:06:56,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:06:56,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:06:56,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:06:56,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:06:56,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:06:56,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:06:56,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:06:56,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:06:56,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:06:56,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:06:56,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:06:56,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:06:56,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:06:56,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:06:56,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:06:56,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:06:56,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:06:56,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:06:56,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:06:56,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:06:56,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:06:56,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:06:56,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:06:56,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:06:56,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:06:56,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:06:56,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:06:56,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:06:56,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:06:56,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:06:56,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:06:56,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:06:56,098 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:06:56,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:06:56,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:06:56,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:06:56,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:06:56,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:06:56,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:06:56,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:06:56,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:06:56,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:06:56,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:06:56,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:06:56,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:06:56,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:06:56,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:06:56,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:06:56,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:06:56,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:56,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:06:56,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:06:56,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:06:56,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:06:56,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:06:56,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:06:56,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:06:56,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:06:56,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:06:56,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:06:56,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:06:56,425 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:06:56,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 03:06:56,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9af008c/c39975cd4a014a8190fa45a0c788fa28/FLAGccf9ca7b2 [2019-12-27 03:06:57,000 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:06:57,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 03:06:57,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9af008c/c39975cd4a014a8190fa45a0c788fa28/FLAGccf9ca7b2 [2019-12-27 03:06:57,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9af008c/c39975cd4a014a8190fa45a0c788fa28 [2019-12-27 03:06:57,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:06:57,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:06:57,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:57,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:06:57,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:06:57,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:57" (1/1) ... [2019-12-27 03:06:57,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:57, skipping insertion in model container [2019-12-27 03:06:57,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:57" (1/1) ... [2019-12-27 03:06:57,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:06:57,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:06:58,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:58,036 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:06:58,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:58,200 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:06:58,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58 WrapperNode [2019-12-27 03:06:58,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:58,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:58,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:06:58,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:06:58,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:58,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:06:58,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:06:58,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:06:58,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... [2019-12-27 03:06:58,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:06:58,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:06:58,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:06:58,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:06:58,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:06:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:06:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:06:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:06:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:06:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:06:58,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:06:58,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:06:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:06:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:06:58,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:06:58,409 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:06:59,092 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:06:59,092 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:06:59,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:59 BoogieIcfgContainer [2019-12-27 03:06:59,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:06:59,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:06:59,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:06:59,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:06:59,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:06:57" (1/3) ... [2019-12-27 03:06:59,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fc7691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:59, skipping insertion in model container [2019-12-27 03:06:59,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:58" (2/3) ... [2019-12-27 03:06:59,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fc7691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:59, skipping insertion in model container [2019-12-27 03:06:59,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:59" (3/3) ... [2019-12-27 03:06:59,107 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-27 03:06:59,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:06:59,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:06:59,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:06:59,132 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:06:59,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:59,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:06:59,232 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:06:59,232 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:06:59,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:06:59,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:06:59,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:06:59,233 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:06:59,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:06:59,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:06:59,260 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 03:06:59,262 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 03:06:59,384 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 03:06:59,384 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:59,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:59,413 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 03:06:59,457 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 03:06:59,457 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:59,462 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:59,475 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 03:06:59,476 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:07:03,742 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:07:03,875 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-27 03:07:03,875 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 03:07:03,879 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 03:07:04,281 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 03:07:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 03:07:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:07:04,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:04,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:07:04,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-27 03:07:04,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:04,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65987360] [2019-12-27 03:07:04,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:04,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65987360] [2019-12-27 03:07:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:07:04,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814354210] [2019-12-27 03:07:04,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:04,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:04,559 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 03:07:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:04,867 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-27 03:07:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:04,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:07:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:04,957 INFO L225 Difference]: With dead ends: 8365 [2019-12-27 03:07:04,958 INFO L226 Difference]: Without dead ends: 8196 [2019-12-27 03:07:04,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-27 03:07:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-27 03:07:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-27 03:07:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-27 03:07:05,369 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-27 03:07:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:05,369 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-27 03:07:05,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-27 03:07:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:07:05,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:05,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:07:05,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-27 03:07:05,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:05,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412639854] [2019-12-27 03:07:05,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:05,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412639854] [2019-12-27 03:07:05,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:05,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:07:05,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252332923] [2019-12-27 03:07:05,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:07:05,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:07:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:07:05,470 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 4 states. [2019-12-27 03:07:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:05,933 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-27 03:07:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:07:05,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:07:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:06,560 INFO L225 Difference]: With dead ends: 13084 [2019-12-27 03:07:06,561 INFO L226 Difference]: Without dead ends: 13077 [2019-12-27 03:07:06,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:07:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-27 03:07:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-27 03:07:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-27 03:07:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-27 03:07:06,983 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-27 03:07:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:06,983 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-27 03:07:06,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:07:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-27 03:07:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:07:06,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:06,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:07:06,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-27 03:07:06,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:06,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300353076] [2019-12-27 03:07:06,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:07,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300353076] [2019-12-27 03:07:07,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:07:07,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617676270] [2019-12-27 03:07:07,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:07:07,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:07:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:07:07,107 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-27 03:07:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,148 INFO L93 Difference]: Finished difference Result 1922 states and 4461 transitions. [2019-12-27 03:07:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:07:07,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:07:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,153 INFO L225 Difference]: With dead ends: 1922 [2019-12-27 03:07:07,153 INFO L226 Difference]: Without dead ends: 1636 [2019-12-27 03:07:07,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:07:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-27 03:07:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2019-12-27 03:07:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-27 03:07:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3670 transitions. [2019-12-27 03:07:07,191 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3670 transitions. Word has length 11 [2019-12-27 03:07:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,191 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3670 transitions. [2019-12-27 03:07:07,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:07:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3670 transitions. [2019-12-27 03:07:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 03:07:07,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,194 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] [2019-12-27 03:07:07,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1653802499, now seen corresponding path program 1 times [2019-12-27 03:07:07,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698703497] [2019-12-27 03:07:07,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:07,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698703497] [2019-12-27 03:07:07,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:07:07,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344691914] [2019-12-27 03:07:07,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:07:07,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:07:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:07:07,311 INFO L87 Difference]: Start difference. First operand 1636 states and 3670 transitions. Second operand 5 states. [2019-12-27 03:07:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,360 INFO L93 Difference]: Finished difference Result 402 states and 749 transitions. [2019-12-27 03:07:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:07:07,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 03:07:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,362 INFO L225 Difference]: With dead ends: 402 [2019-12-27 03:07:07,362 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 03:07:07,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:07:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 03:07:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-27 03:07:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 03:07:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-27 03:07:07,370 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-27 03:07:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,371 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-27 03:07:07,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:07:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-27 03:07:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:07:07,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:07:07,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -650909015, now seen corresponding path program 1 times [2019-12-27 03:07:07,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378281715] [2019-12-27 03:07:07,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:07,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378281715] [2019-12-27 03:07:07,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:07:07,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006568151] [2019-12-27 03:07:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:07,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,539 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-27 03:07:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,585 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-27 03:07:07,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:07,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:07:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,587 INFO L225 Difference]: With dead ends: 331 [2019-12-27 03:07:07,587 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 03:07:07,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 03:07:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-27 03:07:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 03:07:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-27 03:07:07,595 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-27 03:07:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,595 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-27 03:07:07,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-27 03:07:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:07:07,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,599 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] [2019-12-27 03:07:07,599 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-27 03:07:07,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498911818] [2019-12-27 03:07:07,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:07,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498911818] [2019-12-27 03:07:07,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:07:07,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186434496] [2019-12-27 03:07:07,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:07,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,699 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 3 states. [2019-12-27 03:07:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,742 INFO L93 Difference]: Finished difference Result 331 states and 600 transitions. [2019-12-27 03:07:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:07,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:07:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,743 INFO L225 Difference]: With dead ends: 331 [2019-12-27 03:07:07,744 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 03:07:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 03:07:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-27 03:07:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 03:07:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 596 transitions. [2019-12-27 03:07:07,753 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 596 transitions. Word has length 52 [2019-12-27 03:07:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,755 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 596 transitions. [2019-12-27 03:07:07,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 596 transitions. [2019-12-27 03:07:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:07:07,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,757 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] [2019-12-27 03:07:07,757 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-27 03:07:07,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053089770] [2019-12-27 03:07:07,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:07,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053089770] [2019-12-27 03:07:07,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:07:07,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214206224] [2019-12-27 03:07:07,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:07,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,852 INFO L87 Difference]: Start difference. First operand 327 states and 596 transitions. Second operand 3 states. [2019-12-27 03:07:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,872 INFO L93 Difference]: Finished difference Result 327 states and 583 transitions. [2019-12-27 03:07:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:07,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:07:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,874 INFO L225 Difference]: With dead ends: 327 [2019-12-27 03:07:07,874 INFO L226 Difference]: Without dead ends: 327 [2019-12-27 03:07:07,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-27 03:07:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2019-12-27 03:07:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 03:07:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2019-12-27 03:07:07,886 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 52 [2019-12-27 03:07:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,888 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2019-12-27 03:07:07,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2019-12-27 03:07:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:07:07,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,892 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] [2019-12-27 03:07:07,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-27 03:07:07,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069782314] [2019-12-27 03:07:07,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:08,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069782314] [2019-12-27 03:07:08,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:08,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:07:08,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035562445] [2019-12-27 03:07:08,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:07:08,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:08,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:07:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:07:08,119 INFO L87 Difference]: Start difference. First operand 327 states and 583 transitions. Second operand 8 states. [2019-12-27 03:07:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:08,579 INFO L93 Difference]: Finished difference Result 518 states and 914 transitions. [2019-12-27 03:07:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:07:08,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 03:07:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:08,582 INFO L225 Difference]: With dead ends: 518 [2019-12-27 03:07:08,582 INFO L226 Difference]: Without dead ends: 518 [2019-12-27 03:07:08,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:07:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-27 03:07:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 372. [2019-12-27 03:07:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-27 03:07:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 665 transitions. [2019-12-27 03:07:08,591 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 665 transitions. Word has length 53 [2019-12-27 03:07:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:08,592 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 665 transitions. [2019-12-27 03:07:08,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:07:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 665 transitions. [2019-12-27 03:07:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:07:08,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:08,593 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] [2019-12-27 03:07:08,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-27 03:07:08,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:08,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451662353] [2019-12-27 03:07:08,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:08,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451662353] [2019-12-27 03:07:08,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:08,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:07:08,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944265063] [2019-12-27 03:07:08,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:08,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:08,673 INFO L87 Difference]: Start difference. First operand 372 states and 665 transitions. Second operand 3 states. [2019-12-27 03:07:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:08,711 INFO L93 Difference]: Finished difference Result 371 states and 663 transitions. [2019-12-27 03:07:08,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:08,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:07:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:08,712 INFO L225 Difference]: With dead ends: 371 [2019-12-27 03:07:08,713 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 03:07:08,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 03:07:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 274. [2019-12-27 03:07:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 03:07:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 482 transitions. [2019-12-27 03:07:08,720 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 482 transitions. Word has length 53 [2019-12-27 03:07:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:08,721 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 482 transitions. [2019-12-27 03:07:08,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 482 transitions. [2019-12-27 03:07:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:07:08,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:08,722 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] [2019-12-27 03:07:08,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-27 03:07:08,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:08,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852205297] [2019-12-27 03:07:08,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:09,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852205297] [2019-12-27 03:07:09,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:09,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:07:09,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129300287] [2019-12-27 03:07:09,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:07:09,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:07:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:07:09,016 INFO L87 Difference]: Start difference. First operand 274 states and 482 transitions. Second operand 13 states. [2019-12-27 03:07:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:09,555 INFO L93 Difference]: Finished difference Result 607 states and 1072 transitions. [2019-12-27 03:07:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:07:09,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 03:07:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:09,557 INFO L225 Difference]: With dead ends: 607 [2019-12-27 03:07:09,557 INFO L226 Difference]: Without dead ends: 294 [2019-12-27 03:07:09,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:07:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-27 03:07:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 265. [2019-12-27 03:07:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-27 03:07:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 446 transitions. [2019-12-27 03:07:09,563 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 446 transitions. Word has length 54 [2019-12-27 03:07:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:09,564 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 446 transitions. [2019-12-27 03:07:09,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:07:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 446 transitions. [2019-12-27 03:07:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:07:09,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:09,565 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] [2019-12-27 03:07:09,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1642640547, now seen corresponding path program 2 times [2019-12-27 03:07:09,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:09,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145295149] [2019-12-27 03:07:09,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:09,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145295149] [2019-12-27 03:07:09,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:09,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:07:09,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077905583] [2019-12-27 03:07:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:07:09,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:07:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:07:09,738 INFO L87 Difference]: Start difference. First operand 265 states and 446 transitions. Second operand 11 states. [2019-12-27 03:07:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:09,962 INFO L93 Difference]: Finished difference Result 375 states and 609 transitions. [2019-12-27 03:07:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:07:09,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 03:07:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:09,964 INFO L225 Difference]: With dead ends: 375 [2019-12-27 03:07:09,964 INFO L226 Difference]: Without dead ends: 220 [2019-12-27 03:07:09,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:07:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-27 03:07:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-27 03:07:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-27 03:07:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 330 transitions. [2019-12-27 03:07:09,970 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 330 transitions. Word has length 54 [2019-12-27 03:07:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:09,970 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 330 transitions. [2019-12-27 03:07:09,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:07:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 330 transitions. [2019-12-27 03:07:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:07:09,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:09,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:07:09,972 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 3 times [2019-12-27 03:07:09,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:09,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056019640] [2019-12-27 03:07:09,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:07:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:07:10,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:07:10,096 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:07:10,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| 4) |v_#length_15|) (= v_~y$r_buff0_thd0~0_347 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19| 1) |v_#valid_40|) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1607~0.base_19|) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= v_~y$w_buff1~0_180 0) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0) (= v_~y~0_158 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19|) |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_13|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_~#t1607~0.offset=|v_ULTIMATE.start_main_~#t1607~0.offset_14|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t1607~0.base=|v_ULTIMATE.start_main_~#t1607~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1607~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1607~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:07:10,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= |v_ULTIMATE.start_main_~#t1608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1608~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11|) |v_ULTIMATE.start_main_~#t1608~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1608~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_10|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 03:07:10,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:07:10,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-154075861 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-154075861 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-154075861| |P0Thread1of1ForFork0_#t~ite4_Out-154075861|))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-154075861| ~y~0_In-154075861)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-154075861| ~y$w_buff1~0_In-154075861) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-154075861, ~y$w_buff1~0=~y$w_buff1~0_In-154075861, ~y~0=~y~0_In-154075861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075861} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-154075861, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-154075861|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-154075861|, ~y$w_buff1~0=~y$w_buff1~0_In-154075861, ~y~0=~y~0_In-154075861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075861} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:07:10,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1265898077 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1265898077 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1265898077|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1265898077 |P0Thread1of1ForFork0_#t~ite5_Out-1265898077|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1265898077, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1265898077} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1265898077|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1265898077, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1265898077} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:07:10,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-2061772179 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2061772179 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-2061772179 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2061772179 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2061772179 |P0Thread1of1ForFork0_#t~ite6_Out-2061772179|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2061772179|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2061772179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061772179, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061772179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2061772179} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2061772179|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2061772179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061772179, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061772179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2061772179} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:07:10,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1233418684 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1233418684 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1233418684| ~y$r_buff0_thd1~0_In-1233418684) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1233418684| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1233418684, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1233418684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1233418684, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1233418684|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1233418684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:07:10,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In427499619 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In427499619 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In427499619 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In427499619 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out427499619| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out427499619| ~y$r_buff1_thd1~0_In427499619) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In427499619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In427499619, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In427499619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In427499619} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In427499619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In427499619, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out427499619|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In427499619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In427499619} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:07:10,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:07:10,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-464109277 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-464109277 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-464109277 |P1Thread1of1ForFork1_#t~ite11_Out-464109277|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-464109277| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-464109277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-464109277} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-464109277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-464109277, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-464109277|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:07:10,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In214026424 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In214026424 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In214026424 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In214026424 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out214026424|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In214026424 |P1Thread1of1ForFork1_#t~ite12_Out214026424|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214026424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In214026424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In214026424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214026424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214026424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In214026424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In214026424, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out214026424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214026424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:07:10,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1923026325 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1923026325 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-1923026325 0)) (and (= ~y$r_buff0_thd2~0_Out-1923026325 ~y$r_buff0_thd2~0_In-1923026325) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923026325, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1923026325} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923026325, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1923026325, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1923026325|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:07:10,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-14062477 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-14062477 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-14062477 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-14062477 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-14062477|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-14062477| ~y$r_buff1_thd2~0_In-14062477) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-14062477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-14062477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-14062477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14062477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-14062477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-14062477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-14062477, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-14062477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14062477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:07:10,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:07:10,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:07:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1094103733 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1094103733 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1094103733| ~y$w_buff1~0_In1094103733) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1094103733| ~y~0_In1094103733)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1094103733, ~y~0=~y~0_In1094103733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1094103733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1094103733} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1094103733|, ~y$w_buff1~0=~y$w_buff1~0_In1094103733, ~y~0=~y~0_In1094103733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1094103733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1094103733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 03:07:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 03:07:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1911710829 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1911710829 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1911710829| ~y$w_buff0_used~0_In-1911710829)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1911710829| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1911710829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1911710829} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1911710829, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1911710829|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1911710829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:07:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1749662134 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1749662134 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1749662134 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1749662134 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-1749662134| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1749662134 |ULTIMATE.start_main_#t~ite20_Out-1749662134|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749662134, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749662134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749662134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749662134} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749662134, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749662134, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1749662134|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749662134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749662134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:07:10,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2116937922 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2116937922 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-2116937922|)) (and (= ~y$r_buff0_thd0~0_In-2116937922 |ULTIMATE.start_main_#t~ite21_Out-2116937922|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116937922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2116937922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116937922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2116937922, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2116937922|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:07:10,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In498614545 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In498614545 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In498614545 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In498614545 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out498614545| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out498614545| ~y$r_buff1_thd0~0_In498614545) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In498614545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In498614545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In498614545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In498614545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In498614545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In498614545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In498614545, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out498614545|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In498614545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:07:10,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-922229950 256)))) (or (and (= ~y$w_buff1_used~0_In-922229950 |ULTIMATE.start_main_#t~ite38_Out-922229950|) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In-922229950| |ULTIMATE.start_main_#t~ite37_Out-922229950|)) (and (= ~y$w_buff1_used~0_In-922229950 |ULTIMATE.start_main_#t~ite37_Out-922229950|) .cse0 (= |ULTIMATE.start_main_#t~ite37_Out-922229950| |ULTIMATE.start_main_#t~ite38_Out-922229950|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-922229950 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-922229950 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-922229950 256))) (= (mod ~y$w_buff0_used~0_In-922229950 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-922229950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922229950, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-922229950|, ~weak$$choice2~0=~weak$$choice2~0_In-922229950, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-922229950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-922229950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-922229950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922229950, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-922229950|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-922229950|, ~weak$$choice2~0=~weak$$choice2~0_In-922229950, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-922229950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-922229950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 03:07:10,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 03:07:10,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:07:10,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:07:10,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:07:10 BasicIcfg [2019-12-27 03:07:10,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:07:10,207 INFO L168 Benchmark]: Toolchain (without parser) took 12854.52 ms. Allocated memory was 142.6 MB in the beginning and 499.6 MB in the end (delta: 357.0 MB). Free memory was 98.9 MB in the beginning and 271.9 MB in the end (delta: -173.0 MB). Peak memory consumption was 184.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,211 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.49 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 98.7 MB in the beginning and 156.8 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.07 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 153.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,216 INFO L168 Benchmark]: Boogie Preprocessor took 37.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,217 INFO L168 Benchmark]: RCFGBuilder took 782.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 106.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,217 INFO L168 Benchmark]: TraceAbstraction took 11108.57 ms. Allocated memory was 203.4 MB in the beginning and 499.6 MB in the end (delta: 296.2 MB). Free memory was 106.8 MB in the beginning and 271.9 MB in the end (delta: -165.1 MB). Peak memory consumption was 131.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:10,225 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.43 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.49 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 98.7 MB in the beginning and 156.8 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.07 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 153.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 782.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 106.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11108.57 ms. Allocated memory was 203.4 MB in the beginning and 499.6 MB in the end (delta: 296.2 MB). Free memory was 106.8 MB in the beginning and 271.9 MB in the end (delta: -165.1 MB). Peak memory consumption was 131.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1065 SDtfs, 1170 SDslu, 2028 SDs, 0 SdLazy, 1095 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11568occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 73217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...