/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:14,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:14,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:14,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:14,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:14,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:14,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:14,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:14,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:14,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:14,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:14,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:14,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:14,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:14,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:14,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:14,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:14,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:14,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:14,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:14,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:14,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:14,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:14,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:14,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:14,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:14,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:14,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:14,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:14,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:14,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:14,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:14,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:14,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:14,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:14,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:14,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:14,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:14,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:14,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:14,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:14,297 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-VariableLbe.epf [2019-12-27 07:04:14,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:14,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:14,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:14,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:14,316 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:14,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:14,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:14,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:14,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:14,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:14,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:14,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:14,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:14,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:14,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:14,318 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:14,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:14,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:14,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:14,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:14,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:14,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:14,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:14,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:14,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:14,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:14,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:14,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:14,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:14,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:14,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:14,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:14,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:14,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:14,676 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:14,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-27 07:04:14,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1967dca7d/8af31daa2fa6457696eac6a20868dd81/FLAGc625f005b [2019-12-27 07:04:15,334 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:15,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-27 07:04:15,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1967dca7d/8af31daa2fa6457696eac6a20868dd81/FLAGc625f005b [2019-12-27 07:04:15,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1967dca7d/8af31daa2fa6457696eac6a20868dd81 [2019-12-27 07:04:15,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:15,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:15,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:15,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:15,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:15,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:15" (1/1) ... [2019-12-27 07:04:15,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:15, skipping insertion in model container [2019-12-27 07:04:15,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:15" (1/1) ... [2019-12-27 07:04:15,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:15,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:16,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:16,162 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:16,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:16,320 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:16,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16 WrapperNode [2019-12-27 07:04:16,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:16,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:16,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:16,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:16,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:16,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:16,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:16,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:16,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (1/1) ... [2019-12-27 07:04:16,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:16,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:16,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:16,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:16,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (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 07:04:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:16,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:16,535 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 07:04:17,218 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:17,219 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:17,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:17 BoogieIcfgContainer [2019-12-27 07:04:17,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:17,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:17,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:17,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:17,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:15" (1/3) ... [2019-12-27 07:04:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cdf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:17, skipping insertion in model container [2019-12-27 07:04:17,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:16" (2/3) ... [2019-12-27 07:04:17,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cdf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:17, skipping insertion in model container [2019-12-27 07:04:17,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:17" (3/3) ... [2019-12-27 07:04:17,231 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2019-12-27 07:04:17,242 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:17,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:17,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:17,256 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:17,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:17,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:17,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:17,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:17,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:17,381 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:17,381 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:17,381 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:17,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:17,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:17,399 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 07:04:17,401 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:17,509 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:17,509 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:17,522 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 07:04:17,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:17,582 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:17,582 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:17,588 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 07:04:17,600 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 07:04:17,601 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:20,589 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:20,743 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:04:20,773 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-27 07:04:20,774 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 07:04:20,778 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:04:21,332 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-27 07:04:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-27 07:04:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:04:21,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:21,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:04:21,350 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-27 07:04:21,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:21,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619334039] [2019-12-27 07:04:21,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:21,658 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 07:04:21,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619334039] [2019-12-27 07:04:21,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:21,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:21,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833125801] [2019-12-27 07:04:21,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:21,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:21,687 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-27 07:04:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:22,064 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-27 07:04:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:22,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:04:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:22,168 INFO L225 Difference]: With dead ends: 9298 [2019-12-27 07:04:22,168 INFO L226 Difference]: Without dead ends: 9116 [2019-12-27 07:04:22,170 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 07:04:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-27 07:04:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-27 07:04:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 07:04:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-27 07:04:22,585 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-27 07:04:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-27 07:04:22,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-27 07:04:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:22,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:22,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:22,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-27 07:04:22,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:22,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667171007] [2019-12-27 07:04:22,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,826 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 07:04:22,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667171007] [2019-12-27 07:04:22,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:22,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905131512] [2019-12-27 07:04:22,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:22,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:22,831 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 4 states. [2019-12-27 07:04:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:23,425 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-27 07:04:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:23,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:04:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:23,520 INFO L225 Difference]: With dead ends: 14491 [2019-12-27 07:04:23,520 INFO L226 Difference]: Without dead ends: 14484 [2019-12-27 07:04:23,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-27 07:04:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-27 07:04:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-27 07:04:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-27 07:04:24,740 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-27 07:04:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:24,740 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-27 07:04:24,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-27 07:04:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:24,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:24,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:24,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-27 07:04:24,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:24,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247525255] [2019-12-27 07:04:24,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:24,804 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 07:04:24,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247525255] [2019-12-27 07:04:24,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:24,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926684529] [2019-12-27 07:04:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:24,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:24,807 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-27 07:04:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:25,072 INFO L93 Difference]: Finished difference Result 15862 states and 50069 transitions. [2019-12-27 07:04:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:25,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:04:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:25,128 INFO L225 Difference]: With dead ends: 15862 [2019-12-27 07:04:25,128 INFO L226 Difference]: Without dead ends: 15862 [2019-12-27 07:04:25,129 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 07:04:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-12-27 07:04:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14086. [2019-12-27 07:04:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2019-12-27 07:04:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 44814 transitions. [2019-12-27 07:04:25,785 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 44814 transitions. Word has length 11 [2019-12-27 07:04:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:25,786 INFO L462 AbstractCegarLoop]: Abstraction has 14086 states and 44814 transitions. [2019-12-27 07:04:25,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 44814 transitions. [2019-12-27 07:04:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:04:25,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:25,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:25,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash -955684775, now seen corresponding path program 1 times [2019-12-27 07:04:25,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:25,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736627292] [2019-12-27 07:04:25,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:25,881 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 07:04:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736627292] [2019-12-27 07:04:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:25,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:25,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882354684] [2019-12-27 07:04:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:25,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:25,883 INFO L87 Difference]: Start difference. First operand 14086 states and 44814 transitions. Second operand 5 states. [2019-12-27 07:04:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:26,333 INFO L93 Difference]: Finished difference Result 18942 states and 58832 transitions. [2019-12-27 07:04:26,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:04:26,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:04:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:26,381 INFO L225 Difference]: With dead ends: 18942 [2019-12-27 07:04:26,382 INFO L226 Difference]: Without dead ends: 18935 [2019-12-27 07:04:26,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:04:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2019-12-27 07:04:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 13974. [2019-12-27 07:04:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2019-12-27 07:04:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 44317 transitions. [2019-12-27 07:04:26,981 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 44317 transitions. Word has length 17 [2019-12-27 07:04:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:26,981 INFO L462 AbstractCegarLoop]: Abstraction has 13974 states and 44317 transitions. [2019-12-27 07:04:26,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 44317 transitions. [2019-12-27 07:04:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:26,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:26,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:26,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1822059607, now seen corresponding path program 1 times [2019-12-27 07:04:26,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:26,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491389355] [2019-12-27 07:04:26,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:04:27,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491389355] [2019-12-27 07:04:27,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:27,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:27,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902217785] [2019-12-27 07:04:27,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:27,042 INFO L87 Difference]: Start difference. First operand 13974 states and 44317 transitions. Second operand 3 states. [2019-12-27 07:04:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:27,144 INFO L93 Difference]: Finished difference Result 17027 states and 54294 transitions. [2019-12-27 07:04:27,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:27,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:04:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:27,180 INFO L225 Difference]: With dead ends: 17027 [2019-12-27 07:04:27,180 INFO L226 Difference]: Without dead ends: 17027 [2019-12-27 07:04:27,181 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 07:04:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2019-12-27 07:04:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 16072. [2019-12-27 07:04:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-12-27 07:04:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 51443 transitions. [2019-12-27 07:04:28,317 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 51443 transitions. Word has length 25 [2019-12-27 07:04:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,323 INFO L462 AbstractCegarLoop]: Abstraction has 16072 states and 51443 transitions. [2019-12-27 07:04:28,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 51443 transitions. [2019-12-27 07:04:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:28,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:28,339 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1659519911, now seen corresponding path program 1 times [2019-12-27 07:04:28,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31760984] [2019-12-27 07:04:28,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:04:28,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31760984] [2019-12-27 07:04:28,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:28,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:28,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666582154] [2019-12-27 07:04:28,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:28,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:28,465 INFO L87 Difference]: Start difference. First operand 16072 states and 51443 transitions. Second operand 4 states. [2019-12-27 07:04:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:28,504 INFO L93 Difference]: Finished difference Result 2493 states and 5802 transitions. [2019-12-27 07:04:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:04:28,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:04:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:28,511 INFO L225 Difference]: With dead ends: 2493 [2019-12-27 07:04:28,511 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 07:04:28,512 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 07:04:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 07:04:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-27 07:04:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-27 07:04:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5011 transitions. [2019-12-27 07:04:28,553 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5011 transitions. Word has length 25 [2019-12-27 07:04:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,553 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 5011 transitions. [2019-12-27 07:04:28,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5011 transitions. [2019-12-27 07:04:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:04:28,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:28,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1180281911, now seen corresponding path program 1 times [2019-12-27 07:04:28,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838466935] [2019-12-27 07:04:28,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:28,648 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 07:04:28,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838466935] [2019-12-27 07:04:28,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:28,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:04:28,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519329616] [2019-12-27 07:04:28,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:28,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:28,651 INFO L87 Difference]: Start difference. First operand 2207 states and 5011 transitions. Second operand 5 states. [2019-12-27 07:04:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:28,699 INFO L93 Difference]: Finished difference Result 431 states and 787 transitions. [2019-12-27 07:04:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:28,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:04:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:28,701 INFO L225 Difference]: With dead ends: 431 [2019-12-27 07:04:28,701 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 07:04:28,701 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 07:04:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 07:04:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2019-12-27 07:04:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 07:04:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2019-12-27 07:04:28,715 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 37 [2019-12-27 07:04:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,715 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2019-12-27 07:04:28,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2019-12-27 07:04:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:28,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,719 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 07:04:28,719 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-27 07:04:28,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800010155] [2019-12-27 07:04:28,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:28,818 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 07:04:28,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800010155] [2019-12-27 07:04:28,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:28,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:28,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643209137] [2019-12-27 07:04:28,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:28,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:28,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:28,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:28,820 INFO L87 Difference]: Start difference. First operand 350 states and 632 transitions. Second operand 3 states. [2019-12-27 07:04:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:28,836 INFO L93 Difference]: Finished difference Result 350 states and 619 transitions. [2019-12-27 07:04:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:28,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:04:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:28,837 INFO L225 Difference]: With dead ends: 350 [2019-12-27 07:04:28,837 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 07:04:28,838 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 07:04:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 07:04:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-27 07:04:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 07:04:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 619 transitions. [2019-12-27 07:04:28,843 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 619 transitions. Word has length 52 [2019-12-27 07:04:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,844 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 619 transitions. [2019-12-27 07:04:28,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 619 transitions. [2019-12-27 07:04:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:04:28,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,845 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 07:04:28,846 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-27 07:04:28,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110139178] [2019-12-27 07:04:28,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:28,930 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 07:04:28,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110139178] [2019-12-27 07:04:28,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:28,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:28,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453847742] [2019-12-27 07:04:28,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:28,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:28,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:28,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:28,934 INFO L87 Difference]: Start difference. First operand 350 states and 619 transitions. Second operand 3 states. [2019-12-27 07:04:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:28,985 INFO L93 Difference]: Finished difference Result 349 states and 617 transitions. [2019-12-27 07:04:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:28,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:04:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:28,987 INFO L225 Difference]: With dead ends: 349 [2019-12-27 07:04:28,987 INFO L226 Difference]: Without dead ends: 349 [2019-12-27 07:04:28,987 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 07:04:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-27 07:04:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-12-27 07:04:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 07:04:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 617 transitions. [2019-12-27 07:04:28,993 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 617 transitions. Word has length 53 [2019-12-27 07:04:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:28,994 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 617 transitions. [2019-12-27 07:04:28,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 617 transitions. [2019-12-27 07:04:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:04:28,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:28,997 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 07:04:28,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-27 07:04:28,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:28,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613622714] [2019-12-27 07:04:28,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:29,409 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 07:04:29,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613622714] [2019-12-27 07:04:29,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:29,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:04:29,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585960327] [2019-12-27 07:04:29,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:04:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:04:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:04:29,411 INFO L87 Difference]: Start difference. First operand 349 states and 617 transitions. Second operand 13 states. [2019-12-27 07:04:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:30,110 INFO L93 Difference]: Finished difference Result 707 states and 1277 transitions. [2019-12-27 07:04:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:04:30,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:04:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:30,111 INFO L225 Difference]: With dead ends: 707 [2019-12-27 07:04:30,111 INFO L226 Difference]: Without dead ends: 302 [2019-12-27 07:04:30,112 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 07:04:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-27 07:04:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 269. [2019-12-27 07:04:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-12-27 07:04:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 474 transitions. [2019-12-27 07:04:30,116 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 474 transitions. Word has length 54 [2019-12-27 07:04:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:30,117 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 474 transitions. [2019-12-27 07:04:30,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:04:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 474 transitions. [2019-12-27 07:04:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:04:30,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:30,118 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 07:04:30,118 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash -853828981, now seen corresponding path program 2 times [2019-12-27 07:04:30,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657713691] [2019-12-27 07:04:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:30,258 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 07:04:30,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657713691] [2019-12-27 07:04:30,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:30,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:30,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972090472] [2019-12-27 07:04:30,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:04:30,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:30,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:04:30,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:30,261 INFO L87 Difference]: Start difference. First operand 269 states and 474 transitions. Second operand 7 states. [2019-12-27 07:04:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:30,365 INFO L93 Difference]: Finished difference Result 376 states and 644 transitions. [2019-12-27 07:04:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:04:30,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:04:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:30,367 INFO L225 Difference]: With dead ends: 376 [2019-12-27 07:04:30,367 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 07:04:30,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:04:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 07:04:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 07:04:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 07:04:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 07:04:30,371 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 07:04:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:30,371 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 07:04:30,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:04:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 07:04:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:04:30,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:30,372 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 07:04:30,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 3 times [2019-12-27 07:04:30,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:30,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809204964] [2019-12-27 07:04:30,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:30,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:04:30,512 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:04:30,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1611~0.base_19|) |v_ULTIMATE.start_main_~#t1611~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 |v_ULTIMATE.start_main_~#t1611~0.offset_14|) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19| 1)) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$w_buff0_used~0_106 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1611~0.base_19| 4)) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1611~0.base_19|) (= 0 v_~z~0_9) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1611~0.base_19|) 0) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) 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_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1611~0.base=|v_ULTIMATE.start_main_~#t1611~0.base_19|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~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_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~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_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1611~0.offset=|v_ULTIMATE.start_main_~#t1611~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y~0=v_~y~0_28, ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_~#t1611~0.base, 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, ~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_~#t1611~0.offset, 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_~#t1612~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1612~0.offset, 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 07:04:30,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1612~0.base_11|) |v_ULTIMATE.start_main_~#t1612~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1612~0.base_11| 1) |v_#valid_23|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1612~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1612~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1612~0.base_11|) (= |v_ULTIMATE.start_main_~#t1612~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1612~0.base=|v_ULTIMATE.start_main_~#t1612~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1612~0.offset=|v_ULTIMATE.start_main_~#t1612~0.offset_10|, #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_~#t1612~0.base, ULTIMATE.start_main_~#t1612~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 07:04:30,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} 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 07:04:30,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-497726159| |P0Thread1of1ForFork0_#t~ite4_Out-497726159|)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-497726159 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-497726159 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-497726159| ~y$w_buff1~0_In-497726159) .cse2) (and (= ~y~0_In-497726159 |P0Thread1of1ForFork0_#t~ite3_Out-497726159|) .cse2 (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-497726159, ~y$w_buff1~0=~y$w_buff1~0_In-497726159, ~y~0=~y~0_In-497726159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497726159} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-497726159, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-497726159|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-497726159|, ~y$w_buff1~0=~y$w_buff1~0_In-497726159, ~y~0=~y~0_In-497726159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497726159} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:04:30,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1969219412 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1969219412 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1969219412|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1969219412 |P0Thread1of1ForFork0_#t~ite5_Out1969219412|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1969219412, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1969219412} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1969219412|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1969219412, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1969219412} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:04:30,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-269624722 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-269624722 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-269624722 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-269624722 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-269624722| 0)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-269624722 |P0Thread1of1ForFork0_#t~ite6_Out-269624722|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-269624722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-269624722, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-269624722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-269624722} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-269624722|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-269624722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-269624722, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-269624722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-269624722} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:04:30,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In95734126 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In95734126 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out95734126| ~y$r_buff0_thd1~0_In95734126)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out95734126| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In95734126, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In95734126} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In95734126, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out95734126|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In95734126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:04:30,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In745011690 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In745011690 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In745011690 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In745011690 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out745011690| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out745011690| ~y$r_buff1_thd1~0_In745011690)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In745011690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In745011690, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In745011690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In745011690} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In745011690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In745011690, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out745011690|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In745011690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In745011690} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:04:30,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} 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 07:04:30,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2107465707 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2107465707 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2107465707 |P1Thread1of1ForFork1_#t~ite11_Out2107465707|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out2107465707|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2107465707, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2107465707} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2107465707, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2107465707, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2107465707|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:04:30,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1217169614 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1217169614 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1217169614 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1217169614 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1217169614|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1217169614 |P1Thread1of1ForFork1_#t~ite12_Out-1217169614|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217169614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217169614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217169614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217169614} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217169614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217169614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217169614, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1217169614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217169614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:04:30,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2016020199 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2016020199 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-2016020199 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-2016020199 ~y$r_buff0_thd2~0_In-2016020199)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2016020199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2016020199} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2016020199, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2016020199, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2016020199|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:04:30,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1621958739 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1621958739 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1621958739 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1621958739 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1621958739| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1621958739 |P1Thread1of1ForFork1_#t~ite14_Out-1621958739|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1621958739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1621958739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1621958739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1621958739} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1621958739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1621958739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1621958739, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1621958739|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1621958739} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:04:30,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, 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 07:04:30,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:04:30,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1017182308 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1017182308 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-1017182308| ~y$w_buff1~0_In-1017182308) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1017182308| ~y~0_In-1017182308) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1017182308, ~y~0=~y~0_In-1017182308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1017182308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1017182308} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1017182308|, ~y$w_buff1~0=~y$w_buff1~0_In-1017182308, ~y~0=~y~0_In-1017182308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1017182308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1017182308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 07:04:30,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |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_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 07:04:30,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1527959496 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1527959496 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-1527959496|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1527959496 |ULTIMATE.start_main_#t~ite19_Out-1527959496|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1527959496, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1527959496} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1527959496, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1527959496|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1527959496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:04:30,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In417698938 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In417698938 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In417698938 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In417698938 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out417698938| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out417698938| ~y$w_buff1_used~0_In417698938) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In417698938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417698938, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In417698938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In417698938} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In417698938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417698938, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out417698938|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In417698938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In417698938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:04:30,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1316274810 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1316274810 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1316274810| ~y$r_buff0_thd0~0_In1316274810) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1316274810| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1316274810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1316274810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1316274810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1316274810, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1316274810|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:04:30,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In615967484 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In615967484 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In615967484 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In615967484 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out615967484| ~y$r_buff1_thd0~0_In615967484) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out615967484|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In615967484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In615967484, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In615967484, ~y$w_buff1_used~0=~y$w_buff1_used~0_In615967484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In615967484, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In615967484, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In615967484, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out615967484|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In615967484} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:04:30,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-71042983 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_In-71042983| |ULTIMATE.start_main_#t~ite37_Out-71042983|) (= ~y$w_buff1_used~0_In-71042983 |ULTIMATE.start_main_#t~ite38_Out-71042983|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-71042983 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-71042983 256) 0)) (= (mod ~y$w_buff0_used~0_In-71042983 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-71042983 256))))) (= |ULTIMATE.start_main_#t~ite38_Out-71042983| |ULTIMATE.start_main_#t~ite37_Out-71042983|) (= ~y$w_buff1_used~0_In-71042983 |ULTIMATE.start_main_#t~ite37_Out-71042983|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-71042983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-71042983, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-71042983|, ~weak$$choice2~0=~weak$$choice2~0_In-71042983, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71042983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71042983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-71042983, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-71042983, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-71042983|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-71042983|, ~weak$$choice2~0=~weak$$choice2~0_In-71042983, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-71042983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71042983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:04:30,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} 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_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} 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 07:04:30,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, 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 07:04:30,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] 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 07:04:30,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:04:30 BasicIcfg [2019-12-27 07:04:30,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:04:30,661 INFO L168 Benchmark]: Toolchain (without parser) took 15088.41 ms. Allocated memory was 138.4 MB in the beginning and 690.5 MB in the end (delta: 552.1 MB). Free memory was 101.6 MB in the beginning and 401.1 MB in the end (delta: -299.5 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,664 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.14 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.03 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,669 INFO L168 Benchmark]: Boogie Preprocessor took 56.60 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,670 INFO L168 Benchmark]: RCFGBuilder took 757.64 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 107.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,671 INFO L168 Benchmark]: TraceAbstraction took 13437.03 ms. Allocated memory was 202.9 MB in the beginning and 690.5 MB in the end (delta: 487.6 MB). Free memory was 107.0 MB in the beginning and 401.1 MB in the end (delta: -294.1 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:30,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.14 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.03 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.60 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 757.64 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 107.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13437.03 ms. Allocated memory was 202.9 MB in the beginning and 690.5 MB in the end (delta: 487.6 MB). Free memory was 107.0 MB in the beginning and 401.1 MB in the end (delta: -294.1 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 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(&t1611, ((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(&t1612, ((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: 13.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1239 SDtfs, 1225 SDslu, 2225 SDs, 0 SdLazy, 1143 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16072occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9178 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 50912 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...