/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:58:28,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:58:28,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:58:28,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:58:28,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:58:28,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:58:28,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:58:28,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:58:28,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:58:28,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:58:28,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:58:28,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:58:28,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:58:28,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:58:28,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:58:28,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:58:28,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:58:28,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:58:28,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:58:28,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:58:28,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:58:28,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:58:28,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:58:28,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:58:28,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:58:28,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:58:28,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:58:28,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:58:28,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:58:28,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:58:28,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:58:28,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:58:28,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:58:28,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:58:28,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:58:28,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:58:28,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:58:28,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:58:28,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:58:28,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:58:28,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:58:28,415 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-MCR.epf [2019-12-27 20:58:28,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:58:28,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:58:28,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:58:28,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:58:28,443 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:58:28,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:58:28,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:58:28,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:58:28,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:58:28,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:58:28,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:58:28,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:58:28,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:58:28,445 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:58:28,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:58:28,446 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:58:28,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:58:28,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:58:28,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:58:28,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:58:28,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:58:28,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:28,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:58:28,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:58:28,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:58:28,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:58:28,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:58:28,449 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:58:28,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:58:28,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:58:28,449 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:58:28,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:58:28,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:58:28,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:58:28,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:58:28,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:58:28,731 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:58:28,732 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-27 20:58:28,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb2dc7c3/a7b6b5999cd249d18c90b34cd036ade7/FLAGa30d4c652 [2019-12-27 20:58:29,327 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:58:29,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-27 20:58:29,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb2dc7c3/a7b6b5999cd249d18c90b34cd036ade7/FLAGa30d4c652 [2019-12-27 20:58:29,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb2dc7c3/a7b6b5999cd249d18c90b34cd036ade7 [2019-12-27 20:58:29,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:58:29,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:58:29,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:29,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:58:29,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:58:29,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:29" (1/1) ... [2019-12-27 20:58:29,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c9cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:29, skipping insertion in model container [2019-12-27 20:58:29,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:29" (1/1) ... [2019-12-27 20:58:29,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:58:29,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:58:30,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:30,222 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:58:30,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:30,401 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:58:30,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30 WrapperNode [2019-12-27 20:58:30,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:30,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:30,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:58:30,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:58:30,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:30,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:58:30,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:58:30,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:58:30,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (1/1) ... [2019-12-27 20:58:30,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:58:30,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:58:30,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:58:30,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:58:30,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (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 20:58:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:58:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:58:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:58:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:58:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:58:30,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:58:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:58:30,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:58:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:58:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:58:30,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:58:30,599 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 20:58:31,257 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:58:31,258 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:58:31,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:31 BoogieIcfgContainer [2019-12-27 20:58:31,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:58:31,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:58:31,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:58:31,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:58:31,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:58:29" (1/3) ... [2019-12-27 20:58:31,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631277b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:31, skipping insertion in model container [2019-12-27 20:58:31,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:30" (2/3) ... [2019-12-27 20:58:31,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631277b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:31, skipping insertion in model container [2019-12-27 20:58:31,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:31" (3/3) ... [2019-12-27 20:58:31,270 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-12-27 20:58:31,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:58:31,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:58:31,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:58:31,293 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:58:31,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:31,431 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:58:31,449 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:58:31,449 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:58:31,449 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:58:31,449 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:58:31,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:58:31,450 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:58:31,466 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:58:31,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:58:31,490 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 20:58:31,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 20:58:31,601 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 20:58:31,601 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:31,618 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:58:31,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 20:58:31,713 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 20:58:31,713 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:31,718 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:58:31,729 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 20:58:31,730 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:58:34,653 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:58:34,759 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:58:34,858 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47140 [2019-12-27 20:58:34,858 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 20:58:34,862 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 81 transitions [2019-12-27 20:58:35,238 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7039 states. [2019-12-27 20:58:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states. [2019-12-27 20:58:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:58:35,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:35,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:58:35,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:35,256 INFO L82 PathProgramCache]: Analyzing trace with hash 676937921, now seen corresponding path program 1 times [2019-12-27 20:58:35,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:35,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15323471] [2019-12-27 20:58:35,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:35,535 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 20:58:35,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15323471] [2019-12-27 20:58:35,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:35,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:58:35,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029596684] [2019-12-27 20:58:35,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:35,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:35,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:58:35,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:35,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:35,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:35,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:35,574 INFO L87 Difference]: Start difference. First operand 7039 states. Second operand 3 states. [2019-12-27 20:58:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:35,844 INFO L93 Difference]: Finished difference Result 6767 states and 23009 transitions. [2019-12-27 20:58:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:35,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:58:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:35,937 INFO L225 Difference]: With dead ends: 6767 [2019-12-27 20:58:35,941 INFO L226 Difference]: Without dead ends: 6364 [2019-12-27 20:58:35,942 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 20:58:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6364 states. [2019-12-27 20:58:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6364 to 6364. [2019-12-27 20:58:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2019-12-27 20:58:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 21600 transitions. [2019-12-27 20:58:36,324 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 21600 transitions. Word has length 5 [2019-12-27 20:58:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:36,325 INFO L462 AbstractCegarLoop]: Abstraction has 6364 states and 21600 transitions. [2019-12-27 20:58:36,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 21600 transitions. [2019-12-27 20:58:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:58:36,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:36,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:36,333 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:36,333 INFO L82 PathProgramCache]: Analyzing trace with hash 616679643, now seen corresponding path program 1 times [2019-12-27 20:58:36,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:36,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423538539] [2019-12-27 20:58:36,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:36,437 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 20:58:36,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423538539] [2019-12-27 20:58:36,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:36,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:36,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688415846] [2019-12-27 20:58:36,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:36,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:36,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:58:36,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:36,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:36,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:36,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:36,446 INFO L87 Difference]: Start difference. First operand 6364 states and 21600 transitions. Second operand 3 states. [2019-12-27 20:58:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:36,493 INFO L93 Difference]: Finished difference Result 1256 states and 3141 transitions. [2019-12-27 20:58:36,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:36,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:58:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:36,503 INFO L225 Difference]: With dead ends: 1256 [2019-12-27 20:58:36,503 INFO L226 Difference]: Without dead ends: 1256 [2019-12-27 20:58:36,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-12-27 20:58:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-12-27 20:58:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-12-27 20:58:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3141 transitions. [2019-12-27 20:58:36,543 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3141 transitions. Word has length 11 [2019-12-27 20:58:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:36,544 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3141 transitions. [2019-12-27 20:58:36,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3141 transitions. [2019-12-27 20:58:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:36,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:36,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:36,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1879138245, now seen corresponding path program 1 times [2019-12-27 20:58:36,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:36,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936490881] [2019-12-27 20:58:36,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:36,691 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 20:58:36,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936490881] [2019-12-27 20:58:36,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:36,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:36,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087806421] [2019-12-27 20:58:36,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:36,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:36,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:58:36,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:36,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:36,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:36,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:36,760 INFO L87 Difference]: Start difference. First operand 1256 states and 3141 transitions. Second operand 5 states. [2019-12-27 20:58:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:36,879 INFO L93 Difference]: Finished difference Result 1890 states and 4794 transitions. [2019-12-27 20:58:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:36,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:58:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:36,892 INFO L225 Difference]: With dead ends: 1890 [2019-12-27 20:58:36,892 INFO L226 Difference]: Without dead ends: 1890 [2019-12-27 20:58:36,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2019-12-27 20:58:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1402. [2019-12-27 20:58:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 20:58:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3578 transitions. [2019-12-27 20:58:36,948 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3578 transitions. Word has length 14 [2019-12-27 20:58:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:36,949 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3578 transitions. [2019-12-27 20:58:36,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3578 transitions. [2019-12-27 20:58:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:36,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:36,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:36,951 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1741563407, now seen corresponding path program 1 times [2019-12-27 20:58:36,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:36,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016864438] [2019-12-27 20:58:36,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:37,052 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 20:58:37,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016864438] [2019-12-27 20:58:37,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:37,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:37,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874637785] [2019-12-27 20:58:37,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:37,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:37,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:58:37,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:37,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:58:37,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:37,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:37,081 INFO L87 Difference]: Start difference. First operand 1402 states and 3578 transitions. Second operand 5 states. [2019-12-27 20:58:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:37,286 INFO L93 Difference]: Finished difference Result 1822 states and 4488 transitions. [2019-12-27 20:58:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:37,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:58:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:37,297 INFO L225 Difference]: With dead ends: 1822 [2019-12-27 20:58:37,297 INFO L226 Difference]: Without dead ends: 1822 [2019-12-27 20:58:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:58:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-12-27 20:58:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1690. [2019-12-27 20:58:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 20:58:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4193 transitions. [2019-12-27 20:58:37,344 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4193 transitions. Word has length 14 [2019-12-27 20:58:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:37,344 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4193 transitions. [2019-12-27 20:58:37,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4193 transitions. [2019-12-27 20:58:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:37,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:37,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:37,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash -630956330, now seen corresponding path program 1 times [2019-12-27 20:58:37,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:37,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10144690] [2019-12-27 20:58:37,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:37,404 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 20:58:37,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10144690] [2019-12-27 20:58:37,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:37,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:37,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774958725] [2019-12-27 20:58:37,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:37,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:37,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:58:37,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:37,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:58:37,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:37,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:37,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:37,430 INFO L87 Difference]: Start difference. First operand 1690 states and 4193 transitions. Second operand 5 states. [2019-12-27 20:58:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:37,632 INFO L93 Difference]: Finished difference Result 2106 states and 5110 transitions. [2019-12-27 20:58:37,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:37,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:58:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:37,645 INFO L225 Difference]: With dead ends: 2106 [2019-12-27 20:58:37,645 INFO L226 Difference]: Without dead ends: 2106 [2019-12-27 20:58:37,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:58:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-12-27 20:58:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1722. [2019-12-27 20:58:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-27 20:58:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4268 transitions. [2019-12-27 20:58:37,695 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 4268 transitions. Word has length 14 [2019-12-27 20:58:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:37,695 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 4268 transitions. [2019-12-27 20:58:37,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 4268 transitions. [2019-12-27 20:58:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:37,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:37,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:37,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1908220347, now seen corresponding path program 1 times [2019-12-27 20:58:37,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:37,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188050465] [2019-12-27 20:58:37,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:37,822 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 20:58:37,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188050465] [2019-12-27 20:58:37,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:37,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:58:37,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [343525058] [2019-12-27 20:58:37,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:37,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:37,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:58:37,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:37,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:37,839 INFO L87 Difference]: Start difference. First operand 1722 states and 4268 transitions. Second operand 5 states. [2019-12-27 20:58:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:38,311 INFO L93 Difference]: Finished difference Result 2539 states and 6152 transitions. [2019-12-27 20:58:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:58:38,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:38,327 INFO L225 Difference]: With dead ends: 2539 [2019-12-27 20:58:38,327 INFO L226 Difference]: Without dead ends: 2539 [2019-12-27 20:58:38,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:58:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-12-27 20:58:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2088. [2019-12-27 20:58:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-12-27 20:58:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5108 transitions. [2019-12-27 20:58:38,381 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5108 transitions. Word has length 26 [2019-12-27 20:58:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:38,382 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 5108 transitions. [2019-12-27 20:58:38,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5108 transitions. [2019-12-27 20:58:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:38,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:38,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:38,386 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1539399223, now seen corresponding path program 1 times [2019-12-27 20:58:38,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:38,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352923396] [2019-12-27 20:58:38,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:38,420 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 20:58:38,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352923396] [2019-12-27 20:58:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:38,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:38,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282413679] [2019-12-27 20:58:38,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:38,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:38,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 20:58:38,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:38,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:38,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:38,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:38,477 INFO L87 Difference]: Start difference. First operand 2088 states and 5108 transitions. Second operand 5 states. [2019-12-27 20:58:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:38,553 INFO L93 Difference]: Finished difference Result 2656 states and 6125 transitions. [2019-12-27 20:58:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:38,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:38,566 INFO L225 Difference]: With dead ends: 2656 [2019-12-27 20:58:38,566 INFO L226 Difference]: Without dead ends: 2656 [2019-12-27 20:58:38,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-12-27 20:58:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2012. [2019-12-27 20:58:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-12-27 20:58:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 4566 transitions. [2019-12-27 20:58:38,617 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 4566 transitions. Word has length 26 [2019-12-27 20:58:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:38,618 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 4566 transitions. [2019-12-27 20:58:38,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 4566 transitions. [2019-12-27 20:58:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:38,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:38,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:38,621 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash 515096143, now seen corresponding path program 1 times [2019-12-27 20:58:38,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:38,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221960607] [2019-12-27 20:58:38,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:38,659 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 20:58:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221960607] [2019-12-27 20:58:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:38,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:38,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1402107352] [2019-12-27 20:58:38,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:38,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:38,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 20:58:38,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:38,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:58:38,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:38,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:38,692 INFO L87 Difference]: Start difference. First operand 2012 states and 4566 transitions. Second operand 5 states. [2019-12-27 20:58:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:38,713 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-27 20:58:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:38,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:38,717 INFO L225 Difference]: With dead ends: 1020 [2019-12-27 20:58:38,717 INFO L226 Difference]: Without dead ends: 1020 [2019-12-27 20:58:38,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-27 20:58:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-27 20:58:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-27 20:58:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-27 20:58:38,737 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-27 20:58:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-27 20:58:38,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-27 20:58:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:58:38,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:38,740 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] [2019-12-27 20:58:38,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash 121485183, now seen corresponding path program 1 times [2019-12-27 20:58:38,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:38,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794764846] [2019-12-27 20:58:38,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:38,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794764846] [2019-12-27 20:58:38,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:38,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:38,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406228616] [2019-12-27 20:58:38,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:38,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:38,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 137 transitions. [2019-12-27 20:58:38,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:38,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:38,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:58:38,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:58:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:58:38,949 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 9 states. [2019-12-27 20:58:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:40,021 INFO L93 Difference]: Finished difference Result 4119 states and 8393 transitions. [2019-12-27 20:58:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 20:58:40,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 20:58:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:40,030 INFO L225 Difference]: With dead ends: 4119 [2019-12-27 20:58:40,031 INFO L226 Difference]: Without dead ends: 2768 [2019-12-27 20:58:40,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:58:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2019-12-27 20:58:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 999. [2019-12-27 20:58:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 20:58:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-27 20:58:40,068 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-27 20:58:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:40,069 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-27 20:58:40,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:58:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-27 20:58:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:58:40,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:40,072 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] [2019-12-27 20:58:40,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash 946311763, now seen corresponding path program 2 times [2019-12-27 20:58:40,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:40,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582065201] [2019-12-27 20:58:40,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:40,138 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 20:58:40,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582065201] [2019-12-27 20:58:40,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:40,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:40,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85493175] [2019-12-27 20:58:40,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:40,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:40,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 79 transitions. [2019-12-27 20:58:40,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:40,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:58:40,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:58:40,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:58:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:40,225 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 7 states. [2019-12-27 20:58:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:40,340 INFO L93 Difference]: Finished difference Result 1826 states and 3774 transitions. [2019-12-27 20:58:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:58:40,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:58:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:40,343 INFO L225 Difference]: With dead ends: 1826 [2019-12-27 20:58:40,343 INFO L226 Difference]: Without dead ends: 835 [2019-12-27 20:58:40,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:58:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-27 20:58:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 727. [2019-12-27 20:58:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-27 20:58:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1499 transitions. [2019-12-27 20:58:40,358 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1499 transitions. Word has length 41 [2019-12-27 20:58:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:40,358 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1499 transitions. [2019-12-27 20:58:40,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:58:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1499 transitions. [2019-12-27 20:58:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:58:40,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:40,362 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] [2019-12-27 20:58:40,362 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash 41544589, now seen corresponding path program 3 times [2019-12-27 20:58:40,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133371909] [2019-12-27 20:58:40,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:40,519 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 20:58:40,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133371909] [2019-12-27 20:58:40,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:40,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:40,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032173175] [2019-12-27 20:58:40,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:40,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:40,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 137 transitions. [2019-12-27 20:58:40,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:40,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:58:40,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:58:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:58:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:40,560 INFO L87 Difference]: Start difference. First operand 727 states and 1499 transitions. Second operand 7 states. [2019-12-27 20:58:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:40,774 INFO L93 Difference]: Finished difference Result 1196 states and 2405 transitions. [2019-12-27 20:58:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:58:40,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:58:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:40,777 INFO L225 Difference]: With dead ends: 1196 [2019-12-27 20:58:40,777 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 20:58:40,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:58:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 20:58:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2019-12-27 20:58:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-27 20:58:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1473 transitions. [2019-12-27 20:58:40,792 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1473 transitions. Word has length 41 [2019-12-27 20:58:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:40,792 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1473 transitions. [2019-12-27 20:58:40,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:58:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1473 transitions. [2019-12-27 20:58:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:58:40,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:40,795 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] [2019-12-27 20:58:40,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1427821265, now seen corresponding path program 4 times [2019-12-27 20:58:40,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:40,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727148033] [2019-12-27 20:58:40,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:40,879 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 20:58:40,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727148033] [2019-12-27 20:58:40,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:40,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:40,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058763810] [2019-12-27 20:58:40,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:40,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:40,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 146 transitions. [2019-12-27 20:58:40,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:40,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:40,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:58:40,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:58:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:58:40,960 INFO L87 Difference]: Start difference. First operand 715 states and 1473 transitions. Second operand 6 states. [2019-12-27 20:58:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:41,361 INFO L93 Difference]: Finished difference Result 840 states and 1706 transitions. [2019-12-27 20:58:41,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:41,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:58:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:41,364 INFO L225 Difference]: With dead ends: 840 [2019-12-27 20:58:41,365 INFO L226 Difference]: Without dead ends: 840 [2019-12-27 20:58:41,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:58:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-12-27 20:58:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2019-12-27 20:58:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-27 20:58:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1528 transitions. [2019-12-27 20:58:41,381 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1528 transitions. Word has length 41 [2019-12-27 20:58:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:41,381 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1528 transitions. [2019-12-27 20:58:41,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:58:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1528 transitions. [2019-12-27 20:58:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:58:41,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:41,389 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] [2019-12-27 20:58:41,390 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1918825619, now seen corresponding path program 5 times [2019-12-27 20:58:41,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:41,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052535817] [2019-12-27 20:58:41,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:41,470 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 20:58:41,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052535817] [2019-12-27 20:58:41,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:41,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:41,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671671065] [2019-12-27 20:58:41,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:41,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:41,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 106 transitions. [2019-12-27 20:58:41,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:41,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:41,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:41,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:41,564 INFO L87 Difference]: Start difference. First operand 745 states and 1528 transitions. Second operand 3 states. [2019-12-27 20:58:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:41,576 INFO L93 Difference]: Finished difference Result 743 states and 1523 transitions. [2019-12-27 20:58:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:41,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:58:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:41,579 INFO L225 Difference]: With dead ends: 743 [2019-12-27 20:58:41,579 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 20:58:41,579 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 20:58:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 20:58:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 607. [2019-12-27 20:58:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-27 20:58:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-27 20:58:41,592 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 41 [2019-12-27 20:58:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:41,593 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-27 20:58:41,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-27 20:58:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:58:41,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:41,595 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] [2019-12-27 20:58:41,595 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1275116415, now seen corresponding path program 1 times [2019-12-27 20:58:41,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:41,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916023073] [2019-12-27 20:58:41,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:41,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:41,765 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:41,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_65) (= v_~x$r_buff1_thd0~0_18 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_25|)) (= v_~z~0_10 0) (= 0 v_~x$w_buff0_used~0_95) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t903~0.base_25| 4)) (= v_~x$r_buff1_thd1~0_39 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_18) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_19|) (= v_~x$r_buff1_thd2~0_19 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_25|) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_25| 1) |v_#valid_49|) (= v_~x$w_buff1_used~0_55 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x~0_21 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t903~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t903~0.base_25|) |v_ULTIMATE.start_main_~#t903~0.offset_19| 0)) |v_#memory_int_15|) (= v_~__unbuffered_p1_EBX~0_11 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_19|, #length=|v_#length_15|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_21, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:58:41,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-12-27 20:58:41,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~x$w_buff1_used~0_34 256)) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_60) (= 1 v_~x$w_buff0~0_16) (= v_~x$w_buff1_used~0_34 v_~x$w_buff0_used~0_61) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_61} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_60} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:58:41,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1521038699 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1521038699 256)))) (or (and (= ~x$w_buff0_used~0_In1521038699 |P1Thread1of1ForFork0_#t~ite28_Out1521038699|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1521038699|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521038699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521038699} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521038699, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1521038699|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521038699} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:58:41,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In915187671 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In915187671 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In915187671 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In915187671 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out915187671| ~x$w_buff1_used~0_In915187671)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite29_Out915187671| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In915187671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In915187671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In915187671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In915187671} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In915187671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In915187671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In915187671, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out915187671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In915187671} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:58:41,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-690455164 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-690455164 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-690455164 ~x$r_buff0_thd2~0_Out-690455164) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out-690455164 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-690455164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690455164} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-690455164|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-690455164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690455164} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:58:41,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-2058961768 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-2058961768 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2058961768 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2058961768 256)))) (or (and (= ~x$r_buff1_thd2~0_In-2058961768 |P1Thread1of1ForFork0_#t~ite31_Out-2058961768|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-2058961768|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2058961768, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2058961768, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2058961768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2058961768} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2058961768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2058961768, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2058961768, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2058961768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2058961768} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:58:41,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 20:58:41,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_39 v_~x$r_buff0_thd1~0_38) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_38, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 20:58:41,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 20:58:41,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:58:41,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-482769552 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-482769552 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-482769552 |ULTIMATE.start_main_#t~ite34_Out-482769552|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-482769552 |ULTIMATE.start_main_#t~ite34_Out-482769552|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-482769552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-482769552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-482769552, ~x~0=~x~0_In-482769552} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-482769552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-482769552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-482769552, ~x~0=~x~0_In-482769552, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-482769552|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:58:41,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:58:41,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In849126819 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In849126819 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out849126819|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In849126819 |ULTIMATE.start_main_#t~ite36_Out849126819|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In849126819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849126819} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In849126819, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out849126819|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849126819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 20:58:41,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1031574740 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1031574740 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1031574740 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1031574740 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out1031574740| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1031574740| ~x$w_buff1_used~0_In1031574740)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1031574740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1031574740, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1031574740, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1031574740} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1031574740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1031574740, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1031574740|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1031574740, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1031574740} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:58:41,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1352413780 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1352413780 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1352413780| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1352413780 |ULTIMATE.start_main_#t~ite38_Out1352413780|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1352413780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1352413780} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1352413780, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1352413780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1352413780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:58:41,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1586469759 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1586469759 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1586469759 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1586469759 256)))) (or (and (= ~x$r_buff1_thd0~0_In1586469759 |ULTIMATE.start_main_#t~ite39_Out1586469759|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1586469759|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1586469759, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1586469759, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1586469759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1586469759} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1586469759, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1586469759|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1586469759, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1586469759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1586469759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:58:41,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~main$tmp_guard1~0_11 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite39_9|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:41,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:41 BasicIcfg [2019-12-27 20:58:41,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:41,888 INFO L168 Benchmark]: Toolchain (without parser) took 12261.33 ms. Allocated memory was 138.4 MB in the beginning and 447.2 MB in the end (delta: 308.8 MB). Free memory was 101.0 MB in the beginning and 298.2 MB in the end (delta: -197.3 MB). Peak memory consumption was 111.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,889 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:58:41,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.11 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,892 INFO L168 Benchmark]: Boogie Preprocessor took 45.41 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,895 INFO L168 Benchmark]: RCFGBuilder took 750.67 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 112.1 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,896 INFO L168 Benchmark]: TraceAbstraction took 10626.22 ms. Allocated memory was 203.4 MB in the beginning and 447.2 MB in the end (delta: 243.8 MB). Free memory was 111.1 MB in the beginning and 298.2 MB in the end (delta: -187.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:41,902 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.11 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.41 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.67 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 112.1 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10626.22 ms. Allocated memory was 203.4 MB in the beginning and 447.2 MB in the end (delta: 243.8 MB). Free memory was 111.1 MB in the beginning and 298.2 MB in the end (delta: -187.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 137 ProgramPointsBefore, 68 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 18 ChoiceCompositions, 4328 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47140 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1548 SDtfs, 1665 SDslu, 3705 SDs, 0 SdLazy, 2025 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7039occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4364 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 31007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...