/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/rfi001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:50:25,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:50:25,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:50:25,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:50:25,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:50:25,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:50:25,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:50:25,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:50:25,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:50:25,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:50:25,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:50:25,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:50:25,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:50:25,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:50:25,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:50:25,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:50:25,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:50:25,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:50:25,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:50:25,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:50:25,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:50:25,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:50:25,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:50:25,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:50:25,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:50:25,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:50:25,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:50:25,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:50:25,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:50:25,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:50:25,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:50:25,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:50:25,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:50:25,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:50:25,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:50:25,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:50:25,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:50:25,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:50:25,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:50:25,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:50:25,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:50:25,520 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 21:50:25,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:50:25,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:50:25,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:50:25,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:50:25,548 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:50:25,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:50:25,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:50:25,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:50:25,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:50:25,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:50:25,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:50:25,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:50:25,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:50:25,551 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:50:25,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:50:25,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:50:25,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:50:25,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:50:25,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:50:25,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:50:25,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:50:25,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:25,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:50:25,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:50:25,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:50:25,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:50:25,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:50:25,554 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:50:25,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:50:25,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:50:25,555 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:50:25,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:50:25,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:50:25,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:50:25,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:50:25,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:50:25,848 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:50:25,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-27 21:50:25,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5defee05c/0a61b2ae194e44a9a3f803615b26532a/FLAGe99590335 [2019-12-27 21:50:26,417 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:50:26,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-27 21:50:26,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5defee05c/0a61b2ae194e44a9a3f803615b26532a/FLAGe99590335 [2019-12-27 21:50:26,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5defee05c/0a61b2ae194e44a9a3f803615b26532a [2019-12-27 21:50:26,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:50:26,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:50:26,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:26,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:50:26,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:50:26,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:26" (1/1) ... [2019-12-27 21:50:26,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:26, skipping insertion in model container [2019-12-27 21:50:26,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:26" (1/1) ... [2019-12-27 21:50:26,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:50:26,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:50:27,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:27,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:50:27,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:27,524 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:50:27,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27 WrapperNode [2019-12-27 21:50:27,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:27,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:27,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:50:27,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:50:27,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:27,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:50:27,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:50:27,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:50:27,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (1/1) ... [2019-12-27 21:50:27,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:50:27,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:50:27,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:50:27,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:50:27,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (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 21:50:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:50:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:50:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:50:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:50:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:50:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:50:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:50:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:50:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:50:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:50:27,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:50:27,740 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 21:50:28,605 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:50:28,606 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:50:28,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:28 BoogieIcfgContainer [2019-12-27 21:50:28,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:50:28,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:50:28,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:50:28,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:50:28,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:26" (1/3) ... [2019-12-27 21:50:28,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:28, skipping insertion in model container [2019-12-27 21:50:28,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:27" (2/3) ... [2019-12-27 21:50:28,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:28, skipping insertion in model container [2019-12-27 21:50:28,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:28" (3/3) ... [2019-12-27 21:50:28,621 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2019-12-27 21:50:28,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:50:28,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:50:28,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:50:28,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:50:28,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:28,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:50:28,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:50:28,745 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:50:28,745 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:50:28,745 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:50:28,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:50:28,746 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:50:28,746 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:50:28,746 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:50:28,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:50:28,783 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:28,867 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:28,868 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:28,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:28,901 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:28,943 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:28,943 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:28,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:28,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:50:28,964 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:50:32,081 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:50:32,188 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:50:32,207 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-27 21:50:32,207 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 21:50:32,211 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 21:50:32,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-27 21:50:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-27 21:50:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:50:32,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:32,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:50:32,740 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-27 21:50:32,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:32,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233777147] [2019-12-27 21:50:32,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:32,997 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 21:50:32,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233777147] [2019-12-27 21:50:32,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:33,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:50:33,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612791165] [2019-12-27 21:50:33,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:33,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:33,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:50:33,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:33,029 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:33,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:33,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:33,048 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-27 21:50:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:33,350 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-27 21:50:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:33,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:50:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:33,460 INFO L225 Difference]: With dead ends: 9298 [2019-12-27 21:50:33,460 INFO L226 Difference]: Without dead ends: 9116 [2019-12-27 21:50:33,461 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 21:50:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-27 21:50:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-27 21:50:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 21:50:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-27 21:50:33,895 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-27 21:50:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:33,895 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-27 21:50:33,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-27 21:50:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:50:33,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:33,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:33,899 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-27 21:50:33,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:33,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112441044] [2019-12-27 21:50:33,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:34,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112441044] [2019-12-27 21:50:34,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:34,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:34,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745924517] [2019-12-27 21:50:34,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:34,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:34,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:50:34,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:34,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:34,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:34,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:34,186 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 5 states. [2019-12-27 21:50:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:34,614 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-27 21:50:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:34,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:50:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:34,685 INFO L225 Difference]: With dead ends: 14491 [2019-12-27 21:50:34,685 INFO L226 Difference]: Without dead ends: 14484 [2019-12-27 21:50:34,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 21:50:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-27 21:50:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-27 21:50:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-27 21:50:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-27 21:50:35,231 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-27 21:50:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,232 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-27 21:50:35,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-27 21:50:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:50:35,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:35,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-27 21:50:35,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098310880] [2019-12-27 21:50:35,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:35,375 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 21:50:35,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098310880] [2019-12-27 21:50:35,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:35,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:35,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046340988] [2019-12-27 21:50:35,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:35,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:35,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:50:35,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:35,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:35,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:35,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:35,381 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-27 21:50:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,421 INFO L93 Difference]: Finished difference Result 2045 states and 4753 transitions. [2019-12-27 21:50:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:50:35,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:50:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,426 INFO L225 Difference]: With dead ends: 2045 [2019-12-27 21:50:35,427 INFO L226 Difference]: Without dead ends: 1759 [2019-12-27 21:50:35,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-27 21:50:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1759. [2019-12-27 21:50:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2019-12-27 21:50:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 3962 transitions. [2019-12-27 21:50:35,465 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 3962 transitions. Word has length 11 [2019-12-27 21:50:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,465 INFO L462 AbstractCegarLoop]: Abstraction has 1759 states and 3962 transitions. [2019-12-27 21:50:35,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 3962 transitions. [2019-12-27 21:50:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:50:35,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:35,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1474097368, now seen corresponding path program 1 times [2019-12-27 21:50:35,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255698603] [2019-12-27 21:50:35,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:35,615 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 21:50:35,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255698603] [2019-12-27 21:50:35,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:35,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:35,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140323889] [2019-12-27 21:50:35,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:35,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:35,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:50:35,629 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:35,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:35,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:50:35,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:50:35,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:35,651 INFO L87 Difference]: Start difference. First operand 1759 states and 3962 transitions. Second operand 6 states. [2019-12-27 21:50:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,700 INFO L93 Difference]: Finished difference Result 404 states and 752 transitions. [2019-12-27 21:50:35,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:35,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-27 21:50:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,702 INFO L225 Difference]: With dead ends: 404 [2019-12-27 21:50:35,702 INFO L226 Difference]: Without dead ends: 358 [2019-12-27 21:50:35,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:50:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-27 21:50:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 323. [2019-12-27 21:50:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-27 21:50:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 597 transitions. [2019-12-27 21:50:35,709 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 597 transitions. Word has length 23 [2019-12-27 21:50:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,709 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 597 transitions. [2019-12-27 21:50:35,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:50:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 597 transitions. [2019-12-27 21:50:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:35,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:35,712 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1103380218, now seen corresponding path program 1 times [2019-12-27 21:50:35,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897774575] [2019-12-27 21:50:35,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:35,786 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 21:50:35,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897774575] [2019-12-27 21:50:35,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:35,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:35,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471773840] [2019-12-27 21:50:35,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:35,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:35,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 21:50:35,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:35,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:35,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:35,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:35,923 INFO L87 Difference]: Start difference. First operand 323 states and 597 transitions. Second operand 3 states. [2019-12-27 21:50:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,972 INFO L93 Difference]: Finished difference Result 333 states and 612 transitions. [2019-12-27 21:50:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:35,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:50:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,973 INFO L225 Difference]: With dead ends: 333 [2019-12-27 21:50:35,973 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 21:50:35,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 21:50:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-12-27 21:50:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 21:50:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 608 transitions. [2019-12-27 21:50:35,981 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 608 transitions. Word has length 52 [2019-12-27 21:50:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,981 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 608 transitions. [2019-12-27 21:50:35,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 608 transitions. [2019-12-27 21:50:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:35,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:35,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-27 21:50:35,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529216497] [2019-12-27 21:50:35,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:36,054 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 21:50:36,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529216497] [2019-12-27 21:50:36,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:36,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:36,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257652136] [2019-12-27 21:50:36,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:36,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:36,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 21:50:36,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:36,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:36,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:36,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:36,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:36,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:36,115 INFO L87 Difference]: Start difference. First operand 329 states and 608 transitions. Second operand 3 states. [2019-12-27 21:50:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:36,128 INFO L93 Difference]: Finished difference Result 329 states and 595 transitions. [2019-12-27 21:50:36,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:36,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:50:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:36,132 INFO L225 Difference]: With dead ends: 329 [2019-12-27 21:50:36,132 INFO L226 Difference]: Without dead ends: 329 [2019-12-27 21:50:36,134 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 21:50:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-27 21:50:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-12-27 21:50:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 21:50:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 595 transitions. [2019-12-27 21:50:36,142 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 595 transitions. Word has length 52 [2019-12-27 21:50:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:36,144 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 595 transitions. [2019-12-27 21:50:36,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 595 transitions. [2019-12-27 21:50:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:50:36,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:36,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:36,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-27 21:50:36,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:36,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742205648] [2019-12-27 21:50:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:36,408 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 21:50:36,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742205648] [2019-12-27 21:50:36,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:36,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:36,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755579660] [2019-12-27 21:50:36,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:36,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:36,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 21:50:36,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:36,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:50:36,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:50:36,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:50:36,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:50:36,558 INFO L87 Difference]: Start difference. First operand 329 states and 595 transitions. Second operand 10 states. [2019-12-27 21:50:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:37,233 INFO L93 Difference]: Finished difference Result 579 states and 1018 transitions. [2019-12-27 21:50:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:50:37,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 21:50:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:37,236 INFO L225 Difference]: With dead ends: 579 [2019-12-27 21:50:37,236 INFO L226 Difference]: Without dead ends: 579 [2019-12-27 21:50:37,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:50:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-27 21:50:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 371. [2019-12-27 21:50:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-12-27 21:50:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 671 transitions. [2019-12-27 21:50:37,246 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 671 transitions. Word has length 53 [2019-12-27 21:50:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:37,247 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 671 transitions. [2019-12-27 21:50:37,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:50:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 671 transitions. [2019-12-27 21:50:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:50:37,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:37,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:37,248 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:37,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1194206821, now seen corresponding path program 2 times [2019-12-27 21:50:37,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:37,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165085578] [2019-12-27 21:50:37,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:37,348 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 21:50:37,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165085578] [2019-12-27 21:50:37,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:37,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:37,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554646911] [2019-12-27 21:50:37,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:37,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:37,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 92 transitions. [2019-12-27 21:50:37,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:37,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:37,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:37,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:37,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:37,404 INFO L87 Difference]: Start difference. First operand 371 states and 671 transitions. Second operand 3 states. [2019-12-27 21:50:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:37,456 INFO L93 Difference]: Finished difference Result 370 states and 669 transitions. [2019-12-27 21:50:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:37,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:50:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:37,458 INFO L225 Difference]: With dead ends: 370 [2019-12-27 21:50:37,458 INFO L226 Difference]: Without dead ends: 370 [2019-12-27 21:50:37,459 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 21:50:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-27 21:50:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 276. [2019-12-27 21:50:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-27 21:50:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 494 transitions. [2019-12-27 21:50:37,465 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 494 transitions. Word has length 53 [2019-12-27 21:50:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:37,465 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 494 transitions. [2019-12-27 21:50:37,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 494 transitions. [2019-12-27 21:50:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:37,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:37,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:37,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-27 21:50:37,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:37,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104716027] [2019-12-27 21:50:37,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:38,058 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 21:50:38,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104716027] [2019-12-27 21:50:38,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:38,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 21:50:38,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640030823] [2019-12-27 21:50:38,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:38,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:38,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 119 transitions. [2019-12-27 21:50:38,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:38,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:50:38,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:50:38,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:50:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:50:38,561 INFO L87 Difference]: Start difference. First operand 276 states and 494 transitions. Second operand 19 states. [2019-12-27 21:50:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:41,320 INFO L93 Difference]: Finished difference Result 765 states and 1324 transitions. [2019-12-27 21:50:41,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 21:50:41,321 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-27 21:50:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:41,323 INFO L225 Difference]: With dead ends: 765 [2019-12-27 21:50:41,323 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 21:50:41,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=329, Invalid=1563, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 21:50:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 21:50:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 303. [2019-12-27 21:50:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-27 21:50:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 536 transitions. [2019-12-27 21:50:41,333 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 536 transitions. Word has length 54 [2019-12-27 21:50:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:41,333 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 536 transitions. [2019-12-27 21:50:41,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:50:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 536 transitions. [2019-12-27 21:50:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:41,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:41,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:41,335 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1183717707, now seen corresponding path program 2 times [2019-12-27 21:50:41,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:41,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102090195] [2019-12-27 21:50:41,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:41,619 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 21:50:41,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102090195] [2019-12-27 21:50:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:41,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:50:41,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148727958] [2019-12-27 21:50:41,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:41,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:41,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 91 transitions. [2019-12-27 21:50:41,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:41,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:50:41,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:50:41,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:50:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:50:41,703 INFO L87 Difference]: Start difference. First operand 303 states and 536 transitions. Second operand 15 states. [2019-12-27 21:50:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:43,035 INFO L93 Difference]: Finished difference Result 689 states and 1187 transitions. [2019-12-27 21:50:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:50:43,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 21:50:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:43,037 INFO L225 Difference]: With dead ends: 689 [2019-12-27 21:50:43,037 INFO L226 Difference]: Without dead ends: 349 [2019-12-27 21:50:43,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:50:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-27 21:50:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 267. [2019-12-27 21:50:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-27 21:50:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 458 transitions. [2019-12-27 21:50:43,043 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 458 transitions. Word has length 54 [2019-12-27 21:50:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:43,043 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 458 transitions. [2019-12-27 21:50:43,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:50:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 458 transitions. [2019-12-27 21:50:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:43,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:43,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:43,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash -853828981, now seen corresponding path program 3 times [2019-12-27 21:50:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:43,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848039800] [2019-12-27 21:50:43,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:43,273 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 21:50:43,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848039800] [2019-12-27 21:50:43,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:43,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:50:43,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287743749] [2019-12-27 21:50:43,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:43,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:43,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 90 transitions. [2019-12-27 21:50:43,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:43,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:50:43,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:50:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:50:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:50:43,390 INFO L87 Difference]: Start difference. First operand 267 states and 458 transitions. Second operand 12 states. [2019-12-27 21:50:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:44,056 INFO L93 Difference]: Finished difference Result 410 states and 685 transitions. [2019-12-27 21:50:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:50:44,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 21:50:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:44,058 INFO L225 Difference]: With dead ends: 410 [2019-12-27 21:50:44,058 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 21:50:44,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:50:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 21:50:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 21:50:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 21:50:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-27 21:50:44,064 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 54 [2019-12-27 21:50:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:44,064 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-27 21:50:44,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:50:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-27 21:50:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:44,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:44,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:44,065 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 4 times [2019-12-27 21:50:44,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:44,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828130140] [2019-12-27 21:50:44,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:44,165 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:50:44,165 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:50:44,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1613~0.base_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1613~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1613~0.base_19|) |v_ULTIMATE.start_main_~#t1613~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1613~0.base_19| 4)) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1613~0.base_19|) 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1613~0.base_19| 1)) (= v_~y$w_buff0_used~0_106 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z~0_9) (= v_~y$w_buff1_used~0_64 0) (= |v_ULTIMATE.start_main_~#t1613~0.offset_14| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_~#t1614~0.base=|v_ULTIMATE.start_main_~#t1614~0.base_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1614~0.offset=|v_ULTIMATE.start_main_~#t1614~0.offset_13|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ULTIMATE.start_main_~#t1613~0.base=|v_ULTIMATE.start_main_~#t1613~0.base_19|, ~y~0=v_~y~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, ULTIMATE.start_main_~#t1613~0.offset=|v_ULTIMATE.start_main_~#t1613~0.offset_14|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_~#t1614~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1614~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ULTIMATE.start_main_~#t1613~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1613~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:50:44,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1614~0.base_11| 1) |v_#valid_23|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1614~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1614~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1614~0.base_11|) |v_ULTIMATE.start_main_~#t1614~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1614~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1614~0.base_11|) (= |v_ULTIMATE.start_main_~#t1614~0.offset_10| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1614~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1614~0.offset=|v_ULTIMATE.start_main_~#t1614~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1614~0.base=|v_ULTIMATE.start_main_~#t1614~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1614~0.base] because there is no mapped edge [2019-12-27 21:50:44,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:50:44,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In271631903 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In271631903 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out271631903| |P0Thread1of1ForFork0_#t~ite3_Out271631903|))) (or (and (not .cse0) (= ~y$w_buff1~0_In271631903 |P0Thread1of1ForFork0_#t~ite3_Out271631903|) .cse1 (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out271631903| ~y~0_In271631903) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In271631903, ~y$w_buff1~0=~y$w_buff1~0_In271631903, ~y~0=~y~0_In271631903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271631903} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In271631903, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out271631903|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out271631903|, ~y$w_buff1~0=~y$w_buff1~0_In271631903, ~y~0=~y~0_In271631903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271631903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:50:44,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1916087436 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1916087436 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1916087436| ~y$w_buff0_used~0_In1916087436)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1916087436| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1916087436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1916087436} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1916087436|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1916087436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1916087436} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:50:44,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In156015110 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In156015110 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In156015110 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In156015110 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out156015110|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out156015110| ~y$w_buff1_used~0_In156015110)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In156015110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In156015110, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In156015110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In156015110} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out156015110|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In156015110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In156015110, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In156015110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In156015110} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:50:44,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1602406252 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1602406252 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1602406252| ~y$r_buff0_thd1~0_In1602406252)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1602406252| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1602406252, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602406252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1602406252, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1602406252|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602406252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:50:44,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2130756519 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2130756519 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2130756519 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2130756519 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2130756519|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-2130756519| ~y$r_buff1_thd1~0_In-2130756519) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2130756519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130756519, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2130756519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130756519} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2130756519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130756519, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2130756519|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2130756519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2130756519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:50:44,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:50:44,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1471937779 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1471937779 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1471937779| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1471937779 |P1Thread1of1ForFork1_#t~ite11_Out1471937779|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1471937779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1471937779} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1471937779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1471937779, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1471937779|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:50:44,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-6161752 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-6161752 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-6161752 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-6161752 256) 0))) (or (and (= ~y$w_buff1_used~0_In-6161752 |P1Thread1of1ForFork1_#t~ite12_Out-6161752|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-6161752|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-6161752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-6161752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-6161752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-6161752} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-6161752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-6161752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-6161752, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-6161752|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-6161752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:50:44,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In835978214 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In835978214 256) 0))) (or (and (= 0 ~y$r_buff0_thd2~0_Out835978214) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In835978214 ~y$r_buff0_thd2~0_Out835978214) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In835978214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In835978214} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In835978214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out835978214, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out835978214|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 21:50:44,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1769450297 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1769450297 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1769450297 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1769450297 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1769450297| ~y$r_buff1_thd2~0_In1769450297) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1769450297| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1769450297, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1769450297, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1769450297, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1769450297} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1769450297, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1769450297, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1769450297, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1769450297|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1769450297} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:50:44,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:50:44,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:50:44,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-171644355 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-171644355 256)))) (or (and (= ~y~0_In-171644355 |ULTIMATE.start_main_#t~ite17_Out-171644355|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-171644355 |ULTIMATE.start_main_#t~ite17_Out-171644355|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-171644355, ~y~0=~y~0_In-171644355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-171644355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-171644355} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-171644355|, ~y$w_buff1~0=~y$w_buff1~0_In-171644355, ~y~0=~y~0_In-171644355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-171644355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-171644355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 21:50:44,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 21:50:44,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1992655253 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1992655253 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1992655253 |ULTIMATE.start_main_#t~ite19_Out1992655253|)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out1992655253|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1992655253, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1992655253} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1992655253, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1992655253|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1992655253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:50:44,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1885409057 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1885409057 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1885409057 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1885409057 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1885409057| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out1885409057| ~y$w_buff1_used~0_In1885409057)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1885409057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1885409057, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1885409057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885409057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1885409057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1885409057, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1885409057|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1885409057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885409057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:50:44,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1273170530 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1273170530 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1273170530| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out1273170530| ~y$r_buff0_thd0~0_In1273170530) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1273170530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1273170530} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1273170530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1273170530, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1273170530|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:50:44,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1440059728 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1440059728 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1440059728 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1440059728 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-1440059728| ~y$r_buff1_thd0~0_In-1440059728)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-1440059728| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440059728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1440059728, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1440059728, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440059728} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1440059728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1440059728, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1440059728, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1440059728|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1440059728} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:50:44,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1924432709 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1924432709 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1924432709 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1924432709 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1924432709 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite37_Out-1924432709| ~y$w_buff1_used~0_In-1924432709) (= |ULTIMATE.start_main_#t~ite37_Out-1924432709| |ULTIMATE.start_main_#t~ite38_Out-1924432709|)) (and (= |ULTIMATE.start_main_#t~ite37_In-1924432709| |ULTIMATE.start_main_#t~ite37_Out-1924432709|) (= ~y$w_buff1_used~0_In-1924432709 |ULTIMATE.start_main_#t~ite38_Out-1924432709|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924432709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1924432709, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1924432709|, ~weak$$choice2~0=~weak$$choice2~0_In-1924432709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1924432709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924432709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924432709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1924432709, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1924432709|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1924432709|, ~weak$$choice2~0=~weak$$choice2~0_In-1924432709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1924432709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924432709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:50:44,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 21:50:44,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:50:44,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:50:44,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:50:44 BasicIcfg [2019-12-27 21:50:44,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:50:44,284 INFO L168 Benchmark]: Toolchain (without parser) took 17535.91 ms. Allocated memory was 137.9 MB in the beginning and 648.0 MB in the end (delta: 510.1 MB). Free memory was 101.0 MB in the beginning and 404.0 MB in the end (delta: -303.0 MB). Peak memory consumption was 207.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,286 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.63 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 153.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.87 ms. Allocated memory is still 201.3 MB. Free memory was 153.8 MB in the beginning and 150.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,290 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,291 INFO L168 Benchmark]: RCFGBuilder took 974.15 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 103.4 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,293 INFO L168 Benchmark]: TraceAbstraction took 15672.79 ms. Allocated memory was 201.3 MB in the beginning and 648.0 MB in the end (delta: 446.7 MB). Free memory was 102.8 MB in the beginning and 404.0 MB in the end (delta: -301.3 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:44,306 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.15 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.63 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 153.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.87 ms. Allocated memory is still 201.3 MB. Free memory was 153.8 MB in the beginning and 150.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.65 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 974.15 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 103.4 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15672.79 ms. Allocated memory was 201.3 MB in the beginning and 648.0 MB in the end (delta: 446.7 MB). Free memory was 102.8 MB in the beginning and 404.0 MB in the end (delta: -301.3 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1140 SDtfs, 1679 SDslu, 3573 SDs, 0 SdLazy, 3470 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 35 SyntacticMatches, 18 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13090occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 2144 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 105550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...